{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T01:15:47Z","timestamp":1743038147618,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030129873"},{"type":"electronic","value":"9783030129880"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-12988-0_7","type":"book-chapter","created":{"date-parts":[[2019,2,1]],"date-time":"2019-02-01T00:50:09Z","timestamp":1548982209000},"page":"101-118","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Embedding CCSL into Dynamic Logic: A Logical Approach for the Verification of CCSL Specifications"],"prefix":"10.1007","author":[{"given":"Yuanrui","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hengyang","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yixiang","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fr\u00e9d\u00e9ric","family":"Mallet","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,2,2]]},"reference":[{"key":"7_CR1","unstructured":"OMG: UML profile for MARTE: Modeling and analysis of real-time embedded systems. Technical report, OMG, June 2011. Formal 02 June 2011"},{"issue":"3","key":"7_CR2","first-page":"309","volume":"4","author":"F Mallet","year":"2008","unstructured":"Mallet, F.: Clock constraint specification language: specifying clock constraints with UML\/MARTE. ISSE 4(3), 309\u2013314 (2008)","journal-title":"ISSE"},{"key":"7_CR3","unstructured":"Andr\u00e9, C.: Syntax and semantics of the clock constraint specification language (CCSL). Research Report RR-6925, INRIA (2009)"},{"key":"7_CR4","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1016\/j.scico.2015.03.001","volume":"106","author":"F Mallet","year":"2015","unstructured":"Mallet, F., de Simone, R.: Correctness issues on MARTE\/CCSL constraints. Sci. Comput. Program. 106, 78\u201392 (2015)","journal-title":"Sci. Comput. Program."},{"key":"7_CR5","unstructured":"Mallet, F., Millo, J.V., de Simone, R.: Safe CCSL specifications and marked graphs. In: 11th ACM\/IEEE International Conference on Formal Methods and Models for Codesign, pp. 157\u2013166, IEEE (2013)"},{"issue":"4","key":"7_CR6","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1145\/3140582.3081035","volume":"52","author":"Min Zhang","year":"2017","unstructured":"Zhang, M., Ying, Y.: Towards SMT-based LTL model checking of clock constraint specification language for real-time and embedded systems. In: LCTES 2017, pp. 61\u201370. ACM (2017)","journal-title":"ACM SIGPLAN Notices"},{"issue":"1","key":"7_CR7","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1145\/568438.568456","volume":"32","author":"D Harel","year":"2001","unstructured":"Harel, D., Kozen, D., Tiuryn, J.: Dynamic logic. SIGACT News 32(1), 66\u201369 (2001)","journal-title":"SIGACT News"},{"key":"7_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-09237-4","volume-title":"First-Order Dynamic Logic","year":"1979","unstructured":"Harel, D. (ed.): First-Order Dynamic Logic. LNCS, vol. 68. Springer, Heidelberg (1979). \n                    https:\/\/doi.org\/10.1007\/3-540-09237-4"},{"key":"7_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-2231-4","volume-title":"Synchronous Programming of Reactive Systems","author":"N Halbwachs","year":"1993","unstructured":"Halbwachs, N.: Synchronous Programming of Reactive Systems. Kluwer Academic Publisher, Dordrecht (1993)"},{"key":"7_CR10","unstructured":"Barrett, C., Fontaine, P., Tinelli, C.: The SMT-LIB standard: version 2.6. Technical report, Department of Computer Science, The University of Iowa (2017). \n                    www.SMT-LIB.org"},{"key":"7_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45949-9","volume-title":"Isabelle\/HOL\u2014A Proof Assistant for Higher-Order Logic","year":"2002","unstructured":"Nipkow, T., Wenzel, M., Paulson, L.C. (eds.): Isabelle\/HOL\u2014A Proof Assistant for Higher-Order Logic. LNCS, vol. 2283. Springer, Heidelberg (2002). \n                    https:\/\/doi.org\/10.1007\/3-540-45949-9"},{"key":"7_CR12","series-title":"Texts in Theoretical Computer Science. An EATCS Series","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-07964-5","volume-title":"Interactive Theorem Proving and Program Development - Coq\u2019Art: The Calculus of Inductive Constructions","author":"Y Bertot","year":"2004","unstructured":"Bertot, Y., Cast\u00e9ran, P.: Interactive Theorem Proving and Program Development - Coq\u2019Art: The Calculus of Inductive Constructions. Texts in Theoretical Computer Science. An EATCS Series. Springer, Heidelberg (2004). \n                    https:\/\/doi.org\/10.1007\/978-3-662-07964-5"},{"key":"7_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1007\/978-3-319-47846-3_27","volume-title":"Formal Methods and Software Engineering","author":"M Zhang","year":"2016","unstructured":"Zhang, M., Mallet, F., Zhu, H.: An SMT-based approach to the formal analysis of MARTE\/CCSL. In: Ogata, K., Lawford, M., Liu, S. (eds.) ICFEM 2016. LNCS, vol. 10009, pp. 433\u2013449. Springer, Cham (2016). \n                    https:\/\/doi.org\/10.1007\/978-3-319-47846-3_27"},{"issue":"2","key":"7_CR14","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/0167-6423(92)90005-V","volume":"19","author":"G Berry","year":"1992","unstructured":"Berry, G., Gonthier, G.: The Esterel synchronous programming language: design, semantics, implementation. Sci. Comput. Program. 19(2), 87\u2013152 (1992)","journal-title":"Sci. Comput. Program."},{"key":"7_CR15","unstructured":"Gentzen, G.: Untersuchungen \u00fcber das logische Schlie\u00dfen. Ph.D. thesis, NA, G\u00f6ttingen (1934)"},{"key":"7_CR16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14509-4","volume-title":"Logical Analysis of Hybrid Systems - Proving Theorems for Complex Dynamics","author":"A Platzer","year":"2010","unstructured":"Platzer, A.: Logical Analysis of Hybrid Systems - Proving Theorems for Complex Dynamics. Springer, Heidelberg (2010). \n                    https:\/\/doi.org\/10.1007\/978-3-642-14509-4"},{"key":"7_CR17","doi-asserted-by":"crossref","unstructured":"Andr\u00e9, C., Mallet, F.: Specification and verification of time requirements with CCSL and Esterel. In: LCTES 2009, pp. 167\u2013176. ACM (2009)","DOI":"10.1145\/1542452.1542475"},{"key":"7_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-40561-7_1","volume-title":"Software Engineering and Formal Methods","author":"J Suryadevara","year":"2013","unstructured":"Suryadevara, J., Seceleanu, C., Mallet, F., Pettersson, P.: Verifying MARTE\/CCSL mode behaviors using UPPAAL. In: Hierons, R.M., Merayo, M.G., Bravetti, M. (eds.) SEFM 2013. LNCS, vol. 8137, pp. 1\u201315. Springer, Heidelberg (2013). \n                    https:\/\/doi.org\/10.1007\/978-3-642-40561-7_1"},{"key":"7_CR19","doi-asserted-by":"crossref","unstructured":"Zhang, Y., Mallet, F., Chen, Y.: Timed automata semantics of spatio-temporal consistency language STeC. In: TASE 2014, pp. 201\u2013208, IEEE (2014)","DOI":"10.1109\/TASE.2014.10"},{"key":"7_CR20","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1016\/j.scico.2017.08.015","volume":"154","author":"M Zhang","year":"2018","unstructured":"Zhang, M., Dai, F., Mallet, F.: Periodic scheduling for MARTE\/CCSL: theory and practice. Sci. Comput. Program. 154, 42\u201360 (2018)","journal-title":"Sci. Comput. Program."},{"key":"7_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1007\/978-3-540-72734-7_32","volume-title":"Logical Foundations of Computer Science","author":"A Platzer","year":"2007","unstructured":"Platzer, A.: A temporal dynamic logic for verifying hybrid system invariants. In: Artemov, S.N., Nerode, A. (eds.) LFCS 2007. LNCS, vol. 4514, pp. 457\u2013471. Springer, Heidelberg (2007). \n                    https:\/\/doi.org\/10.1007\/978-3-540-72734-7_32"}],"container-title":["Communications in Computer and Information Science","Formal Techniques for Safety-Critical Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-12988-0_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T23:50:14Z","timestamp":1558396214000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-12988-0_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030129873","9783030129880"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-12988-0_7","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"2 February 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FTSCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Formal Techniques for Safety-Critical Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Gold Coast, QLD","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 November 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 November 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ftscs2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.ftscs.org\/","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"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"22","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"10","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"45% - 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"}},{"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"}},{"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"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}