{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T08:45:17Z","timestamp":1759826717863},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540430759"},{"type":"electronic","value":"9783540455752"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45575-2_27","type":"book-chapter","created":{"date-parts":[[2007,5,30]],"date-time":"2007-05-30T21:30:22Z","timestamp":1180560622000},"page":"268-278","source":"Crossref","is-referenced-by-count":5,"title":["Unfoldings of Coloured Petri Nets"],"prefix":"10.1007","author":[{"given":"Vitaly E.","family":"Kozura","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,12,18]]},"reference":[{"key":"27_CR1","doi-asserted-by":"crossref","unstructured":"B. Bieber, H. Fleischhack Model Checking of Time Petri Nets Based on Partial Order Semantics. Proc. CONCUR\u201999.\u2014 Berlin a.o.: Springer-Verlag, 210\u2013225 (1999).","DOI":"10.1007\/3-540-48320-9_16"},{"key":"27_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/3-540-44988-4_9","volume-title":"Designing an LTL Model-Checker Based on Unfolding Graphs","author":"J.-M. Couvreur","year":"2000","unstructured":"J.-M. Couvreur, S. Grivet, D. Poitrenaud: Designing an LTL Model-Checker Based on Unfolding Graphs. Lecture Notes in Computer Science, Vol.1825, 123\u2013145 (2000)."},{"key":"27_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"613","DOI":"10.1007\/3-540-56610-4_93","volume-title":"Model-Checking Using Net Unfoldings","author":"J. Esparza","year":"1993","unstructured":"J. Esparza: Model-Checking Using Net Unfoldings. Lecture Notes in Computer Science Vol.668, 613\u2013628 (1993)."},{"key":"27_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1007\/3-540-45022-X_40","volume-title":"A New Unfolding Approach to LTL Model-Checking","author":"J. Esparza","year":"2000","unstructured":"J. Esparza J, K. Heljanko: A New Unfolding Approach to LTL Model-Checking. Lecture Notes in Computer Science Vol.1853, 475\u2013486 (2000)."},{"key":"27_CR5","first-page":"87","volume-title":"An Improvement of McMillan\u2019s Unfolding Algorithm Proc. TACAS\u201996","author":"J. Esparza","year":"1997","unstructured":"J. Esparza, S. Romer, W. Vogler: An Improvement of McMillan\u2019s Unfolding Algorithm Proc. TACAS\u201996.\u2014 Berlin a.o.: Springer-Verlag, pp. 87\u2013106 (1997)."},{"key":"27_CR6","volume-title":"Coloured Petri Nets","author":"K. Jensen","year":"1995","unstructured":"K. Jensen: Coloured Petri Nets. Vol. 1. Berlin a.o.: Springer, (1995)."},{"key":"27_CR7","volume-title":"Coloured Petri Nets","author":"K. Jensen","year":"1995","unstructured":"K. Jensen: Coloured Petri Nets. Vol. 2. Berlin a.o.: Springer, (1995)."},{"key":"27_CR8","unstructured":"A. Kondratyev, M. Kishinevsky, A. Taubin, S. Ten: A Structural Approach for the Analysis of Petri Nets by Reduced Unfoldings. 17th Intern. Conf. on Application and Theory of Petri Nets, Osaka, June 1996. Berlin a.o.: Springer-Verlag, 346\u2013365 (1996)."},{"key":"27_CR9","doi-asserted-by":"crossref","unstructured":"V.E. Kozura: Unfoldings of Coloured Petri Nets. Tech. Rep. N 80, Novosibirsk 34 pages (2000).","DOI":"10.1007\/3-540-45575-2_27"},{"key":"27_CR10","doi-asserted-by":"crossref","unstructured":"V.E. Kozura: Unfoldings of Timed Coloured Petri Nets. Tech. Rep. N 82, Novosibirsk 33 pages (2001).","DOI":"10.1007\/3-540-45575-2_27"},{"key":"27_CR11","doi-asserted-by":"crossref","unstructured":"S. Melzer, S. Romer: Deadlock Checking Using Net Unfoldings. Proc. of the Conf. on Computer Aided Verification (CAV\u201997), Haifa, pp. 352\u2013363 (1997).","DOI":"10.1007\/3-540-63166-6_35"},{"key":"27_CR12","series-title":"Lect Notes Comput Sci","first-page":"164","volume-title":"Using Unfolding to Avoid the State Explosion Problem in the Verification of Asynchronous Circuits","author":"K.L. McMillan","year":"1992","unstructured":"K.L. McMillan: Using Unfolding to Avoid the State Explosion Problem in the Verification of Asynchronous Circuits. Lecture Notes in Computer Science Vol.663, 164\u2013174 (1992)."},{"key":"27_CR13","unstructured":"A. Valmari: Stubborn Sets of Coloured Petri Nets. Proc. of the 12th Intern. Conf. On Application and Theory of Petri Nets.\u2014 Gjern, 102\u2013121 (1991)."},{"key":"27_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1007\/3-540-65306-6_21","volume-title":"The State Explosion Problem","author":"A. Valmari","year":"1998","unstructured":"A. Valmari: The State Explosion Problem. Lecture Notes in Computer Science Vol.1491, 429\u2013528 (1998)."}],"container-title":["Lecture Notes in Computer Science","Perspectives of System Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45575-2_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,11]],"date-time":"2023-05-11T22:46:04Z","timestamp":1683845164000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45575-2_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540430759","9783540455752"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-45575-2_27","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}