{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T06:56:33Z","timestamp":1742972193301,"version":"3.40.3"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030500856"},{"type":"electronic","value":"9783030500863"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-50086-3_5","type":"book-chapter","created":{"date-parts":[[2020,6,9]],"date-time":"2020-06-09T12:03:09Z","timestamp":1591704189000},"page":"78-95","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["On Implementable Timed Automata"],"prefix":"10.1007","author":[{"given":"Sergio","family":"Feo-Arenis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Milan","family":"Vujinovi\u0107","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6824-0567","authenticated-orcid":false,"given":"Bernd","family":"Westphal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,6,8]]},"reference":[{"key":"5_CR1","doi-asserted-by":"publisher","unstructured":"Abdellatif, T., Combaz, J., Sifakis, J.: Model-based implementation of real-time applications. In: Carloni, L.P., Tripakis, S. (eds.) EMSOFT, pp. 229\u2013238. ACM (2010). https:\/\/doi.org\/10.1145\/1879021.1879052","DOI":"10.1145\/1879021.1879052"},{"issue":"4","key":"5_CR2","doi-asserted-by":"publisher","first-page":"882","DOI":"10.1017\/S096012951200028X","volume":"23","author":"T Abdellatif","year":"2013","unstructured":"Abdellatif, T., Combaz, J., Sifakis, J.: Rigorous implementation of real-time systems - from theory to application. Math. Struct. Comput. Sci. 23(4), 882\u2013914 (2013). https:\/\/doi.org\/10.1017\/S096012951200028X","journal-title":"Math. Struct. Comput. Sci."},{"key":"5_CR3","doi-asserted-by":"publisher","unstructured":"Abdullah, J., Mohaqeqi, M., Yi, W.: Synthesis of Ada code from graph-based task models. In: Seffah, A., Penzenstadler, B., Alves, C., Peng, X. (eds.) SAC, pp. 1467\u20131472. ACM (2017). https:\/\/doi.org\/10.1145\/3019612.3019681","DOI":"10.1145\/3019612.3019681"},{"issue":"4","key":"5_CR4","first-page":"269","volume":"9","author":"T Amnell","year":"2002","unstructured":"Amnell, T., Fersman, E., Pettersson, P., Sun, H., Yi, W.: Code synthesis for timed automata. Nord. J. Comput. 9(4), 269\u2013300 (2002)","journal-title":"Nord. J. Comput."},{"key":"5_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1007\/978-3-319-65765-3_3","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"S Feo-Arenis","year":"2017","unstructured":"Feo-Arenis, S., Vujinovi\u0107, M., Westphal, B.: On global scheduling independency in networks of timed automata. In: Abate, A., Geeraerts, G. (eds.) FORMATS 2017. LNCS, vol. 10419, pp. 42\u201357. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-65765-3_3"},{"key":"5_CR6","doi-asserted-by":"publisher","unstructured":"Basu, A., Bozga, M., Sifakis, J.: Modeling heterogeneous real-time components in BIP. In: SEFM, pp. 3\u201312. IEEE (2006). https:\/\/doi.org\/10.1109\/SEFM.2006.27","DOI":"10.1109\/SEFM.2006.27"},{"key":"5_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/978-3-540-30080-9_7","volume-title":"Formal Methods for the Design of Real-Time Systems","author":"G Behrmann","year":"2004","unstructured":"Behrmann, G., David, A., Larsen, K.G.: A tutorial on Uppaal. In: Bernardo, M., Corradini, F. (eds.) SFM-RT 2004. LNCS, vol. 3185, pp. 200\u2013236. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30080-9_7"},{"issue":"2","key":"5_CR8","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., Le Guernic, P., Jacquemot, C.: Synchronous programming with events and relations: the SIGNAL language and its semantics. Sci. Comput. Program. 16(2), 103\u2013149 (1991). https:\/\/doi.org\/10.1016\/0167-6423(91)90001-E","journal-title":"Sci. Comput. Program."},{"key":"5_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/978-3-540-85778-5_17","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"J Berendsen","year":"2008","unstructured":"Berendsen, J., Vaandrager, F.: Compositional abstraction in real-time model checking. In: Cassez, F., Jard, C. (eds.) FORMATS 2008. LNCS, vol. 5215, pp. 233\u2013249. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85778-5_17"},{"issue":"2","key":"5_CR10","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). https:\/\/doi.org\/10.1016\/0167-6423(92)90005-V","journal-title":"Sci. Comput. Program."},{"key":"5_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/978-3-642-23217-6_6","volume-title":"CONCUR 2011 \u2013 Concurrency Theory","author":"P Bouyer","year":"2011","unstructured":"Bouyer, P., Larsen, K.G., Markey, N., Sankur, O., Thrane, C.: Timed automata can always be made implementable. In: Katoen, J.-P., K\u00f6nig, B. (eds.) CONCUR 2011. LNCS, vol. 6901, pp. 76\u201391. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-23217-6_6"},{"issue":"3","key":"5_CR12","doi-asserted-by":"publisher","first-page":"8:1","DOI":"10.1145\/2491245","volume":"31","author":"JC Corbett","year":"2013","unstructured":"Corbett, J.C., Dean, J., Epstein, M., et al.: Spanner: Google\u2019s globally distributed database. ACM Trans. Comput. Syst. 31(3), 8:1\u20138:22 (2013). https:\/\/dl.acm.org\/citation.cfm?id=2491245","journal-title":"ACM Trans. Comput. Syst."},{"key":"5_CR13","doi-asserted-by":"publisher","unstructured":"Fahrenberg, U.: Higher-dimensional timed automata 51(16), 109\u2013114 (2018). https:\/\/doi.org\/10.1016\/j.ifacol.2018.08.019","DOI":"10.1016\/j.ifacol.2018.08.019"},{"key":"5_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/978-3-642-28756-5_13","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"A Fehnker","year":"2012","unstructured":"Fehnker, A., van Glabbeek, R., H\u00f6fner, P., McIver, A., Portmann, M., Tan, W.L.: Automated analysis of AODV using UPPAAL. In: Flanagan, C., K\u00f6nig, B. (eds.) TACAS 2012. LNCS, vol. 7214, pp. 173\u2013187. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-28756-5_13"},{"issue":"3","key":"5_CR15","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1007\/s00165-016-0365-3","volume":"28","author":"S Feo-Arenis","year":"2016","unstructured":"Feo-Arenis, S., Westphal, B., Dietsch, D., Mu\u00f1iz, M., Andisha, S., Podelski, A.: Ready for testing: ensuring conformance to industrial standards through formal verification. Formal Aspects Comput. 28(3), 499\u2013527 (2016). https:\/\/doi.org\/10.1007\/s00165-016-0365-3","journal-title":"Formal Aspects Comput."},{"key":"5_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/978-3-642-38592-6_4","volume-title":"Formal Techniques for Distributed Systems","author":"S Feo-Arenis","year":"2013","unstructured":"Feo-Arenis, S., Westphal, B.: Parameterized verification of track topology aggregation protocols. In: Beyer, D., Boreale, M. (eds.) FMOODS\/FORTE -2013. LNCS, vol. 7892, pp. 35\u201349. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38592-6_4"},{"key":"5_CR17","doi-asserted-by":"publisher","unstructured":"Flammini, A., Ferrari, P.: Clock synchronization of distributed, real-time, industrial data acquisition systems. In: Vadursi, M. (ed.) Data Acquisition, chap. 3. IntechOpen, Rijeka (2010). https:\/\/doi.org\/10.5772\/10458","DOI":"10.5772\/10458"},{"key":"5_CR18","doi-asserted-by":"publisher","unstructured":"Gobriel, S., Khattab, S.M., Moss\u00e9, D., Brustoloni, J.C., Melhem, R.G.: Ridesharing: fault tolerant aggregation in sensor networks using corrective actions. In: SECON, pp. 595\u2013604. IEEE (2006). https:\/\/doi.org\/10.1109\/SAHCN.2006.288516","DOI":"10.1109\/SAHCN.2006.288516"},{"issue":"9","key":"5_CR19","doi-asserted-by":"publisher","first-page":"1305","DOI":"10.1109\/5.97300","volume":"79","author":"N Halbwachs","year":"1991","unstructured":"Halbwachs, N., Caspi, P., Raymond, P., Pilaud, D.: The synchronous data flow programming language LUSTRE. Proc. IEEE 79(9), 1305\u20131320 (1991)","journal-title":"Proc. IEEE"},{"key":"5_CR20","unstructured":"Hendriks, M.: Translating Uppaal to not quite C (2001). http:\/\/repository.ubn.ru.nl\/bitstream\/handle\/2066\/19058\/19058.pdf?sequence=1"},{"issue":"1","key":"5_CR21","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1109\/JPROC.2002.805825","volume":"91","author":"TA Henzinger","year":"2003","unstructured":"Henzinger, T.A., Horowitz, B., Kirsch, C.M.: Giotto: a time-triggered language for embedded programming. Proc. IEEE 91(1), 84\u201399 (2003)","journal-title":"Proc. IEEE"},{"key":"5_CR22","unstructured":"ISO\/IEC: 9899:2018, Programming Languages - C, 4th edn. (2018)"},{"key":"5_CR23","doi-asserted-by":"publisher","unstructured":"Jubran, O., Westphal, B.: Formal approach to guard time optimization for TDMA. In: Auguin, M., de Simone, R., Davis, R.I., Grolleau, E. (eds.) RTNS, pp. 223\u2013233. ACM (2013). https:\/\/doi.org\/10.1145\/2516821.2516849","DOI":"10.1145\/2516821.2516849"},{"key":"5_CR24","doi-asserted-by":"publisher","unstructured":"Jubran, O., Westphal, B.: Optimizing guard time for TDMA in a wireless sensor network - case study. In: LCN, pp. 597\u2013601. IEEE Computer Society (2014). https:\/\/doi.org\/10.1109\/LCNW.2014.6927708","DOI":"10.1109\/LCNW.2014.6927708"},{"key":"5_CR25","unstructured":"Kristensen, J., Mejlholm, A., Pedersen, S.: Automatic translation from Uppaal to C (2005). http:\/\/mejlholm.org\/uni\/pdfs\/dat4.pdf"},{"key":"5_CR26","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511619953","volume-title":"Real-Time Systems - Formal Specification and Automatic Verification","author":"ER Olderog","year":"2008","unstructured":"Olderog, E.R., Dierks, H.: Real-Time Systems - Formal Specification and Automatic Verification. Cambridge University Press, Cambridge (2008)"},{"key":"5_CR27","first-page":"17","volume":"60\u201361","author":"GD Plotkin","year":"2004","unstructured":"Plotkin, G.D.: A structural approach to operational semantics. J. Log. Algebr. Program. 60\u201361, 17\u2013139 (2004)","journal-title":"J. Log. Algebr. Program."},{"issue":"1\u20132","key":"5_CR28","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1023\/A:1008387132377","volume":"10","author":"A Puri","year":"2000","unstructured":"Puri, A.: Dynamical properties of timed automata. Discrete Event Dyn. Syst. 10(1\u20132), 87\u2013113 (2000). https:\/\/doi.org\/10.1023\/A:1008387132377","journal-title":"Discrete Event Dyn. Syst."},{"key":"5_CR29","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-4-431-54436-4_1","volume-title":"Theory and Practice of Computation","author":"I Senthooran","year":"2013","unstructured":"Senthooran, I., Watanabe, T.: On generating soft real-time programs for non-real-time environments. In: Nishizaki, S.Y., Numao, M., Caro, J., Suarez, M.T. (eds.) Theory and Practice of Computation, pp. 1\u201312. Springer, Tokyo (2013). https:\/\/doi.org\/10.1007\/978-4-431-54436-4_1"},{"issue":"16","key":"5_CR30","doi-asserted-by":"publisher","first-page":"3476","DOI":"10.3390\/s19163476","volume":"19","author":"F Tirado-Andr\u00e9s","year":"2019","unstructured":"Tirado-Andr\u00e9s, F., Rozas, A., Araujo, \u00c1.: A methodology for choosing time synchronization strategies for wireless IoT networks. Sensors 19(16), 3476 (2019). https:\/\/doi.org\/10.3390\/s19163476","journal-title":"Sensors"},{"key":"5_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/978-3-642-37057-1_18","volume-title":"Fundamental Approaches to Software Engineering","author":"A Triki","year":"2013","unstructured":"Triki, A., Combaz, J., Bensalem, S., Sifakis, J.: Model-based implementation of parallel real-time systems. In: Cortellessa, V., Varr\u00f3, D. (eds.) FASE 2013. LNCS, vol. 7793, pp. 235\u2013249. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-37057-1_18"},{"key":"5_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1007\/11562436_11","volume-title":"Formal Techniques for Networked and Distributed Systems - FORTE 2005","author":"O Wibling","year":"2005","unstructured":"Wibling, O., Parrow, J., Pears, A.: Ad Hoc routing protocol verification through broadcast abstraction. In: Wang, F. (ed.) FORTE 2005. LNCS, vol. 3731, pp. 128\u2013142. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11562436_11"},{"issue":"3","key":"5_CR33","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/s00165-005-0067-8","volume":"17","author":"MD Wulf","year":"2005","unstructured":"Wulf, M.D., Doyen, L., Raskin, J.: Almost ASAP semantics: from timed models to timed implementations. Formal Asp. Comput. 17(3), 319\u2013341 (2005). https:\/\/doi.org\/10.1007\/s00165-005-0067-8","journal-title":"Formal Asp. Comput."}],"container-title":["Lecture Notes in Computer Science","Formal Techniques for Distributed Objects, Components, and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-50086-3_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,8]],"date-time":"2024-06-08T23:01:42Z","timestamp":1717887702000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-50086-3_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030500856","9783030500863"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-50086-3_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"8 June 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FORTE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Formal Techniques for Distributed Objects, Components, and Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Valletta","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Malta","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 June 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 June 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"40","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"forte2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.discotec.org\/2020\/forte","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":"25","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":"10","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":"1","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":"40% - 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":"3","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)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}