{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T12:20:19Z","timestamp":1743078019230,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031224751"},{"type":"electronic","value":"9783031224768"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-22476-8_6","type":"book-chapter","created":{"date-parts":[[2022,11,30]],"date-time":"2022-11-30T12:03:51Z","timestamp":1669809831000},"page":"91-108","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Compositional Verification of\u00a0Simulink Block Diagrams Using tock-$$CSP$$\u00a0and\u00a0CSP-Prover"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1518-0572","authenticated-orcid":false,"given":"Joabe","family":"Jesus","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6593-577X","authenticated-orcid":false,"given":"Augusto","family":"Sampaio","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,12,1]]},"reference":[{"key":"6_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/978-3-319-06410-9_5","volume-title":"FM 2014: Formal Methods","author":"P Antonino","year":"2014","unstructured":"Antonino, P., Sampaio, A., Woodcock, J.: A refinement based strategy for local deadlock analysis of networks of CSP processes. In: Jones, C., Pihlajasaari, P., Sun, J. (eds.) FM 2014. LNCS, vol. 8442, pp. 62\u201377. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-06410-9_5"},{"key":"6_CR2","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s00236-020-00394-3","volume":"59","author":"J Baxter","year":"2022","unstructured":"Baxter, J., Ribeiro, P., Cavalcanti, A.: Sound reasoning in tock-CSP. Acta Inf. 59, 125\u2013162 (2022). https:\/\/doi.org\/10.1007\/s00236-020-00394-3","journal-title":"Acta Inf."},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"Bernard, R., Aubert, J., Bieber, P., Merlini, C., Metge, S.: Experiments in model-based safety analysis: flight controls. In: 1st IFAC Workshop on Dependable Control of Discrete Systems (2007)","DOI":"10.3182\/20070613-3-FR-4909.00010"},{"key":"6_CR4","doi-asserted-by":"publisher","unstructured":"Bouissou, O., Chapoutot, A.: An operational semantics for Simulink\u2019s simulation engine. In: Proceedings of the 13th ACM SIGPLAN\/SIGBED International Conference on Languages, Compilers, Tools and Theory for Embedded Systems, pp. 129\u2013138. LCTES 2012, Association for Computing Machinery, New York, NY, USA (2012). https:\/\/doi.org\/10.1145\/2248418.2248437","DOI":"10.1145\/2248418.2248437"},{"key":"6_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1007\/11901433_5","volume-title":"Formal Methods and Software Engineering","author":"C Chen","year":"2006","unstructured":"Chen, C., Dong, J.S.: Applying timed interval calculus to Simulink diagrams. In: Liu, Z., He, J. (eds.) ICFEM 2006. LNCS, vol. 4260, pp. 74\u201393. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11901433_5"},{"key":"6_CR6","unstructured":"Demarchi, F.L.: Modeling and Identification of a Fly-by-Wire Control System. Thesis of master in science, Aeronautical Institute of Technology, S\u00e3o Jos\u00e9 dos Campos (2005)"},{"key":"6_CR7","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/978-3-030-92137-8","volume-title":"Formal Methods: Foundations and Applications","author":"A Didier","year":"2012","unstructured":"Didier, A., Mota, A.: Identifying hardware failures systematically. In: Gheyi, R., Naumann, D. (eds.) Formal Methods: Foundations and Applications, pp. 115\u2013130. Springer, Berlin Heidelberg, Berlin, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-030-92137-8"},{"issue":"2","key":"6_CR8","first-page":"23","volume":"14","author":"A Farias","year":"2008","unstructured":"Farias, A., Mota, A., Sampaio, A.: Compositional abstraction of CSPZ processes. J. Braz. Comput. Soc. 14(2), 23\u201344 (2008)","journal-title":"J. Braz. Comput. Soc."},{"key":"6_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/978-3-642-54862-8_13","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"T Gibson-Robinson","year":"2014","unstructured":"Gibson-Robinson, T., Armstrong, P., Boulgakov, A., Roscoe, A.W.: FDR3 \u2014 a modern refinement checker for CSP. In: \u00c1brah\u00e1m, E., Havelund, K. (eds.) TACAS 2014. LNCS, vol. 8413, pp. 187\u2013201. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-54862-8_13"},{"key":"6_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/978-3-642-34032-1_21","volume-title":"Leveraging Applications of Formal Methods, Verification and Validation. Applications and Case Studies","author":"G Gigante","year":"2012","unstructured":"Gigante, G., Pascarella, D.: Formal methods in avionic software certification: the DO-178C perspective. In: Margaria, T., Steffen, B. (eds.) ISoLA 2012. LNCS, vol. 7610, pp. 205\u2013215. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-34032-1_21"},{"key":"6_CR11","doi-asserted-by":"publisher","unstructured":"Hoare, C.A.R.: Communicating sequential processes. Commun. ACM 21(8), 666\u2013677 (1978). https:\/\/doi.org\/10.1145\/359576.359585","DOI":"10.1145\/359576.359585"},{"key":"6_CR12","unstructured":"Isobe, Y., Roggenbach, M.: User guide CSP-prover (2004)"},{"key":"6_CR13","unstructured":"Isobe, Y., Roggenbach, M., Gruner, S.: Extending CSP-Prover by deadlock-analysis: towards the verification of systolic arrays (2005)"},{"key":"6_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/978-3-642-24559-6_23","volume-title":"Formal Methods and Software Engineering","author":"J Jesus","year":"2011","unstructured":"Jesus, J., Mota, A., Sampaio, A., Grijo, L.: Architectural verification of control systems using CSP. In: Qin, S., Qiu, Z. (eds.) ICFEM 2011. LNCS, vol. 6991, pp. 323\u2013339. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-24559-6_23"},{"key":"6_CR15","unstructured":"Mathworks: Simulink User\u2019s Guide. The MathWorks, Inc. (2008). www.mathworks.com"},{"key":"6_CR16","unstructured":"Mathworks: Simulink Validation and Verification 2 User\u2019s Guide. The MathWorks, Inc. (2008). www.mathworks.com"},{"key":"6_CR17","unstructured":"Mathworks: Simulink Design Verifier User\u2019s Guide. The MathWorks, Inc. (2019). https:\/\/www.mathworks.com\/help\/pdf_doc\/sldv\/index.html"},{"key":"6_CR18","unstructured":"Mota, A., Farias, A., Sampaio, A.: Efficient analysis of infinite CSPZ processes. In: Workshop de M\u00e9todos Formais (2002)"},{"key":"6_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/978-3-642-15651-9_27","volume-title":"Computer Safety, Reliability, and Security","author":"A Mota","year":"2010","unstructured":"Mota, A., Jesus, J., Gomes, A., Ferri, F., Watanabe, E.: Evolving a safe system design iteratively. In: Schoitsch, E. (ed.) SAFECOMP 2010. LNCS, vol. 6351, pp. 361\u2013374. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15651-9_27"},{"key":"6_CR20","unstructured":"Mota, A., Sampaio, A., Borba, P.: Model checking CSPZ: techniques to overcome state explosion. Sociedade Brasileira de Computa\u00e7\u00e3o (2002)"},{"key":"6_CR21","volume-title":"Modern Control Engineering","author":"K Ogata","year":"1997","unstructured":"Ogata, K.: Modern Control Engineering. Prentice-Hall, Englewood Cliffs, NJ (1997)"},{"key":"6_CR22","unstructured":"Paulson, L.C.: Isabelle: a generic theorem prover. J. Autom. Reasoning 5 (1994)"},{"key":"6_CR23","unstructured":"Roscoe, A.: The Theory and Practice of Concurrency. Prentice Hall PTR (1997)"},{"issue":"3","key":"6_CR24","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/0890-5401(87)90004-6","volume":"75","author":"AW Roscoe","year":"1987","unstructured":"Roscoe, A.W., Dathi, N.: The pursuit of deadlock freedom. Inf. Comput. 75(3), 289\u2013327 (1987). https:\/\/doi.org\/10.1016\/0890-5401(87)90004-6","journal-title":"Inf. Comput."}],"container-title":["Lecture Notes in Computer Science","Formal Methods: Foundations and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-22476-8_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,30]],"date-time":"2022-11-30T12:04:51Z","timestamp":1669809891000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-22476-8_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031224751","9783031224768"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-22476-8_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"1 December 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SBMF","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Brazilian Symposium on Formal Methods","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 December 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 December 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sbmf2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sites.google.com\/dcomp.ufs.br\/sbmf2022","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"15","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"8","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"53% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}