{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T09:57:38Z","timestamp":1776333458917,"version":"3.51.2"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540472377","type":"print"},{"value":"9783540472384","type":"electronic"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11901914_23","type":"book-chapter","created":{"date-parts":[[2006,10,10]],"date-time":"2006-10-10T01:21:43Z","timestamp":1160443303000},"page":"292-306","source":"Crossref","is-referenced-by-count":16,"title":["Timed Unfoldings for Networks of Timed Automata"],"prefix":"10.1007","author":[{"given":"Patricia","family":"Bouyer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Serge","family":"Haddad","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pierre-Alain","family":"Reynier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"23_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.: A theory of timed automata. Theor. Comp. Sci.\u00a0126(2), 183\u2013235 (1994)","journal-title":"Theor. Comp. Sci."},{"issue":"1\u20132","key":"23_CR2","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1016\/S0304-3975(99)00114-0","volume":"243","author":"T. Aura","year":"2000","unstructured":"Aura, T., Lilius, J.: A causal semantics for time Petri nets. Theor. Comp. Sci.\u00a0243(1\u20132), 409\u2013447 (2000)","journal-title":"Theor. Comp. Sci."},{"key":"23_CR3","series-title":"Lecture Notes in Computer Science","volume-title":"CONCUR 2006 \u2013 Concurrency Theory","author":"R. Ben Salah","year":"2006","unstructured":"Ben Salah, R., Bozga, M., Maler, O.: On interleaving in timed automata. In: Baier, C., Hermanns, H. (eds.) CONCUR 2006. LNCS, vol.\u00a04137, Springer, Heidelberg (2006)"},{"key":"23_CR4","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.\u00a01466, pp. 485\u2013500. Springer, Heidelberg (1998)"},{"issue":"3","key":"23_CR5","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1109\/32.75415","volume":"17","author":"B. Berthomieu","year":"1991","unstructured":"Berthomieu, B., Diaz, M.: Modeling and verification of time dependent systems using time Petri nets. IEEE Trans. Softw. Engineering\u00a017(3), 259\u2013273 (1991)","journal-title":"IEEE Trans. Softw. Engineering"},{"issue":"3","key":"23_CR6","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 in Syst. Design\u00a024(3), 281\u2013320 (2004)","journal-title":"Formal Methods in Syst. Design"},{"key":"23_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1007\/11787006_36","volume-title":"Automata, Languages and Programming","author":"P. Bouyer","year":"2006","unstructured":"Bouyer, P., Haddad, S., Reynier, P.-A.: Timed Petri nets and timed automata: On the discriminating power of Zeno sequences. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol.\u00a04052, pp. 420\u2013431. Springer, Heidelberg (2006)"},{"key":"23_CR8","doi-asserted-by":"crossref","unstructured":"Bouyer, P., Haddad, S., Reynier, P.-A.: Timed unfoldings for networks of timed automata. Research Rep. LSV-06-09, Lab. Sp\u00e9cification et V\u00e9rification, ENS de Cachan, France (2006)","DOI":"10.1007\/11901914_23"},{"key":"23_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1007\/11603009_16","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"T.. Chatain","year":"2005","unstructured":"Chatain, Th., Jard, C.: Time supervision of concurrent systems using symbolic unfoldings of time Petri nets. In: Pettersson, P., Yi, W. (eds.) FORMATS 2005. LNCS, vol.\u00a03829, pp. 196\u2013210. Springer, Heidelberg (2005)"},{"key":"23_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/11767589_8","volume-title":"Petri Nets and Other Models of Concurrency - ICATPN 2006","author":"T.. Chatain","year":"2006","unstructured":"Chatain, Th., Jard, C.: Complete finite prefixes of symbolic unfoldings of time Petri nets. In: Donatelli, S., Thiagarajan, P.S. (eds.) ICATPN 2006. LNCS, vol.\u00a04024, pp. 125\u2013145. Springer, Heidelberg (2006)"},{"key":"23_CR11","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.) ETAPS 1998 and TACAS 1998. LNCS, vol.\u00a01384, pp. 313\u2013329. Springer, Heidelberg (1998)"},{"key":"23_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1007\/3-540-52148-8_17","volume-title":"Automatic Verification Methods for Finite State Systems","author":"D. Dill","year":"1990","unstructured":"Dill, D.: Timing assumptions and verification of finite-state concurrent systems. In: Sifakis, J. (ed.) CAV 1989. LNCS, vol.\u00a0407, pp. 197\u2013212. Springer, Heidelberg (1990)"},{"issue":"3","key":"23_CR13","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1023\/A:1014746130920","volume":"20","author":"J. Esparza","year":"2002","unstructured":"Esparza, J., R\u00f6mer, S., Vogler, W.: An improvement of McMillan\u2019s unfolding algorithm. Formal Methods in Syst. Design\u00a020(3), 285\u2013310 (2002)","journal-title":"Formal Methods in Syst. Design"},{"key":"23_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/3-540-45455-1_13","volume-title":"Algorithmic Number Theory","author":"H. Fleischhack","year":"2002","unstructured":"Fleischhack, H., Stehno, C.: Computing a finite prefix of a time Petri net. In: Fieker, C., Kohel, D.R. (eds.) ANTS 2002. LNCS, vol.\u00a02369, pp. 163\u2013181. Springer, Heidelberg (2002)"},{"key":"23_CR15","doi-asserted-by":"crossref","unstructured":"Lilius, J.: Efficient state space search for time Petri nets. ENTCS 18 (1998)","DOI":"10.1016\/S1571-0661(05)80254-3"},{"key":"23_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1007\/978-3-540-24730-2_24","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"D. Lugiez","year":"2004","unstructured":"Lugiez, D., Niebert, P., Zennou, S.: A partial order semantics approach to the clock explosion problem of timed automata. In: Jensen, K., Podelski, A. (eds.) TACAS 2004. LNCS, vol.\u00a02988, pp. 296\u2013311. Springer, Heidelberg (2004)"},{"issue":"1","key":"23_CR17","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/BF01384314","volume":"6","author":"K. McMillan","year":"1995","unstructured":"McMillan, K.: A technique of state space search based on unfolding. Formal Methods in Syst. Design\u00a06(1), 45\u201365 (1995)","journal-title":"Formal Methods in Syst. Design"},{"key":"23_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1007\/3-540-48320-9_30","volume-title":"CONCUR\u201999. Concurrency Theory","author":"M. Minea","year":"1999","unstructured":"Minea, M.: Partial order reduction for model checking of timed automata. In: Baeten, J.C.M., Mauw, S. (eds.) CONCUR 1999. LNCS, vol.\u00a01664, pp. 431\u2013446. Springer, Heidelberg (1999)"},{"key":"23_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1007\/3-540-56922-7_34","volume-title":"Computer Aided Verification","author":"D. Peled","year":"1993","unstructured":"Peled, D.: All from one, one for all: on model checking using representatives. In: Courcoubetis, C. (ed.) CAV 1993. LNCS, vol.\u00a0697, pp. 409\u2013423. Springer, Heidelberg (1993)"},{"key":"23_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1007\/3-540-53863-1_36","volume-title":"Advances in Petri Nets 1990","author":"A. Valmari","year":"1991","unstructured":"Valmari, A.: Stubborn sets for reduced state space generation. In: Rozenberg, G. (ed.) APN 1990. LNCS, vol.\u00a0483, pp. 491\u2013515. Springer, Heidelberg (1991)"},{"key":"23_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/BFb0055644","volume-title":"CONCUR \u201998 Concurrency Theory","author":"W. Vogler","year":"1998","unstructured":"Vogler, W., Semenov, A.L., Yakovlev, A.: Unfolding and finite prefix for nets with read arcs. In: Sangiorgi, D., de Simone, R. (eds.) CONCUR 1998. LNCS, vol.\u00a01466, pp. 501\u2013516. Springer, Heidelberg (1998)"},{"issue":"1-2","key":"23_CR22","doi-asserted-by":"crossref","first-page":"235","DOI":"10.3233\/FI-2009-199","volume":"51","author":"J. Winkowski","year":"2002","unstructured":"Winkowski, J.: Reachability in contextual nets. Fundam. Inform.\u00a051(1-2), 235\u2013250 (2002)","journal-title":"Fundam. Inform."},{"issue":"2","key":"23_CR23","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1023\/A:1008682131325","volume":"11","author":"T. Yoneda","year":"1997","unstructured":"Yoneda, T., Schlingloff, B.-H.: Efficient verification of parallel real-time systems. Formal Methods in Syst. Design\u00a011(2), 187\u2013215 (1997)","journal-title":"Formal Methods in Syst. Design"}],"container-title":["Lecture Notes in Computer Science","Automated Technology for Verification and Analysis"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11901914_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,18]],"date-time":"2020-04-18T09:51:49Z","timestamp":1587203509000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11901914_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540472377","9783540472384"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/11901914_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}