{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T02:45:00Z","timestamp":1778121900165,"version":"3.51.4"},"publisher-location":"Cham","reference-count":91,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031158384","type":"print"},{"value":"9783031158391","type":"electronic"}],"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-15839-1_2","type":"book-chapter","created":{"date-parts":[[2022,8,28]],"date-time":"2022-08-28T18:02:38Z","timestamp":1661709758000},"page":"16-42","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Zone-Based Verification of\u00a0Timed Automata: Extrapolations, Simulations and\u00a0What Next?"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2823-0911","authenticated-orcid":false,"given":"Patricia","family":"Bouyer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1313-7722","authenticated-orcid":false,"given":"Paul","family":"Gastin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1029-2356","authenticated-orcid":false,"given":"Fr\u00e9d\u00e9ric","family":"Herbreteau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8146-4429","authenticated-orcid":false,"given":"Ocan","family":"Sankur","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2666-0691","authenticated-orcid":false,"given":"B.","family":"Srivathsan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,8,29]]},"reference":[{"key":"2_CR1","unstructured":"Akshay, S., Gastin, P., Govind, R., Srivathsan, B.: Simulations for event-clock automata. In: Proceedings of 33th International Conference on Concurrency Theory (CONCUR 2022). Lecture Notes in Computer Science, Springer, Cham (2022, to appear)"},{"key":"2_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"619","DOI":"10.1007\/978-3-030-81685-8_30","volume-title":"Computer Aided Verification","author":"S Akshay","year":"2021","unstructured":"Akshay, S., Gastin, P., Prakash, K.R.: Fast zone-based algorithms for reachability in pushdown timed automata. In: Silva, A., Leino, K.R.M. (eds.) CAV 2021. LNCS, vol. 12759, pp. 619\u2013642. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-81685-8_30"},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Alur, R., Courcoubetis, C., Dill, D.L., Halbwachs, N., Wong-Toi, H.: An implementation of three algorithms for timing verification based on automata emptiness. In: Proceedings of 13th IEEE Real-Time Systems Symposium (RTSS 1992), pp. 157\u2013166. IEEE Computer Society Press (1992)","DOI":"10.1109\/REAL.1992.242667"},{"key":"2_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1007\/BFb0032042","volume-title":"Automata, Languages and Programming","author":"R Alur","year":"1990","unstructured":"Alur, R., Dill, D.: Automata for modeling real-time systems. In: Paterson, M.S. (ed.) ICALP 1990. LNCS, vol. 443, pp. 322\u2013335. Springer, Heidelberg (1990). https:\/\/doi.org\/10.1007\/BFb0032042"},{"issue":"2","key":"2_CR5","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0304-3975(94)90010-8","volume":"126","author":"R Alur","year":"1994","unstructured":"Alur, R., Dill, D.L.: A theory of timed automata. Theoret. Comput. Sci. 126(2), 183\u2013235 (1994)","journal-title":"Theoret. Comput. Sci."},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"Alur, R., Henzinger, T.A., Vardi, M.Y.: Parametric real-time reasoning. In: Proceedings of 25th Annual ACM Symposium on the Theory of Computing (STOC 1993), pp. 592\u2013601. ACM (1993)","DOI":"10.1145\/167088.167242"},{"key":"2_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/3-540-45351-2_8","volume-title":"Hybrid Systems: Computation and Control","author":"R Alur","year":"2001","unstructured":"Alur, R., La Torre, S., Pappas, G.J.: Optimal paths in weighted timed automata. In: Di Benedetto, M.D., Sangiovanni-Vincentelli, A. (eds.) HSCC 2001. LNCS, vol. 2034, pp. 49\u201362. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45351-2_8"},{"key":"2_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"552","DOI":"10.1007\/978-3-030-81685-8_26","volume-title":"Computer Aided Verification","author":"\u00c9 Andr\u00e9","year":"2021","unstructured":"Andr\u00e9, \u00c9.: IMITATOR 3: synthesis of timing parameters beyond decidability. In: Silva, A., Leino, K.R.M. (eds.) CAV 2021. LNCS, vol. 12759, pp. 552\u2013565. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-81685-8_26"},{"key":"2_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/3-540-36135-9_16","volume-title":"Formal Techniques for Networked and Distributed Sytems \u2014 FORTE 2002","author":"G Audemard","year":"2002","unstructured":"Audemard, G., Cimatti, A., Kornilowicz, A., Sebastiani, R.: Bounded model checking for timed systems. In: Peled, D.A., Vardi, M.Y. (eds.) FORTE 2002. LNCS, vol. 2529, pp. 243\u2013259. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-36135-9_16"},{"key":"2_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/3-540-36577-X_18","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"G Behrmann","year":"2003","unstructured":"Behrmann, G., Bouyer, P., Fleury, E., Larsen, K.G.: Static guard analysis in timed automata verification. In: Garavel, H., Hatcliff, J. (eds.) TACAS 2003. LNCS, vol. 2619, pp. 254\u2013270. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-36577-X_18"},{"key":"2_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1007\/978-3-540-24730-2_25","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"G Behrmann","year":"2004","unstructured":"Behrmann, G., Bouyer, P., Larsen, K.G., Pel\u00e1nek, R.: Lower and upper bounds in zone based abstractions of timed automata. In: Jensen, K., Podelski, A. (eds.) TACAS 2004. LNCS, vol. 2988, pp. 312\u2013326. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24730-2_25"},{"issue":"3","key":"2_CR12","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1007\/s10009-005-0190-0","volume":"8","author":"G Behrmann","year":"2005","unstructured":"Behrmann, G., Bouyer, P., Larsen, K.G., Pel\u00e0nek, R.: Zone based abstractions for timed automata exploiting lower and upper bounds. Int. J. Softw. Tools Technol. Transf. 8(3), 204\u2013215 (2005)","journal-title":"Int. J. Softw. Tools Technol. Transf."},{"key":"2_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/978-3-540-73368-3_14","volume-title":"Computer Aided Verification","author":"G Behrmann","year":"2007","unstructured":"Behrmann, G., Cougnard, A., David, A., Fleury, E., Larsen, K.G., Lime, D.: UPPAAL-TIGA: time for playing games! In: Damm, W., Hermanns, H. (eds.) CAV 2007. LNCS, vol. 4590, pp. 121\u2013125. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-73368-3_14"},{"key":"2_CR14","unstructured":"Behrmann, G., et al.: Uppaal 4.0. In: Proceedings of 3rd International Conference on Quantitative Evaluation of Systems (QEST 2006), pp. 125\u2013126. IEEE Computer Society Press (2006)"},{"key":"2_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/3-540-45351-2_15","volume-title":"Hybrid Systems: Computation and Control","author":"G Behrmann","year":"2001","unstructured":"Behrmann, G., et al.: Minimum-cost reachability for priced time automata. In: Di Benedetto, M.D., Sangiovanni-Vincentelli, A. (eds.) HSCC 2001. LNCS, vol. 2034, pp. 147\u2013161. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45351-2_15"},{"key":"2_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1007\/10722167_19","volume-title":"Computer Aided Verification","author":"G Behrmann","year":"2000","unstructured":"Behrmann, G., Hune, T., Vaandrager, F.: Distributing timed model checking \u2014 how the search order matters. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol. 1855, pp. 216\u2013231. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/10722167_19"},{"key":"2_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1007\/BFb0055643","volume-title":"CONCUR\u201998 Concurrency Theory","author":"J Bengtsson","year":"1998","unstructured":"Bengtsson, J., Jonsson, B., Lilius, J., Yi, W.: Partial order reductions for timed systems. In: Sangiorgi, D., de Simone, R. (eds.) CONCUR 1998. LNCS, vol. 1466, pp. 485\u2013500. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0055643"},{"key":"2_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/BFb0020949","volume-title":"Hybrid Systems III","author":"J Bengtsson","year":"1996","unstructured":"Bengtsson, J., Larsen, K., Larsson, F., Pettersson, P., Yi, W.: UPPAAL \u2014 a tool suite for automatic verification of real-time systems. In: Alur, R., Henzinger, T.A., Sontag, E.D. (eds.) HS 1995. LNCS, vol. 1066, pp. 232\u2013243. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/BFb0020949"},{"key":"2_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/978-3-540-27755-2_3","volume-title":"Lectures on Concurrency and Petri Nets","author":"J Bengtsson","year":"2004","unstructured":"Bengtsson, J., Yi, W.: Timed automata: semantics, algorithms and tools. In: Desel, J., Reisig, W., Rozenberg, G. (eds.) ACPN 2003. LNCS, vol. 3098, pp. 87\u2013124. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-27755-2_3"},{"key":"2_CR20","unstructured":"Berthomieu, B., Menasche, M.: An enumerative approach for analyzing time Petri nets. In: Proceedings of IFIP 9th World Computer Congress. Information Processing, vol. 83, pp. 41\u201346. North-Holland\/ IFIP (1983)"},{"key":"2_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/978-3-540-45069-6_13","volume-title":"Computer Aided Verification","author":"D Beyer","year":"2003","unstructured":"Beyer, D., Lewerentz, C., Noack, A.: Rabbit: a tool for BDD-based verification of real-time systems. In: Hunt, W.A., Somenzi, F. (eds.) CAV 2003. LNCS, vol. 2725, pp. 122\u2013125. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45069-6_13"},{"key":"2_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"620","DOI":"10.1007\/3-540-36494-3_54","volume-title":"STACS 2003","author":"P Bouyer","year":"2003","unstructured":"Bouyer, P.: Untameable timed automata! In: Alt, H., Habib, M. (eds.) STACS 2003. LNCS, vol. 2607, pp. 620\u2013631. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-36494-3_54"},{"issue":"3","key":"2_CR23","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1023\/B:FORM.0000026093.21513.31","volume":"24","author":"P Bouyer","year":"2004","unstructured":"Bouyer, P.: Forward analysis of updatable timed automata. Formal Methods Syst. Des. 24(3), 281\u2013320 (2004)","journal-title":"Formal Methods Syst. Des."},{"issue":"2","key":"2_CR24","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/s10703-007-0035-4","volume":"31","author":"P Bouyer","year":"2007","unstructured":"Bouyer, P., Brihaye, T., Bruy\u00e8re, V., Raskin, J.F.: On the optimal reachability problem. Formal Methods Syst. Des. 31(2), 135\u2013175 (2007)","journal-title":"Formal Methods Syst. Des."},{"issue":"1","key":"2_CR25","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/s10703-007-0043-4","volume":"32","author":"P Bouyer","year":"2008","unstructured":"Bouyer, P., Brinksma, E., Larsen, K.G.: Optimal infinite scheduling for multi-priced timed automata. Formal Methods Syst. Des. 32(1), 2\u201323 (2008)","journal-title":"Formal Methods Syst. Des."},{"key":"2_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1007\/978-3-319-41528-4_28","volume-title":"Computer Aided Verification","author":"P Bouyer","year":"2016","unstructured":"Bouyer, P., Colange, M., Markey, N.: Symbolic optimal reachability in weighted timed automata. In: Chaudhuri, S., Farzan, A. (eds.) CAV 2016. LNCS, vol. 9779, pp. 513\u2013530. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-41528-4_28"},{"issue":"2\u20133","key":"2_CR27","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/j.tcs.2004.04.003","volume":"321","author":"P Bouyer","year":"2004","unstructured":"Bouyer, P., Dufourd, C., Fleury, E., Petit, A.: Updatable timed automata. Theoret. Comput. Sci. 321(2\u20133), 291\u2013345 (2004)","journal-title":"Theoret. Comput. Sci."},{"key":"2_CR28","doi-asserted-by":"crossref","unstructured":"Bouyer, P., Fahrenberg, U., Larsen, K.G., Markey, N.: Timed automata with observers under energy constraints. In: Proceedings of 13th International Conference on Hybrid Systems: Computation and Control (HSCC 2010), pp. 61\u201370. ACM Press (2010)","DOI":"10.1145\/1755952.1755963"},{"issue":"9","key":"2_CR29","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1145\/1995376.1995396","volume":"54","author":"P Bouyer","year":"2011","unstructured":"Bouyer, P., Fahrenberg, U., Larsen, K.G., Markey, N.: Quantitative analysis of real-time systems using priced timed automata. Commun. ACM 54(9), 78\u201387 (2011)","journal-title":"Commun. ACM"},{"key":"2_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-540-85778-5_4","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"P Bouyer","year":"2008","unstructured":"Bouyer, P., Fahrenberg, U., Larsen, K.G., Markey, N., Srba, J.: Infinite runs in weighted timed automata with energy constraints. In: Cassez, F., Jard, C. (eds.) FORMATS 2008. LNCS, vol. 5215, pp. 33\u201347. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85778-5_4"},{"key":"2_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/11603009_10","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"P Bouyer","year":"2005","unstructured":"Bouyer, P., Laroussinie, F., Reynier, P.-A.: Diagonal constraints in timed automata: forward analysis of timed systems. In: Pettersson, P., Yi, W. (eds.) FORMATS 2005. LNCS, vol. 3829, pp. 112\u2013126. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11603009_10"},{"key":"2_CR32","doi-asserted-by":"crossref","unstructured":"Bouyer, P., Larsen, K.G., Markey, N.: Lower-bound constrained runs in weighted timed automata. In: Proceedings of 9th International Conference on Quantitative Evaluation of Systems (QEST 2012), pp. 128\u2013137. IEEE Computer Society Press (2012)","DOI":"10.1109\/QEST.2012.28"},{"key":"2_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/978-3-319-22975-1_5","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"P Bouyer","year":"2015","unstructured":"Bouyer, P., Markey, N., Perrin, N., Schlehuber-Caissier, P.: Timed-automata abstraction of switched dynamical systems using control funnels. In: Sankaranarayanan, S., Vicario, E. (eds.) FORMATS 2015. LNCS, vol. 9268, pp. 60\u201375. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-22975-1_5"},{"issue":"3","key":"2_CR34","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/s11241-016-9262-3","volume":"53","author":"P Bouyer","year":"2017","unstructured":"Bouyer, P., Markey, N., Perrin, N., Schlehuber-Caissier, P.: Timed-automata abstraction of switched dynamical systems using control invariants. Real-Time Syst. 53(3), 327\u2013353 (2017). https:\/\/doi.org\/10.1007\/s11241-016-9262-3","journal-title":"Real-Time Syst."},{"key":"2_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"546","DOI":"10.1007\/BFb0028779","volume-title":"Computer Aided Verification","author":"M Bozga","year":"1998","unstructured":"Bozga, M., Daws, C., Maler, O., Olivero, A., Tripakis, S., Yovine, S.: Kronos: a model-checking tool for real-time systems. In: Hu, A.J., Vardi, M.Y. (eds.) CAV 1998. LNCS, vol. 1427, pp. 546\u2013550. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0028779"},{"key":"2_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1007\/978-3-642-18275-4_7","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"AR Bradley","year":"2011","unstructured":"Bradley, A.R.: SAT-based model checking without unrolling. In: Jhala, R., Schmidt, D. (eds.) VMCAI 2011. LNCS, vol. 6538, pp. 70\u201387. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-18275-4_7"},{"key":"2_CR37","doi-asserted-by":"publisher","unstructured":"Bulychev, P.E., et al.: UPPAAL-SMC: statistical model checking for priced timed automata. In: Proceedings of 10th Workshop on Quantitative Aspects of Programming Languages (QAPL 2012). Electronic Proceedings in Theoretical Computer Science, vol. 85, pp. 1\u201316 (2012). https:\/\/doi.org\/10.4204\/EPTCS.85.1","DOI":"10.4204\/EPTCS.85.1"},{"key":"2_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1007\/11539452_9","volume-title":"CONCUR 2005 \u2013 Concurrency Theory","author":"F Cassez","year":"2005","unstructured":"Cassez, F., David, A., Fleury, E., Larsen, K.G., Lime, D.: Efficient on-the-fly algorithms for the analysis of timed games. In: Abadi, M., de Alfaro, L. (eds.) CONCUR 2005. LNCS, vol. 3653, pp. 66\u201380. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11539452_9"},{"key":"2_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1007\/978-3-030-25540-4_21","volume-title":"Computer Aided Verification","author":"A Cimatti","year":"2019","unstructured":"Cimatti, A., Griggio, A., Magnago, E., Roveri, M., Tonetta, S.: Extending nuXmv with timed transition systems and timed temporal properties. In: Dillig, I., Tasiran, S. (eds.) CAV 2019. LNCS, vol. 11561, pp. 376\u2013386. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-25540-4_21"},{"key":"2_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1007\/978-3-642-54862-8_4","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"A Cimatti","year":"2014","unstructured":"Cimatti, A., Griggio, A., Mover, S., Tonetta, S.: IC3 modulo theories via implicit predicate abstraction. In: \u00c1brah\u00e1m, E., Havelund, K. (eds.) TACAS 2014. LNCS, vol. 8413, pp. 46\u201361. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-54862-8_4"},{"key":"2_CR41","volume-title":"Model-Checking","author":"E Clarke","year":"1999","unstructured":"Clarke, E., Grumberg, O., Peled, D.: Model-Checking. MIT Press, Cambridge (1999)"},{"key":"2_CR42","doi-asserted-by":"publisher","unstructured":"Damm, W., et al.: Exact and fully symbolic verification of linear hybrid automata with large discrete state spaces. Sci. Comput. Program. 77(10), 1122\u20131150 (2012). https:\/\/doi.org\/10.1016\/j.scico.2011.07.006, https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0167642311001523","DOI":"10.1016\/j.scico.2011.07.006"},{"issue":"5\u20136","key":"2_CR43","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1007\/s001650050028","volume":"10","author":"D Dams","year":"1998","unstructured":"Dams, D., Gerth, R., Knaack, B., Kuiper, R.: Partial-order reduction techniques for real-time model checking. Formal Aspects Comput. 10(5\u20136), 469\u2013482 (1998). https:\/\/doi.org\/10.1007\/s001650050028","journal-title":"Formal Aspects Comput."},{"key":"2_CR44","doi-asserted-by":"publisher","unstructured":"David, A., Yi, W.: Modelling and analysis of a commercial field bus protocol. In: Proceedings of 12th Euromicro Conference on Real-Time Systems (ECRTS 2000), pp. 165\u2013172. IEEE Computer Society Press (2000). https:\/\/doi.org\/10.1109\/EMRTS.2000.854004","DOI":"10.1109\/EMRTS.2000.854004"},{"key":"2_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/BFb0054180","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"C Daws","year":"1998","unstructured":"Daws, C., Tripakis, S.: Model checking of real-time reachability properties using abstractions. In: Steffen, B. (ed.) TACAS 1998. LNCS, vol. 1384, pp. 313\u2013329. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0054180"},{"key":"2_CR46","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/3-540-52148-8_17","volume-title":"Automatic Verification Methods for Finite State Systems","author":"DL Dill","year":"1990","unstructured":"Dill, D.L.: Timing assumptions and verification of finite-state concurrent systems. In: Sifakis, J. (ed.) CAV 1989. LNCS, vol. 407, pp. 197\u2013212. Springer, Heidelberg (1990). https:\/\/doi.org\/10.1007\/3-540-52148-8_17"},{"key":"2_CR47","doi-asserted-by":"publisher","unstructured":"Ehlers, R., Fass, D., Gerke, M., Peter, H.J.: Fully symbolic timed model checking using constraint matrix diagrams. In: Proceedings of 31th IEEE Real-Time Systems Symposium (RTSS 2010), pp. 360\u2013371. IEEE Computer Society Press (2010). https:\/\/doi.org\/10.1109\/RTSS.2010.36","DOI":"10.1109\/RTSS.2010.36"},{"issue":"8","key":"2_CR48","doi-asserted-by":"publisher","first-page":"1149","DOI":"10.1016\/j.ic.2007.01.009","volume":"205","author":"E Fersman","year":"2007","unstructured":"Fersman, E., Krcal, P., Pettersson, P., Yi, W.: Task automata: schedulability, decidability and undecidability. Inf. Comput. 205(8), 1149\u20131172 (2007)","journal-title":"Inf. Comput."},{"key":"2_CR49","unstructured":"Gastin, P., Mukherjee, S., Srivathsan, B.: Reachability in timed automata with diagonal constraints. In: Proceedings of 29th International Conference on Concurrency Theory (CONCUR 2018). LIPIcs, vol. 118, pp. 28:1\u201328:17. Leibniz-Zentrum f\u00fcr Informatik (2018)"},{"key":"2_CR50","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-3-030-25540-4_3","volume-title":"Computer Aided Verification","author":"P Gastin","year":"2019","unstructured":"Gastin, P., Mukherjee, S., Srivathsan, B.: Fast algorithms for handling diagonal constraints in timed automata. In: Dillig, I., Tasiran, S. (eds.) CAV 2019. LNCS, vol. 11561, pp. 41\u201359. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-25540-4_3"},{"key":"2_CR51","unstructured":"Gastin, P., Mukherjee, S., Srivathsan, B.: Fast algorithms for handling diagonal constraints in timed automata. CoRR abs\/1904.08590 (2019). http:\/\/arxiv.org\/abs\/1904.08590"},{"key":"2_CR52","unstructured":"Gastin, P., Mukherjee, S., Srivathsan, B.: Reachability for updatable timed automata made faster and more effective. In: Proceedings of 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2020). LIPIcs, vol. 118, pp. 47:1\u201347:17. Leibniz-Zentrum f\u00fcr Informatik (2020)"},{"key":"2_CR53","unstructured":"Govind, R., Herbreteau, F., Srivathsan, B., Walukiewicz, I.: Revisiting local time semantics for networks of timed automata. In: Proceedings of 30th International Conference on Concurrency Theory (CONCUR 2019). LIPIcs, vol. 140, pp. 16:1\u201316:15. Leibniz-Zentrum f\u00fcr Informatik (2019)"},{"key":"2_CR54","doi-asserted-by":"crossref","unstructured":"Govind, R., Herbreteau, F., Srivathsan, B., Walukiewicz, I.: abstrations for the local-time semantics of timed automata: a foundation for partial-order methods. Accepted at LICS (2022)","DOI":"10.1145\/3531130.3533343"},{"key":"2_CR55","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1007\/978-3-319-08867-9_26","volume-title":"Computer Aided Verification","author":"H Hansen","year":"2014","unstructured":"Hansen, H., Lin, S.-W., Liu, Y., Nguyen, T.K., Sun, J.: Diamonds are a girl\u2019s best friend: partial order reduction for timed automata with abstractions. In: Biere, A., Bloem, R. (eds.) CAV 2014. LNCS, vol. 8559, pp. 391\u2013406. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-08867-9_26"},{"key":"2_CR56","doi-asserted-by":"crossref","unstructured":"Havelund, K., Skou, A., Larsen, K.G., Lund, K.: Formal modeling and analysis of an audio\/video protocol: an industrial case study using UPPAAL. In: Proceedings of 18th IEEE Real-Time Systems Symposium (RTSS 1997), pp. 2\u201313. IEEE Computer Society Press (1997)","DOI":"10.7146\/brics.v4i31.18957"},{"key":"2_CR57","doi-asserted-by":"crossref","unstructured":"Henzinger, Th.A., Kopke, P.W., Puri, A., Varaiya, P.: What\u2019s decidable about hybrid automata? In: Proceedings of 27th Annual ACM Symposium on the Theory of Computing (STOC 1995), pp. 373\u2013382. ACM (1995)","DOI":"10.1145\/225058.225162"},{"issue":"2","key":"2_CR58","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1006\/inco.1994.1045","volume":"111","author":"TA Henzinger","year":"1994","unstructured":"Henzinger, T.A., Nicollin, X., Sifakis, J., Yovine, S.: Symbolic model-checking for real-time systems. Inf. Comput. 111(2), 193\u2013244 (1994)","journal-title":"Inf. Comput."},{"key":"2_CR59","unstructured":"Herbreteau, F., Point, G.: The TChecker tool and librairies. https:\/\/github.com\/ticktac-project\/tchecker"},{"key":"2_CR60","unstructured":"Herbreteau, F., Srivathsan, B., Tran, T.T., Walukiewicz, I.: Why liveness for timed automata is hard, and what we can do about it. In: Proceedings of 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2016). LIPIcs, vol. 65, pp. 48:1\u201348:14. Leibniz-Zentrum f\u00fcr Informatik (2016)"},{"issue":"3","key":"2_CR61","doi-asserted-by":"publisher","first-page":"17:1","DOI":"10.1145\/3372310","volume":"21","author":"F Herbreteau","year":"2020","unstructured":"Herbreteau, F., Srivathsan, B., Tran, T.T., Walukiewicz, I.: Why liveness for timed automata is hard, and what we can do about it. ACM Trans. Comput. Logic 21(3), 17:1-17:28 (2020)","journal-title":"ACM Trans. Comput. Logic"},{"key":"2_CR62","doi-asserted-by":"crossref","unstructured":"Herbreteau, F., Srivathsan, B., Walukiewicz, I.: Better abstractions for timed automata. In: Proceedings of 27th Annual Symposium on Logic in Computer Science (LICS 2012), pp. 375\u2013384. IEEE Computer Society Press (2012)","DOI":"10.1109\/LICS.2012.48"},{"key":"2_CR63","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"990","DOI":"10.1007\/978-3-642-39799-8_71","volume-title":"Computer Aided Verification","author":"F Herbreteau","year":"2013","unstructured":"Herbreteau, F., Srivathsan, B., Walukiewicz, I.: Lazy abstractions for timed automata. In: Sharygina, N., Veith, H. (eds.) CAV 2013. LNCS, vol. 8044, pp. 990\u20131005. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-39799-8_71"},{"key":"2_CR64","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.ic.2016.07.004","volume":"251","author":"F Herbreteau","year":"2016","unstructured":"Herbreteau, F., Srivathsan, B., Walukiewicz, I.: Better abstractions for timed automata. Inf. Comput. 251, 67\u201390 (2016)","journal-title":"Inf. Comput."},{"key":"2_CR65","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1007\/978-3-319-22975-1_9","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"F Herbreteau","year":"2015","unstructured":"Herbreteau, F., Tran, T.-T.: Improving search order for reachability testing in timed automata. In: Sankaranarayanan, S., Vicario, E. (eds.) FORMATS 2015. LNCS, vol. 9268, pp. 124\u2013139. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-22975-1_9"},{"key":"2_CR66","doi-asserted-by":"publisher","unstructured":"Kindermann, R., Junttila, T., Niemela, I.: Modeling for symbolic analysis of safety instrumented systems with clocks. In: Proceedings of 11th International Conference on Application of Concurrency to System Design (ACSD 2011), pp. 185\u2013194. IEEE Computer Society Press (2011). https:\/\/doi.org\/10.1109\/ACSD.2011.29","DOI":"10.1109\/ACSD.2011.29"},{"key":"2_CR67","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/978-3-642-33365-1_13","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"R Kindermann","year":"2012","unstructured":"Kindermann, R., Junttila, T., Niemel\u00e4, I.: SMT-based induction methods for timed systems. In: Jurdzi\u0144ski, M., Ni\u010dkovi\u0107, D. (eds.) FORMATS 2012. LNCS, vol. 7595, pp. 171\u2013187. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33365-1_13"},{"key":"2_CR68","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1007\/978-3-642-22110-1_47","volume-title":"Computer Aided Verification","author":"M Kwiatkowska","year":"2011","unstructured":"Kwiatkowska, M., Norman, G., Parker, D.: PRISM 4.0: verification of probabilistic real-time systems. In: Gopalakrishnan, G., Qadeer, S. (eds.) CAV 2011. LNCS, vol. 6806, pp. 585\u2013591. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22110-1_47"},{"key":"2_CR69","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"968","DOI":"10.1007\/978-3-642-39799-8_69","volume-title":"Computer Aided Verification","author":"A Laarman","year":"2013","unstructured":"Laarman, A., Olesen, M.C., Dalsgaard, A.E., Larsen, K.G., van de Pol, J.: Multi-core emptiness checking of timed B\u00fcchi automata using inclusion abstraction. In: Sharygina, N., Veith, H. (eds.) CAV 2013. LNCS, vol. 8044, pp. 968\u2013983. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-39799-8_69"},{"key":"2_CR70","doi-asserted-by":"crossref","unstructured":"Larsen, K.G., et al.: As cheap as possible: efficient cost-optimal reachability for priced timed automata. In: Proceedings of 13th International Conference on Computer Aided Verification (CAV 2001). Lecture Notes in Computer Science, vol. 2102, pp. 493\u2013505. Springer (2001)","DOI":"10.1007\/3-540-44585-4_47"},{"key":"2_CR71","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/978-3-030-59152-6_10","volume-title":"Automated Technology for Verification and Analysis","author":"KG Larsen","year":"2020","unstructured":"Larsen, K.G., Miku\u010dionis, M., Mu\u00f1iz, M., Srba, J.: Urgent partial order reduction for extended timed automata. In: Hung, D.V., Sokolsky, O. (eds.) ATVA 2020. LNCS, vol. 12302, pp. 179\u2013195. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-59152-6_10"},{"key":"2_CR72","doi-asserted-by":"crossref","unstructured":"Larsen, K.G., Pettersson, P., Yi, W.: Compositional and symbolic model-checking of real-time systems. In: Proceedings of 16th IEEE Real-Time Systems Symposium (RTSS 1995), pp. 76\u201389. IEEE Computer Society Press (1995)","DOI":"10.1109\/REAL.1995.495198"},{"key":"2_CR73","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1007\/BFb0020977","volume-title":"Hybrid Systems III","author":"KG Laxsen","year":"1996","unstructured":"Laxsen, K.G., Pettersson, P., Yi, W.: Diagnostic model-checking for real-time systems. In: Alur, R., Henzinger, T.A., Sontag, E.D. (eds.) HS 1995. LNCS, vol. 1066, pp. 575\u2013586. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/BFb0020977"},{"key":"2_CR74","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/978-3-642-04368-0_18","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"G Li","year":"2009","unstructured":"Li, G.: Checking timed B\u00fcchi automata emptiness using LU-abstractions. In: Ouaknine, J., Vaandrager, F.W. (eds.) FORMATS 2009. LNCS, vol. 5813, pp. 228\u2013242. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-04368-0_18"},{"key":"2_CR75","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/978-3-642-12002-2_34","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"J Malinowski","year":"2010","unstructured":"Malinowski, J., Niebert, P.: SAT based bounded model checking with partial order semantics for timed automata. In: Esparza, J., Majumdar, R. (eds.) TACAS 2010. LNCS, vol. 6015, pp. 405\u2013419. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-12002-2_34"},{"key":"2_CR76","doi-asserted-by":"publisher","unstructured":"Mercaldo, F., Martinelli, F., Santone, A.: Real-time SCADA attack detection by means of formal methods. In: Proceedings of 28th IEEE International Conference on Enabling Technologies: Infrastructure for Collaborative Enterprises (WETICE 2019), pp. 231\u2013236. IEEE Computer Society Press (2019). https:\/\/doi.org\/10.1109\/WETICE.2019.00057","DOI":"10.1109\/WETICE.2019.00057"},{"key":"2_CR77","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/978-3-642-16561-0_21","volume-title":"Leveraging Applications of Formal Methods, Verification, and Validation","author":"M Miku\u010dionis","year":"2010","unstructured":"Miku\u010dionis, M., et al.: Schedulability analysis using UPPAAL: Herschel-Planck case study. In: Margaria, T., Steffen, B. (eds.) ISoLA 2010. LNCS, vol. 6416, pp. 175\u2013190. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-16561-0_21"},{"key":"2_CR78","unstructured":"Mukherjee, S.: Reachability in timed automata with diagonal constraints and updates. Ph.D. thesis, Chennai Mathematical Institute, India (2022)"},{"key":"2_CR79","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1007\/978-3-642-32759-9_28","volume-title":"FM 2012: Formal Methods","author":"TK Nguyen","year":"2012","unstructured":"Nguyen, T.K., Sun, J., Liu, Y., Dong, J.S., Liu, Y.: Improved BDD-based discrete analysis of timed systems. In: Giannakopoulou, D., M\u00e9ry, D. (eds.) FM 2012. LNCS, vol. 7436, pp. 326\u2013340. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32759-9_28"},{"issue":"2","key":"2_CR80","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/s10703-012-0177-x","volume":"43","author":"G Norman","year":"2013","unstructured":"Norman, G., Parker, D., Sproston, J.: Model checking for probabilistic timed automata. Formal Methods Syst. Des. 43(2), 164\u2013190 (2013)","journal-title":"Formal Methods Syst. Des."},{"key":"2_CR81","unstructured":"Point, G.: TChecker online demonstration. https:\/\/tchecker.labri.fr\/"},{"key":"2_CR82","unstructured":"Point, G.: UPPAAL-to-TChecker: a tool to translate UPPAAL models into TChecker models. https:\/\/github.com\/ticktac-project\/uppaal-to-tchecker"},{"key":"2_CR83","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/978-3-642-19835-9_32","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"AP Ravn","year":"2011","unstructured":"Ravn, A.P., Srba, J., Vighio, S.: Modelling and verification of web services business activity protocol. In: Abdulla, P.A., Leino, K.R.M. (eds.) TACAS 2011. LNCS, vol. 6605, pp. 357\u2013371. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-19835-9_32"},{"key":"2_CR84","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1007\/978-3-030-25540-4_2","volume-title":"Computer Aided Verification","author":"V Roussanaly","year":"2019","unstructured":"Roussanaly, V., Sankur, O., Markey, N.: Abstraction refinement algorithms for timed automata. In: Dillig, I., Tasiran, S. (eds.) CAV 2019. LNCS, vol. 11561, pp. 22\u201340. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-25540-4_2"},{"issue":"5","key":"2_CR85","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1016\/S1571-0661(04)80523-1","volume":"68","author":"M Sorea","year":"2003","unstructured":"Sorea, M.: Bounded model checking for timed automata. Electron. Notes Theoret. Comput. Sci. 68(5), 116\u2013134 (2003)","journal-title":"Electron. Notes Theoret. Comput. Sci."},{"key":"2_CR86","unstructured":"Srivathsan, B.: Abstractions for timed automata. Ph.D. thesis, University of Bordeaux (2012)"},{"key":"2_CR87","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/978-3-662-46681-0_20","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"Y Thierry-Mieg","year":"2015","unstructured":"Thierry-Mieg, Y.: Symbolic model-checking using ITS-tools. In: Baier, C., Tinelli, C. (eds.) TACAS 2015. LNCS, vol. 9035, pp. 231\u2013237. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46681-0_20"},{"key":"2_CR88","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1007\/978-3-319-65765-3_15","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"T T\u00f3th","year":"2017","unstructured":"T\u00f3th, T., Majzik, I.: Lazy reachability checking for timed automata using interpolants. In: Abate, A., Geeraerts, G. (eds.) FORMATS 2017. LNCS, vol. 10419, pp. 264\u2013280. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-65765-3_15"},{"issue":"1","key":"2_CR89","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1023\/A:1008734703554","volume":"18","author":"S Tripakis","year":"2001","unstructured":"Tripakis, S., Yovine, S.: Analysis of timed systems using time-abstracting bisimulations. Formal Methods Syst. Des. 18(1), 25\u201368 (2001)","journal-title":"Formal Methods Syst. Des."},{"key":"2_CR90","series-title":"IFIP International Federation for Information Processing","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/0-306-47003-9_15","volume-title":"Formal Techniques for Networked and Distributed Systems","author":"F Wang","year":"2002","unstructured":"Wang, F.: Symbolic verification of complex real-time systems with clock-restriction diagram. In: Kim, M., Chin, B., Kang, S., Lee, D. (eds.) FORTE 2001. IIFIP, vol. 69, pp. 235\u2013250. Springer, Boston (2002). https:\/\/doi.org\/10.1007\/0-306-47003-9_15"},{"key":"2_CR91","doi-asserted-by":"crossref","unstructured":"Wang, F.: REDLIB for the formal verification of embedded systems. In: Proceedings of 2nd International Symposium on Leveraging Applications of Formal Methods (ISoLA 2006), pp. 341\u2013346. IEEE Computer Society Press (2006)","DOI":"10.1109\/ISoLA.2006.68"}],"container-title":["Lecture Notes in Computer Science","Formal Modeling and Analysis of Timed Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-15839-1_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,2]],"date-time":"2024-10-02T18:39:44Z","timestamp":1727894384000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-15839-1_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031158384","9783031158391"],"references-count":91,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-15839-1_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"29 August 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FORMATS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Formal Modeling and Analysis of Timed Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Warsaw","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"formats2022","order":10,"name":"conference_id","label":"Conference ID","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":"30","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":"12","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":"2","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)"}}]}}