{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:10:24Z","timestamp":1725495024800},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540422525"},{"type":"electronic","value":"9783540457404"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45740-2_9","type":"book-chapter","created":{"date-parts":[[2007,11,15]],"date-time":"2007-11-15T15:30:51Z","timestamp":1195140651000},"page":"121-143","source":"Crossref","is-referenced-by-count":9,"title":["Unfolding of Products of Symmetrical Petri Nets"],"prefix":"10.1007","author":[{"given":"Jean-Michel","family":"Couvreur","sequence":"first","affiliation":[]},{"given":"S\u00e9bastien","family":"Grivet","sequence":"additional","affiliation":[]},{"given":"Denis","family":"Poitrenaud","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,6,28]]},"reference":[{"issue":"11","key":"9_CR1","doi-asserted-by":"publisher","first-page":"1343","DOI":"10.1109\/12.247838","volume":"42","author":"G. Chiola","year":"1993","unstructured":"G. Chiola, C. Dutheillet, G. Franceschinis, and S. Haddad. Well-formed colored nets and symmetric modeling applications. IEEE Transactions on Computers, 42(11):1343\u20131360, 1993.","journal-title":"IEEE Transactions on Computers"},{"key":"9_CR2","series-title":"Lect Notes Comput Sci","first-page":"364","volume-title":"Proc. of ICATPN\u20192000","author":"J.-M. Couvreur","year":"2000","unstructured":"J.-M. Couvreur, S. Grivet, and D. Poitrenaud. Designing a LTL model-checker based on unfolding graphs. In Proc. of ICATPN\u20192000, volume 1825 of Lecture Notes in Computer Science, pages 364\u2013383. Springer Verlag, 2000."},{"key":"9_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1007\/3-540-48745-X_22","volume-title":"Proc. of ICATPN\u201999","author":"J.-M. Couvreur","year":"1999","unstructured":"J.-M. Couvreur and D. Poitrenaud. Detection ofillegal behaviours based on unfoldings. In Proc. of ICATPN\u201999, volume 1639 of Lecture Notes in Computer Science, pages 364\u2013383. Springer Verlag, 1999."},{"key":"9_CR4","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1007\/BF01463946","volume":"28","author":"J. Engelfriet","year":"1991","unstructured":"J. Engelfriet. Branching processes of Petri nets. Acta Informatica, 28:575\u2013591, 1991.","journal-title":"Acta Informatica"},{"key":"9_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"613","DOI":"10.1007\/3-540-56610-4_93","volume-title":"Proc. of TAPSOFT\u201993","author":"J. Esparza","year":"1993","unstructured":"J. Esparza. Model checking using net unfoldings. In Proc. of TAPSOFT\u201993, volume 668 of Lecture Notes in Computer Science, pages 613\u2013628. Springer Verlag, 1993."},{"key":"9_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1007\/3-540-45022-X_40","volume-title":"Proceedings of ICALP\u20192000","author":"J. Esparza","year":"2000","unstructured":"J. Esparza and K. Heljanko. A new unfolding approach to LTL model checking. In Proceedings of ICALP\u20192000, number 1853 in LNCS, pages 475\u2013486. Springer-Verlag, 2000."},{"key":"9_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1007\/3-540-48320-9_2","volume-title":"Proceedings of CONCUR\u201999","author":"J. Esparza","year":"1999","unstructured":"J. Esparza and S. R\u00f6mer. An unfolding algorithm for synchronous products of transition system. In Proceedings of CONCUR\u201999, number 1664 in LNCS, pages 2\u201320. Springer-Verlag, 1999."},{"key":"9_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/3-540-61042-1_40","volume-title":"Proc. of TACAS\u201996","author":"J. Esparza","year":"1996","unstructured":"J. Esparza, S. R\u00f6mer, and W. Vogler. An improvement ofMcMillan\u2019s unfolding algorithm. In Proc. of TACAS\u201996, volume 1055 of Lecture Notes in Computer Science, pages 87\u2013106. Springer Verlag, 1996."},{"key":"9_CR9","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/978-0-387-35533-7_8","volume-title":"Formal Methods for Distributed System Development","author":"S. Haddad","year":"2000","unstructured":"S. Haddad, J.-M. Ili\u00e9, and K. Ajami. A model checking method for partially symmetric systems. In Formal Methods for Distributed System Development, Proc. of FORTE\/PSTV\u20192000, pages 121\u2013136, Pisa, Italy, October 2000. Kluwer Academic Publishers."},{"key":"9_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1007\/3-540-48683-6_18","volume-title":"Proceedings of the 11th International Conference on Computer Aided Verification","author":"R. Langerak","year":"1999","unstructured":"R. Langerak and E. Brinksma. A complete finite prefix for process algebra. In Proceedings of the 11th International Conference on Computer Aided Verification, Italy, number 1633 in LNCS, pages 184\u2013195. Springer, 1999."},{"key":"9_CR11","series-title":"Lect Notes Comput Sci","first-page":"164","volume-title":"Proc. of the 4th Conference on Computer Aided Verification","author":"K.L. McMillan","year":"1992","unstructured":"K.L. McMillan. Using unfoldings to avoid the state explosion problem in the verification ofasync hronous circuits. In Proc. of the 4th Conference on Computer Aided Verification, volume 663 of Lecture Notes in Computer Science, pages 164\u2013175. Springer Verlag, 1992."},{"issue":"1","key":"9_CR12","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0304-3975(81)90112-2","volume":"13","author":"M. Nielsen","year":"1981","unstructured":"M. Nielsen, G. Plotkin, and G. Winskel. Petri nets, events structures and domains, part I. Theoretical Computer Science, 13(1):85\u2013108, 1981.","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Applications and Theory of Petri Nets 2001"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45740-2_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T14:58:22Z","timestamp":1551106702000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45740-2_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540422525","9783540457404"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-45740-2_9","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}