{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,28]],"date-time":"2025-11-28T04:54:01Z","timestamp":1764305641283,"version":"3.40.3"},"publisher-location":"Cham","reference-count":40,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030167219"},{"type":"electronic","value":"9783030167226"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-16722-6_4","type":"book-chapter","created":{"date-parts":[[2019,4,4]],"date-time":"2019-04-04T02:01:08Z","timestamp":1554343268000},"page":"61-78","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["SMT-Based Bounded Schedulability Analysis of the Clock Constraint Specification Language"],"prefix":"10.1007","author":[{"given":"Min","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fu","family":"Song","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fr\u00e9d\u00e9ric","family":"Mallet","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaohong","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,4,4]]},"reference":[{"issue":"2","key":"4_CR1","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1016\/j.tcs.2005.11.018","volume":"354","author":"Y Abdedda\u00efm","year":"2006","unstructured":"Abdedda\u00efm, Y., Asarin, E., Maler, O.: Scheduling with timed automata. Theor. Comput. Sci. 354(2), 272\u2013300 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"4_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/978-3-540-40903-8_6","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"T Amnell","year":"2004","unstructured":"Amnell, T., Fersman, E., Mokrushin, L., Pettersson, P., Yi, W.: TIMES: a tool for schedulability analysis and code generation of real-time systems. In: Larsen, K.G., Niebert, P. (eds.) FORMATS 2003. LNCS, vol. 2791, pp. 60\u201372. Springer, Heidelberg (2004). \n                      https:\/\/doi.org\/10.1007\/978-3-540-40903-8_6"},{"key":"4_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1007\/978-3-540-75209-7_38","volume-title":"Model Driven Engineering Languages and Systems","author":"C Andr\u00e9","year":"2007","unstructured":"Andr\u00e9, C., Mallet, F., de Simone, R.: Modeling time(s). In: Engels, G., Opdyke, B., Schmidt, D.C., Weil, F. (eds.) MODELS 2007. LNCS, vol. 4735, pp. 559\u2013573. Springer, Heidelberg (2007). \n                      https:\/\/doi.org\/10.1007\/978-3-540-75209-7_38"},{"key":"4_CR4","unstructured":"Barrett, C., Fontaine, P., Tinelli, C.: The SMT-LIB standard (2016)"},{"issue":"2","key":"4_CR5","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/0167-6423(91)90001-E","volume":"16","author":"A Benveniste","year":"1991","unstructured":"Benveniste, A., Guernic, P.L., Jacquemot, C.: Synchronous programming with events and relations: the SIGNAL language and its semantics. Sci. Comput. Program. 16(2), 103\u2013149 (1991)","journal-title":"Sci. Comput. Program."},{"issue":"2","key":"4_CR6","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."},{"issue":"1","key":"4_CR7","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1109\/2.962984","volume":"34","author":"B Boehm","year":"2001","unstructured":"Boehm, B., Basili, V.R.: Software defect reduction top 10 list. Computer 34(1), 135\u2013137 (2001)","journal-title":"Computer"},{"key":"4_CR8","unstructured":"Bucci, G., Fedeli, A., Sassoli, L., Vicario, E.: Modeling flexible real time systems with preemptive time petri nets. In: Proceedings of the 15th ECRTS, Porto, Portugal, pp. 279\u2013286. IEEE (2003)"},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"Caspi, P., Pilaud, D., Halbwachs, N., Plaice, J.: LUSTRE: a declarative language for programming synchronous systems. In: Proceedings of 14th POPL, Tucson, USA, pp. 178\u2013188. ACM Press (1987)","DOI":"10.1145\/41625.41641"},{"key":"4_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/978-3-319-68690-5_4","volume-title":"Formal Methods and Software Engineering","author":"X Chen","year":"2017","unstructured":"Chen, X., Yin, L., Yu, Y., Jin, Z.: Transforming timing requirements into CCSL constraints to verify cyber-physical systems. In: Duan, Z., Ong, L. (eds.) ICFEM 2017. LNCS, vol. 10610, pp. 54\u201370. Springer, Cham (2017). \n                      https:\/\/doi.org\/10.1007\/978-3-319-68690-5_4"},{"issue":"1","key":"4_CR11","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/s11704-014-4096-4","volume":"9","author":"Y Chen","year":"2015","unstructured":"Chen, Y., Chen, Y., Madelaine, E.: Timed-pNets: a communication behavioural semantic model for distributed systems. Front. Comput. Sci. 9(1), 87\u2013110 (2015)","journal-title":"Front. Comput. Sci."},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"Cola\u00e7o, J., Pagano, B., Pouzet, M.: SCADE 6: a formal language for embedded critical software development. In: Proceedings of the 11th TASE, Sophia Antipolis, France, pp. 1\u201311. IEEE (2017)","DOI":"10.1109\/TASE.2017.8285623"},{"key":"4_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/978-3-540-45212-6_10","volume-title":"Embedded Software","author":"J-L Cola\u00e7o","year":"2003","unstructured":"Cola\u00e7o, J.-L., Pouzet, M.: Clocks as first class abstract types. In: Alur, R., Lee, I. (eds.) EMSOFT 2003. LNCS, vol. 2855, pp. 134\u2013155. Springer, Heidelberg (2003). \n                      https:\/\/doi.org\/10.1007\/978-3-540-45212-6_10"},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"Deantoni, J., Mallet, F.: TimeSquare: treat your models with logical time. In: Proceedings of the 50th TOOLS, Prague, Czech Republic, pp. 34\u201341. IEEE (2012)","DOI":"10.1007\/978-3-642-30561-0_4"},{"key":"4_CR15","unstructured":"Feiler, P.H., Gluch, D.P.: Model-based engineering with AADL - an introduction to the SAE architecture analysis and design language. SEI, Addison-Wesley (2012)"},{"key":"4_CR16","doi-asserted-by":"crossref","unstructured":"Kang, E., Schobbens, P.: Schedulability analysis support for automotive systems: from requirement to implementation. In: Proceedings of the 29th SAC, Gyeongju, Korea, pp. 1080\u20131085. ACM (2014)","DOI":"10.1145\/2554850.2554929"},{"key":"4_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1007\/978-3-540-24730-2_20","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"P Kr\u010d\u00e1l","year":"2004","unstructured":"Kr\u010d\u00e1l, P., Yi, W.: Decidable and undecidable problems in schedulability analysis using timed automata. In: Jensen, K., Podelski, A. (eds.) TACAS 2004. LNCS, vol. 2988, pp. 236\u2013250. Springer, Heidelberg (2004). \n                      https:\/\/doi.org\/10.1007\/978-3-540-24730-2_20"},{"key":"4_CR18","unstructured":"Lime, D., Roux, O.: A translation based method for the timed analysis of scheduling extended time petri nets. In: Proceedings of the 25th RTSS, pp. 187\u2013196. IEEE (2004)"},{"issue":"1","key":"4_CR19","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1145\/321738.321743","volume":"20","author":"CL Liu","year":"1973","unstructured":"Liu, C.L., Layland, J.W.: Scheduling algorithms for multiprogramming in a hard-real-time environment. J. ACM 20(1), 46\u201361 (1973)","journal-title":"J. ACM"},{"key":"4_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/978-3-642-41202-8_3","volume-title":"Formal Methods and Software Engineering","author":"F Mallet","year":"2013","unstructured":"Mallet, F., Millo, J.-V.: Boundness issues in CCSL specifications. In: Groves, L., Sun, J. (eds.) ICFEM 2013. LNCS, vol. 8144, pp. 20\u201335. Springer, Heidelberg (2013). \n                      https:\/\/doi.org\/10.1007\/978-3-642-41202-8_3"},{"key":"4_CR21","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":"4_CR22","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/978-981-10-4436-6_4","volume-title":"Cyber-Physical System Design from an Architecture Analysis Viewpoint","author":"F Mallet","year":"2017","unstructured":"Mallet, F., Villar, E., Herrera, F.: MARTE for CPS and CPSoS. In: Nakajima, S., Talpin, J.-P., Toyoshima, M., Yu, H. (eds.) Cyber-Physical System Design from an Architecture Analysis Viewpoint, pp. 81\u2013108. Springer, Singapore (2017). \n                      https:\/\/doi.org\/10.1007\/978-981-10-4436-6_4"},{"key":"4_CR23","unstructured":"Mallet, F., Millo, J., de Simone, R.: Safe CCSL specifications and marked graphs. In: Proceedings of the 11th MEMOCODE, Portland, OR, USA, pp. 157\u2013166. IEEE (2013)"},{"key":"4_CR24","doi-asserted-by":"crossref","unstructured":"Mallet, F., Zhang, M.: Work-in-progress: from logical time scheduling to real-time scheduling. In: Proceedings of the 39th RTSS, Nashville, USA, pp. 143\u2013146. IEEE (2018)","DOI":"10.1109\/RTSS.2018.00025"},{"key":"4_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-540-78800-3_24","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"L Moura de","year":"2008","unstructured":"de Moura, L., Bj\u00f8rner, N.: Z3: an efficient SMT solver. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 337\u2013340. Springer, Heidelberg (2008). \n                      https:\/\/doi.org\/10.1007\/978-3-540-78800-3_24"},{"key":"4_CR26","unstructured":"OMG: UML profile for MARTE: modeling and analysis of real-time embedded systems (2015)"},{"key":"4_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"748","DOI":"10.1007\/3-540-55602-8_217","volume-title":"Automated Deduction\u2014CADE-11","author":"S Owre","year":"1992","unstructured":"Owre, S., Rushby, J.M., Shankar, N.: PVS: a prototype verification system. In: Kapur, D. (ed.) CADE 1992. LNCS, vol. 607, pp. 748\u2013752. Springer, Heidelberg (1992). \n                      https:\/\/doi.org\/10.1007\/3-540-55602-8_217"},{"key":"4_CR28","doi-asserted-by":"crossref","unstructured":"Peters, J., Przigoda, N., Wille, R., Drechsler, R.: Clocks vs. instants relations: verifying CCSL time constraints in UML\/MARTE models. In: Proceedings of the 14th MEMOCODE, Kanpur, India, pp. 78\u201384. IEEE (2016)","DOI":"10.1109\/MEMCOD.2016.7797750"},{"key":"4_CR29","doi-asserted-by":"crossref","unstructured":"Peters, J., Wille, R., Przigoda, N., K\u00fchne, U., Drechsler, R.: A generic representation of CCSL time constraints for UML\/MARTE models. In: Proceedings of the 52nd DAC, pp. 122:1\u2013122:6. ACM (2015)","DOI":"10.1145\/2744769.2744775"},{"issue":"2","key":"4_CR30","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/s10703-006-7844-8","volume":"28","author":"D Potop-Butucaru","year":"2006","unstructured":"Potop-Butucaru, D., Caillaud, B., Benveniste, A.: Concurrency in synchronous systems. Formal Methods Syst. Des. 28(2), 111\u2013130 (2006)","journal-title":"Formal Methods Syst. Des."},{"key":"4_CR31","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-70628-3","volume-title":"Compiling Esterel","author":"D Potop-Butucaru","year":"2007","unstructured":"Potop-Butucaru, D., Edwards, S.A., Berry, G.: Compiling Esterel. Springer, Boston (2007). \n                      https:\/\/doi.org\/10.1007\/978-0-387-70628-3"},{"issue":"2\u20133","key":"4_CR32","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1023\/B:TIME.0000045315.61234.1e","volume":"28","author":"L Sha","year":"2004","unstructured":"Sha, L., et al.: Real time scheduling theory: a historical perspective. Real-Time Syst. 28(2\u20133), 101\u2013155 (2004)","journal-title":"Real-Time Syst."},{"key":"4_CR33","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":"4_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/978-3-319-47677-3_2","volume-title":"Dependable Software Engineering: Theories, Tools, and Applications","author":"Q Xu","year":"2016","unstructured":"Xu, Q., de Simone, R., DeAntoni, J.: Divergence detection for CCSL specification via clock causality chain. In: Fr\u00e4nzle, M., Kapur, D., Zhan, N. (eds.) SETTA 2016. LNCS, vol. 9984, pp. 18\u201337. Springer, Cham (2016). \n                      https:\/\/doi.org\/10.1007\/978-3-319-47677-3_2"},{"key":"4_CR35","doi-asserted-by":"crossref","unstructured":"Yin, L., Mallet, F., Liu, J.: Verification of MARTE\/CCSL time requirements in Promela\/SPIN. In: Proceedings of the 16th ICECCS, USA, pp. 65\u201374. IEEE (2011)","DOI":"10.1109\/ICECCS.2011.14"},{"key":"4_CR36","doi-asserted-by":"crossref","unstructured":"Yu, H., Talpin, J., Besnard, L., et al.: Polychronous controller synthesis from MARTE\/CCSL timing specifications. In: Proceedings of the 9th MEMOCODE, Cambridge, UK, pp. 21\u201330. IEEE (2011)","DOI":"10.1109\/MEMCOD.2011.5970507"},{"key":"4_CR37","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":"4_CR38","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/978-3-319-29510-7_2","volume-title":"Formal Techniques for Safety-Critical Systems","author":"M Zhang","year":"2016","unstructured":"Zhang, M., Mallet, F.: An executable semantics of clock constraint specification language and its applications. In: Artho, C., \u00d6lveczky, P.C. (eds.) FTSCS 2015. CCIS, vol. 596, pp. 37\u201351. Springer, Cham (2016). \n                      https:\/\/doi.org\/10.1007\/978-3-319-29510-7_2"},{"key":"4_CR39","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"},{"key":"4_CR40","doi-asserted-by":"crossref","unstructured":"Zhang, M., Ying, Y.: Towards SMT-based LTL model checking of clock constraint specification language for real-time and embedded systems. In: Proceedings of the 18th LCTES, Barcelona, Spain, pp. 61\u201370. ACM (2017)","DOI":"10.1145\/3140582.3081035"}],"container-title":["Lecture Notes in Computer Science","Fundamental Approaches to Software Engineering"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-16722-6_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T09:05:40Z","timestamp":1558343140000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-16722-6_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030167219","9783030167226"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-16722-6_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"4 April 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FASE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Fundamental Approaches to Software Engineering","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Prague","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Czech Republic","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 April 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 April 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fase2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.etaps.org\/2019\/fase","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-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":"74","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"24","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":"32% - 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":"7","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"}}]}}