{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,3]],"date-time":"2026-10-03T07:56:55Z","timestamp":1791014215639,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":61,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642161636","type":"print"},{"value":"9783642161643","type":"electronic"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-16164-3_13","type":"book-chapter","created":{"date-parts":[[2010,9,20]],"date-time":"2010-09-20T10:56:55Z","timestamp":1284980215000},"page":"180-186","source":"Crossref","is-referenced-by-count":5,"title":["A False History of True Concurrency: From Petri to Tools"],"prefix":"10.1007","author":[{"given":"Javier","family":"Esparza","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"13_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1007\/10722167_37","volume-title":"Computer Aided Verification","author":"P.A. Abdulla","year":"2000","unstructured":"Abdulla, P.A., Iyer, S.P., Nyl\u00e9n, A.: Unfoldings of unbounded Petri nets. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol.\u00a01855, pp. 495\u2013507. Springer, Heidelberg (2000)"},{"key":"13_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/978-3-540-85361-9_19","volume-title":"CONCUR 2008 - Concurrency Theory","author":"P. Baldan","year":"2008","unstructured":"Baldan, P., Chatain, T., Haar, S., K\u00f6nig, B.: Unfolding-based diagnosis of systems with an evolving topology. In: van Breugel, F., Chechik, M. (eds.) CONCUR 2008. LNCS, vol.\u00a05201, pp. 203\u2013217. Springer, Heidelberg (2008)"},{"key":"13_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/978-3-540-28644-8_6","volume-title":"CONCUR 2004 - Concurrency Theory","author":"P. Baldan","year":"2004","unstructured":"Baldan, P., Corradini, A., K\u00f6nig, B.: Verifying finite-state graph grammars: An unfolding-based approach. In: Gardner, P., Yoshida, N. (eds.) CONCUR 2004. LNCS, vol.\u00a03170, pp. 83\u201398. Springer, Heidelberg (2004)"},{"key":"13_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/978-3-540-89287-8_12","volume-title":"Transactions on Petri Nets and Other Models of Concurrency","author":"P. Baldan","year":"2008","unstructured":"Baldan, P., Corradini, A., K\u00f6nig, B., Schwoon, S.: McMillan\u2019s complete prefix for contextual nets. In: Jensen, K., van der Aalst, W.M.P., Billington, J. (eds.) Transactions on Petri Nets and Other Models of Concurrency I. LNCS, vol.\u00a05100, pp. 199\u2013220. Springer, Heidelberg (2008)"},{"key":"13_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/11690634_9","volume-title":"Foundations of Software Science and Computation Structures","author":"P. Baldan","year":"2006","unstructured":"Baldan, P., Haar, S., K\u00f6nig, B.: Distributed unfolding of Petri nets. In: Aceto, L., Ing\u00f3lfsd\u00f3ttir, A. (eds.) FOSSACS 2006. LNCS, vol.\u00a03921, pp. 126\u2013141. Springer, Heidelberg (2006)"},{"issue":"5","key":"13_CR6","doi-asserted-by":"publisher","first-page":"714","DOI":"10.1109\/TAC.2003.811249","volume":"48","author":"A. Benveniste","year":"2003","unstructured":"Benveniste, A., Fabre, E., Jard, C., Haar, S.: Diagnosis of asynchronous discrete event systems, a net unfolding approach. IEEE Transactions on Automatic Control\u00a048(5), 714\u2013727 (2003)","journal-title":"IEEE Transactions on Automatic Control"},{"key":"13_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-45187-7_1","volume-title":"CONCUR 2003 - Concurrency Theory","author":"A. Benveniste","year":"2003","unstructured":"Benveniste, A., Haar, S., Fabre, E., Jard, C.: Distributed monitoring of concurrent and asynchronous systems. In: Amadio, R.M., Lugiez, D. (eds.) CONCUR 2003. LNCS, vol.\u00a02761, pp. 1\u201326. Springer, Heidelberg (2003)"},{"issue":"1","key":"13_CR8","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/0304-3975(87)90090-9","volume":"55","author":"E. Best","year":"1987","unstructured":"Best, E., Devillers, R.R.: Sequential and concurrent behaviour in Petri net theory. Theoretical Computer Science\u00a055(1), 87\u2013136 (1987)","journal-title":"Theoretical Computer Science"},{"key":"13_CR9","series-title":"EATCS Monographs on Theoretical Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-73483-0","volume-title":"Nonsequential Processes","author":"E. Best","year":"1988","unstructured":"Best, E., Fern\u00e1ndez, C.: Nonsequential Processes. EATCS Monographs on Theoretical Computer Science. Springer, Heidelberg (1988)"},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"Bouyer, P., Haddad, S., Reynier, P.-A.: Timed unfoldings for networks of timed automata. In: Graf and Zhang [28], pp. 292\u2013306","DOI":"10.1007\/11901914_23"},{"key":"13_CR11","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1142\/9781848162914_0007","volume":"3","author":"W. Brauer","year":"2009","unstructured":"Brauer, W., Reisig, W.: Carl Adam Petri and \u201cPetri nets\u201d. Fundamental Concepts in Computer Science\u00a03, 129\u2013139 (2009)","journal-title":"Fundamental Concepts in Computer Science"},{"key":"13_CR12","doi-asserted-by":"crossref","unstructured":"Cassez, F., Chatain, T., Jard, C.: Symbolic unfoldings for networks of timed automata. In: Graf and Zhang [12], pp. 307\u2013321","DOI":"10.1007\/11901914_24"},{"key":"13_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1007\/978-3-540-30232-2_21","volume-title":"Formal Techniques for Networked and Distributed Systems \u2013 FORTE 2004","author":"T. Chatain","year":"2004","unstructured":"Chatain, T., Jard, C.: Symbolic diagnosis of partially observable concurrent systems. In: de Frutos-Escrig, D., N\u00fa\u00f1ez, M. (eds.) FORTE 2004. LNCS, vol.\u00a03235, pp. 326\u2013342. Springer, Heidelberg (2004)"},{"key":"13_CR14","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, T., 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":"13_CR15","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, T., Jard, C.: Complete finite prefixes of symbolic unfoldings of safe time Petri nets. In: Donatelli, S., Thiagarajan, P.S. (eds.) ICATPN 2006. LNCS, vol.\u00a04024, pp. 125\u2013145. Springer, Heidelberg (2006)"},{"key":"13_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/3-540-44988-4_9","volume-title":"Application and Theory of Petri Nets 2000","author":"J.-M. Couvreur","year":"2000","unstructured":"Couvreur, J.-M., Grivet, S., Poitrenaud, D.: Designing a LTL model-checker based on unfolding graphs. In: Nielsen, M., Simpson, D. (eds.) ICATPN 2000. LNCS, vol.\u00a01825, p. 123. Springer, Heidelberg (2000)"},{"key":"13_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/3-540-45740-2_9","volume-title":"Applications and Theory of Petri Nets 2001","author":"J.-M. Couvreur","year":"2001","unstructured":"Couvreur, J.-M., Grivet, S., Poitrenaud, D.: Unfolding of products of symmetrical Petri nets. In: Colom, J.-M., Koutny, M. (eds.) ICATPN 2001. LNCS, vol.\u00a02075, pp. 121\u2013143. Springer, Heidelberg (2001)"},{"key":"13_CR18","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1007\/BF01463946","volume":"28","author":"J. Engelfriet","year":"1991","unstructured":"Engelfriet, J.: Branching processes of Petri nets. Acta Informatica\u00a028, 575\u2013591 (1991)","journal-title":"Acta Informatica"},{"key":"13_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1007\/3-540-45022-X_40","volume-title":"Automata, Languages and Programming","author":"J. Esparza","year":"2000","unstructured":"Esparza, J., Heljanko, K.: A new unfolding approach to LTL model checking. In: Welzl, E., Montanari, U., Rolim, J.D.P. (eds.) ICALP 2000. LNCS, vol.\u00a01853, pp. 475\u2013486. Springer, Heidelberg (2000)"},{"key":"13_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/3-540-45139-0_4","volume-title":"Model Checking Software","author":"J. Esparza","year":"2001","unstructured":"Esparza, J., Heljanko, K.: Implementing LTL model checking with net unfoldings. In: Dwyer, M.B. (ed.) SPIN 2001. LNCS, vol.\u00a02057, pp. 37\u201356. Springer, Heidelberg (2001)"},{"key":"13_CR21","series-title":"EATCS Monographs in Theoretical Computer Science","volume-title":"Unfoldings - A Partial-Order Approach to Model Checking","author":"J. Esparza","year":"2008","unstructured":"Esparza, J., Heljanko, K.: Unfoldings - A Partial-Order Approach to Model Checking. EATCS Monographs in Theoretical Computer Science. Springer, Heidelberg (2008)"},{"key":"13_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/3-540-48320-9_2","volume-title":"CONCUR\u201999. Concurrency Theory","author":"J. Esparza","year":"1999","unstructured":"Esparza, J., R\u00f6mer, S.: An unfolding algorithm for synchronous products of transition systems. In: Baeten, J.C.M., Mauw, S. (eds.) CONCUR 1999. LNCS, vol.\u00a01664, pp. 2\u201320. Springer, Heidelberg (1999)"},{"issue":"3","key":"13_CR23","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 System Design\u00a020(3), 285\u2013310 (2002)","journal-title":"Formal Methods in System Design"},{"key":"13_CR24","unstructured":"Esparza, J., Schr\u00f6ter, C.: Reachability analysis using net unfoldings. In: Proceeding of the Workshop Concurrency, Specification & Programming 2000. Informatik-Bericht 140, vol.\u00a0II, pp. 255\u2013270. Humboldt-Universit\u00e4t zu, Berlin (2000)"},{"key":"13_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/3-540-48068-4_11","volume-title":"Application and Theory of Petri Nets 2002","author":"H. Fleischhack","year":"2002","unstructured":"Fleischhack, H., Stehno, C.: Computing a finite prefix of a time Petri net. In: Esparza, J., Lakos, C.A. (eds.) ICATPN 2002. LNCS, vol.\u00a02360, pp. 163\u2013181. Springer, Heidelberg (2002)"},{"issue":"2\/3","key":"13_CR26","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/S0019-9958(83)80040-0","volume":"57","author":"U. Goltz","year":"1983","unstructured":"Goltz, U., Reisig, W.: The non-sequential behaviour of Petri nets. Information and Control\u00a057(2\/3), 125\u2013147 (1983)","journal-title":"Information and Control"},{"key":"13_CR27","doi-asserted-by":"crossref","unstructured":"Grabiec, B., Traonouez, L.-M., Jard, C., Lime, D., Roux, O.H.: Diagnosis using unfoldings of parametric time Petri nets. In: Proceedings of FORMATS 2010 (to appear, 2010)","DOI":"10.1007\/978-3-642-15297-9_12"},{"key":"13_CR28","series-title":"Lecture Notes in Computer Science","volume-title":"Automated Technology for Verification and Analysis","year":"2006","unstructured":"Graf, S., Zhang, W. (eds.): ATVA 2006. LNCS, vol.\u00a04218. Springer, Heidelberg (2006)"},{"key":"13_CR29","doi-asserted-by":"crossref","unstructured":"Grahlmann, B.: The PEP tool. In: Grumberg [30], pp. 440\u2013443","DOI":"10.1007\/3-540-63166-6_43"},{"key":"13_CR30","series-title":"Lecture Notes in Computer Science","volume-title":"Computer Aided Verification","year":"1997","unstructured":"Grumberg, O. (ed.): CAV 1997. LNCS, vol.\u00a01254. Springer, Heidelberg (1997)"},{"issue":"3","key":"13_CR31","doi-asserted-by":"crossref","first-page":"247","DOI":"10.3233\/FI-1999-37304","volume":"37","author":"K. Heljanko","year":"1999","unstructured":"Heljanko, K.: Using logic programs with stable model semantics to solve deadlock and reachability problems for 1-safe Petri nets. Fundamenta Informaticae\u00a037(3), 247\u2013268 (1999)","journal-title":"Fundamenta Informaticae"},{"key":"13_CR32","doi-asserted-by":"crossref","unstructured":"Heljanko, K.: Model checking with finite complete prefixes is PSPACE-complete. In: Palamidessi [54], pp. 108\u2013122","DOI":"10.1007\/3-540-44618-4_10"},{"key":"13_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/3-540-46002-0_26","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"K. Heljanko","year":"2002","unstructured":"Heljanko, K., Khomenko, V., Koutny, M.: Parallelisation of the Petri net unfolding algorithm. In: Katoen, J.-P., Stevens, P. (eds.) TACAS 2002. LNCS, vol.\u00a02280, pp. 371\u2013385. Springer, Heidelberg (2002)"},{"key":"13_CR34","unstructured":"Victor Khomenko. PUNF \u2014 Petri net unfolder, http:\/\/homepages.cs.ncl.ac.uk\/victor.khomenko\/tools\/"},{"key":"13_CR35","doi-asserted-by":"crossref","unstructured":"Khomenko, V., Koutny, M.: LP deadlock checking using partial order dependencies. In: Palamidessi [54], pp. 410\u2013425","DOI":"10.1007\/3-540-44618-4_30"},{"key":"13_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1007\/3-540-44685-0_25","volume-title":"CONCUR 2001 - Concurrency Theory","author":"V. Khomenko","year":"2001","unstructured":"Khomenko, V., Koutny, M.: Towards an efficient algorithm for unfolding Petri nets. In: Larsen, K.G., Nielsen, M. (eds.) CONCUR 2001. LNCS, vol.\u00a02154, pp. 366\u2013380. Springer, Heidelberg (2001)"},{"key":"13_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"458","DOI":"10.1007\/3-540-36577-X_34","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"V. Khomenko","year":"2003","unstructured":"Khomenko, V., Koutny, M.: Branching processes of high-level Petri nets. In: Garavel, H., Hatcliff, J. (eds.) TACAS 2003. LNCS, vol.\u00a02619, pp. 458\u2013472. Springer, Heidelberg (2003)"},{"issue":"2","key":"13_CR38","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/s00236-003-0122-y","volume":"40","author":"V. Khomenko","year":"2003","unstructured":"Khomenko, V., Koutny, M., Vogler, W.: Canonical prefixes of Petri net unfoldings. Acta Informatica\u00a040(2), 95\u2013118 (2003)","journal-title":"Acta Informatica"},{"issue":"2","key":"13_CR39","first-page":"221","volume":"62","author":"V. Khomenko","year":"2004","unstructured":"Khomenko, V., Koutny, M., Yakovlev, A.: Detecting state encoding conflicts in STG unfoldings using SAT. Fundamenta Informaticae\u00a062(2), 221\u2013241 (2004)","journal-title":"Fundamenta Informaticae"},{"issue":"1-2","key":"13_CR40","first-page":"49","volume":"70","author":"V. Khomenko","year":"2006","unstructured":"Khomenko, V., Koutny, M., Yakovlev, A.: Logic synthesis for asynchronous circuits based on STG unfoldings and incremental SAT. Fundamenta Informaticae\u00a070(1-2), 49\u201373 (2006)","journal-title":"Fundamenta Informaticae"},{"key":"13_CR41","first-page":"57","volume-title":"ACSD","author":"V. Khomenko","year":"2006","unstructured":"Khomenko, V., Madalinski, A., Yakovlev, A.: Resolution of encoding conflicts by signal insertion and concurrency reduction based on STG unfoldings. In: ACSD, pp. 57\u201368. IEEE Computer Society, Los Alamitos (2006)"},{"key":"13_CR42","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1308\/147363505X39437","volume":"87","author":"B. K\u00f6nig","year":"2005","unstructured":"K\u00f6nig, B., Kozioura, V.: AUGUR - A tool for the analysis of graph transformation systems. Bulletin of the EATCS\u00a087, 126\u2013137 (2005)","journal-title":"Bulletin of the EATCS"},{"key":"13_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1007\/3-540-48683-6_18","volume-title":"Computer Aided Verification","author":"R. Langerak","year":"1999","unstructured":"Langerak, R., Brinksma, E.: A complete finite prefix for process algebra. In: Halbwachs, N., Peled, D.A. (eds.) CAV 1999. LNCS, vol.\u00a01633, pp. 184\u2013195. Springer, Heidelberg (1999)"},{"key":"13_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1007\/11526841_23","volume-title":"FM 2005: Formal Methods","author":"Y. Lei","year":"2005","unstructured":"Lei, Y., Iyer, S.P.: An approach to unfolding asynchronous communication protocols. In: Fitzgerald, J.S., Hayes, I.J., Tarlecki, A. (eds.) FM 2005. LNCS, vol.\u00a03582, pp. 334\u2013349. Springer, Heidelberg (2005)"},{"key":"13_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/3-540-56496-9_14","volume-title":"Computer Aided Verification","author":"K.L. McMillan","year":"1993","unstructured":"McMillan, K.L.: Using unfoldings to avoid the state explosion problem in the verification of asynchronous circuits. In: Probst, D.K., von Bochmann, G. (eds.) CAV 1992. LNCS, vol.\u00a0663, pp. 164\u2013177. Springer, Heidelberg (1993)"},{"key":"13_CR46","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-3190-6","volume-title":"Symbolic Model Checking","author":"K.L. McMillan","year":"1993","unstructured":"McMillan, K.L.: Symbolic Model Checking. Kluwer Academic Publishers, Dordrecht (1993)"},{"issue":"1","key":"13_CR47","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/BF01384314","volume":"6","author":"K.L. McMillan","year":"1995","unstructured":"McMillan, K.L.: A technique of state space search based on unfolding. Formal Methods in System Design\u00a06(1), 45\u201365 (1995)","journal-title":"Formal Methods in System Design"},{"key":"13_CR48","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1007\/3-540-60045-0_50","volume-title":"Computer Aided Verification","author":"K.L. McMillan","year":"1995","unstructured":"McMillan, K.L.: Trace theoretic verification of asynchronous circuits using unfoldings. In: Wolper, P. (ed.) CAV 1995. LNCS, vol.\u00a0939, pp. 180\u2013195. Springer, Heidelberg (1995)"},{"key":"13_CR49","doi-asserted-by":"crossref","unstructured":"Melzer, S., R\u00f6mer, S.: Deadlock checking using net unfoldings. In: Grumberg [30], pp. 352\u2013363","DOI":"10.1007\/3-540-63166-6_35"},{"key":"13_CR50","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1007\/BFb0014349","volume-title":"Algebraic Methodology and Software Technology","author":"S. Melzer","year":"1996","unstructured":"Melzer, S., R\u00f6mer, S., Esparza, J.: Verification using PEP. In: Nivat, M., Wirsing, M. (eds.) AMAST 1996. LNCS, vol.\u00a01101, pp. 591\u2013594. Springer, Heidelberg (1996)"},{"issue":"1","key":"13_CR51","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0304-3975(81)90112-2","volume":"13","author":"M. Nielsen","year":"1981","unstructured":"Nielsen, M., Plotkin, G.D., Winskel, G.: Petri nets, event structures and domains. Theoretical Computer Science\u00a013(1), 85\u2013108 (1981)","journal-title":"Theoretical Computer Science"},{"key":"13_CR52","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/BF01783665","volume":"4","author":"M. Nielsen","year":"1990","unstructured":"Nielsen, M., Rozenberg, G., Thiagarajan, P.S.: Behavioural notions for elementary net systems. Distributed Computing\u00a04, 45\u201357 (1990)","journal-title":"Distributed Computing"},{"issue":"2","key":"13_CR53","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1006\/inco.1995.1062","volume":"118","author":"M. Nielsen","year":"1995","unstructured":"Nielsen, M., Rozenberg, G., Thiagarajan, P.S.: Transition systems, event structures and unfoldings. Information and Computation\u00a0118(2), 191\u2013207 (1995)","journal-title":"Information and Computation"},{"key":"13_CR54","series-title":"Lecture Notes in Computer Science","volume-title":"CONCUR 2000 - Concurrency Theory","year":"2000","unstructured":"Palamidessi, C. (ed.): CONCUR 2000. LNCS, vol.\u00a01877. Springer, Heidelberg (2000)"},{"key":"13_CR55","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/978-3-540-27813-9_9","volume-title":"Computer Aided Verification","author":"C. Schr\u00f6ter","year":"2004","unstructured":"Schr\u00f6ter, C., Khomenko, V.: Parallel LTL-X model checking of high-level Petri nets based on unfoldings. In: Alur, R., Peled, D.A. (eds.) CAV 2004. LNCS, vol.\u00a03114, pp. 109\u2013121. Springer, Heidelberg (2004)"},{"key":"13_CR56","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/3-540-44919-1_29","volume-title":"Applications and Theory of Petri Nets 2003","author":"C. Schr\u00f6ter","year":"2003","unstructured":"Schr\u00f6ter, C., Schwoon, S., Esparza, J.: The model-checking kit. In: van der Aalst, W.M.P., Best, E. (eds.) ICATPN 2003. LNCS, vol.\u00a02679, pp. 463\u2013472. Springer, Heidelberg (2003)"},{"key":"13_CR57","unstructured":"Stefan Schwoon. Mole \u2014 a Petri net unfolder, http:\/\/www.lsv.ens-cachan.fr\/~schwoon\/tools\/mole\/"},{"key":"13_CR58","doi-asserted-by":"crossref","unstructured":"Traonouez, L.-M., Grabiec, B., Jard, C., Lime, D., Roux, O.H.: Symbolic unfolding of parametric stopwatch petri nets. In: Proceedings of ATVA 2010 (to appear, 2010)","DOI":"10.1007\/978-3-642-15643-4_22"},{"key":"13_CR59","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)"},{"key":"13_CR60","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/3-540-17906-2_31","volume-title":"Advances in Petri Nets 1986. Proceedings of an Advanced Course, Bad Honnef, 8.-19. September 1986","author":"G. Winskel","year":"1987","unstructured":"Winskel, G.: Event structures. In: Brauer, W., Reisig, W., Rozenberg, G. (eds.) APN 1986. LNCS, vol.\u00a0255, pp. 325\u2013392. Springer, Heidelberg (1987)"},{"key":"13_CR61","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/BFb0013026","volume-title":"Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency","author":"G. Winskel","year":"1989","unstructured":"Winskel, G.: An introduction to event structures. In: de Bakker, J.W., de Roever, W.-P., Rozenberg, G. (eds.) Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency. LNCS, vol.\u00a0354, pp. 364\u2013397. Springer, Heidelberg (1989)"}],"container-title":["Lecture Notes in Computer Science","Model Checking Software"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16164-3_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,11]],"date-time":"2020-06-11T23:08:28Z","timestamp":1591916908000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16164-3_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642161636","9783642161643"],"references-count":61,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16164-3_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}