{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T19:19:23Z","timestamp":1742930363596,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662681909"},{"type":"electronic","value":"9783662681916"}],"license":[{"start":{"date-parts":[[2023,11,1]],"date-time":"2023-11-01T00:00:00Z","timestamp":1698796800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,11,1]],"date-time":"2023-11-01T00:00:00Z","timestamp":1698796800000},"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":[[2024]]},"DOI":"10.1007\/978-3-662-68191-6_10","type":"book-chapter","created":{"date-parts":[[2023,10,31]],"date-time":"2023-10-31T06:02:02Z","timestamp":1698732122000},"page":"246-263","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An Efficient State Space Construction for\u00a0a\u00a0Class of\u00a0Timed Automata"],"prefix":"10.1007","author":[{"given":"Johan","family":"Arcile","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Raymond","family":"Devillers","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hanna","family":"Klaudel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,11,1]]},"reference":[{"issue":"2","key":"10_CR1","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. Theor. Comput. Sci. 126(2), 183\u2013235 (1994)","journal-title":"Theor. Comput. Sci."},{"key":"10_CR2","unstructured":"Arcile, J.: Sources of the MAPTs models and exploration algorithms. https:\/\/forge.ibisc.univ-evry.fr\/jarcile\/MAPTs\/. Accessed 11 Oct 2019"},{"key":"10_CR3","unstructured":"Arcile, J.: Conception, mod\u00e9lisation et v\u00e9rification formelle d\u2019un syst\u00e8me temps-r\u00e9el d\u2019agents coop\u00e9ratifs: application aux v\u00e9hicules autonomes communicants. PhD thesis, Universit\u00e9 Paris-Saclay, France; pr\u00e9par\u00e9e \u00e0 l\u2019Universit\u00e9 d\u2019Evry-Val-d\u2019Essonne: https:\/\/www.biblio.univ-evry.fr\/theses\/2019\/2019SACLE029.pdf (2019)"},{"issue":"3","key":"10_CR4","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/s10458-019-09409-x","volume":"33","author":"J Arcile","year":"2019","unstructured":"Arcile, J., Devillers, R., Klaudel, H.: VerifCar: a framework for modeling and model checking communicating autonomous vehicles. Auton. Agent. Multi-Agent Syst. 33(3), 353\u2013381 (2019). https:\/\/doi.org\/10.1007\/s10458-019-09409-x","journal-title":"Auton. Agent. Multi-Agent Syst."},{"issue":"1\u20134","key":"10_CR5","doi-asserted-by":"publisher","first-page":"59","DOI":"10.3233\/FI-2020-1948","volume":"175","author":"J Arcile","year":"2020","unstructured":"Arcile, J., Devillers, R.R., Klaudel, H.: Dynamic exploration of multi-agent systems with periodic timed tasks. Fundam. Informaticae 175(1\u20134), 59\u201395 (2020)","journal-title":"Fundam. Informaticae"},{"key":"10_CR6","unstructured":"Arcile, J., Devillers, R., Klaudel, H.: Models for dynamic exploration of the state spaces of autonomous vehicles. In: Proceedings of the International Workshop on Petri Nets and Software Engineering co-located with 41st International Conference on Application and Theory of Petri Nets and Concurrency (PETRI NETS 2020), Paris, France, June 24, 2020 (due to COVID-19: virtual conference), pp. 29\u201348 (2020)"},{"key":"10_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/3-540-45739-9_1","volume-title":"Formal Techniques in Real-Time and Fault-Tolerant Systems","author":"G Behrmann","year":"2002","unstructured":"Behrmann, G., Bengtsson, J., David, A., Larsen, K.G., Pettersson, P., Yi, W.: UPPAAL implementation secrets. In: Damm, W., Olderog, E.-R. (eds.) FTRTFT 2002. LNCS, vol. 2469, pp. 3\u201322. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45739-9_1"},{"issue":"3","key":"10_CR8","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1007\/s10009-005-0190-0","volume":"8","author":"G Behrmann","year":"2006","unstructured":"Behrmann, G., Bouyer, P., Larsen, K.G., Pel\u00e1nek, R.: Lower and upper bounds in zone-based abstractions of timed automata. Int. J. Softw. Tools Technol. Transfer 8(3), 204\u2013215 (2006). https:\/\/doi.org\/10.1007\/s10009-005-0190-0","journal-title":"Int. J. Softw. Tools Technol. Transfer"},{"key":"10_CR9","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":"10_CR10","doi-asserted-by":"crossref","unstructured":"Clarke, E.M., Grumberg, O., Peled, D.: Model Checking. MIT Press (2001)","DOI":"10.1016\/B978-044450813-3\/50026-6"},{"key":"10_CR11","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511809088","volume-title":"Introduction to Lattices and Order","author":"BA Davey","year":"2002","unstructured":"Davey, B.A., Priestley, H.A.: Introduction to Lattices and Order, 2nd edn. Cambridge University Press, Cambridge (2002)","edition":"2"},{"key":"10_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1007\/BFb0020947","volume-title":"Hybrid Systems III","author":"C Daws","year":"1996","unstructured":"Daws, C., Olivero, A., Tripakis, S., Yovine, S.: The tool Kronos. In: Alur, R., Henzinger, T.A., Sontag, E.D. (eds.) HS 1995. LNCS, vol. 1066, pp. 208\u2013219. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/BFb0020947"},{"key":"10_CR13","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":"10_CR14","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"},{"issue":"2","key":"10_CR15","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/j.jtte.2018.09.005","volume":"6","author":"D Elliott","year":"2019","unstructured":"Elliott, D., Keen, W., Miao, L.: Recent advances in connected and automated vehicles. J. Traffic Transp. Eng. (English Edition) 6(2), 109\u2013131 (2019)","journal-title":"J. Traffic Transp. Eng. (English Edition)"},{"issue":"1\u20134","key":"10_CR16","doi-asserted-by":"publisher","first-page":"207","DOI":"10.3233\/FI-2020-1955","volume":"175","author":"W Jamroga","year":"2020","unstructured":"Jamroga, W., Konikowska, B., Kurpiewski, D., Penczek, W.: Multi-valued verification of strategic ability. Fundam. Informaticae 175(1\u20134), 207\u2013251 (2020)","journal-title":"Fundam. Informaticae"},{"key":"10_CR17","unstructured":"Moler, C.: Pentium division bug documents. MATLAB Central File Exchange (2021)"},{"key":"10_CR18","unstructured":"Pommereau, F.: ZINC: a compiler for \u201cany language\u201d-coloured Petri nets. IBISC, university of Evry\/Paris-Saclay, Technical report (2018)"}],"container-title":["Lecture Notes in Computer Science","Transactions on Petri Nets and Other Models of Concurrency XVII"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-68191-6_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,31]],"date-time":"2023-10-31T06:03:54Z","timestamp":1698732234000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-68191-6_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,1]]},"ISBN":["9783662681909","9783662681916"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-68191-6_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023,11,1]]},"assertion":[{"value":"1 November 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}