{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:26:25Z","timestamp":1761611185915},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540648963"},{"type":"electronic","value":"9783540684558"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0055644","type":"book-chapter","created":{"date-parts":[[2006,7,27]],"date-time":"2006-07-27T03:31:00Z","timestamp":1153971060000},"page":"501-516","source":"Crossref","is-referenced-by-count":41,"title":["Unfolding and finite prefix for nets with read arcs"],"prefix":"10.1007","author":[{"given":"Walter","family":"Vogler","sequence":"first","affiliation":[]},{"given":"Alex","family":"Semenov","sequence":"additional","affiliation":[]},{"given":"Alex","family":"Yakovlev","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,5,28]]},"reference":[{"key":"33_CR1","doi-asserted-by":"crossref","unstructured":"P. Baldan, A. Corradini and U. Montanari. An event structure semantics for P\/T contextual nets: asymmetric event structures. to appear in Proc. FoSSaCS'98, April 1998, Lisbon.","DOI":"10.1007\/BFb0053542"},{"key":"33_CR2","doi-asserted-by":"crossref","unstructured":"N. Busi and R. Gorrieri. A Petri net semantics for \u03c0-calculus. In L. Insup and S. Smolka, editors, CONCUR 95, Lect. Notes Comp. Sci. 962, 145\u2013159. Springer, 1995.","DOI":"10.1007\/3-540-60218-6_11"},{"key":"33_CR3","unstructured":"N. Busi and M. Pinna. Non-sequential semantics for contextual P\/T-nets. In J. Billington and W. Reisig, editors, Applications and Theory of Petri Nets 1996, Lect. Notes Comp. Sci. 1091, 113\u2013132. Springer, 1996."},{"key":"33_CR4","doi-asserted-by":"crossref","unstructured":"S. Christensen and N.D. Hansen. Coloured Petri nets extended with place capacities, test arcs, and inhibitor arcs. In M. Ajmone-Marsan, editor, Applications and Theory of Petri Nets 1993, Lect. Notes Comp. Sci. 691, 186\u2013205. Springer, 1993.","DOI":"10.1007\/3-540-56863-8_47"},{"key":"33_CR5","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":"33_CR6","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0304-3975(95)00119-0","volume":"153","author":"J. Esparza","year":"1996","unstructured":"J. Esparza and G. Bruns. Trapping mutual exclusion in the box calculus. Theor. Comput. Sci., 153:95\u2013128, 1996.","journal-title":"Theor. Comput. Sci."},{"key":"33_CR7","unstructured":"J. Esparza and S. Melzer. Model Checking LTL Using Constraint Programming In P. Azema and G. Balbo, editors, Applications and Theory of Petri Nets 1997, Lect. Notes Comp. Sci. 1248, 1\u201320. Springer, 1997."},{"key":"33_CR8","doi-asserted-by":"crossref","unstructured":"J. Esparza, S. R\u00f6mer, and W. Vogler. An improvement of McMillan's unfolding algorithm. In T. Margaria and B. Steffen, editors, TACAS 96, Lect. Notes Comp. Sci. 1055, 87\u2013106. Springer, 1996.","DOI":"10.1007\/3-540-61042-1_40"},{"key":"33_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.1995.1153","volume":"123","author":"R. Janicki","year":"1995","unstructured":"R. Janicki and M. Koutny. Semantics of inhibitor nets. Information and Computation, 123:1\u201316, 1995.","journal-title":"Information and Computation"},{"key":"33_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-3190-6","volume-title":"Symbolic Model Checking","author":"K.L. McMillan","year":"1993","unstructured":"K.L. McMillan. Symbolic Model Checking. Kluwer Academic Publishers, Boston, 1993."},{"key":"33_CR11","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1007\/BF01178907","volume":"32","author":"U. Montanari","year":"1995","unstructured":"U. Montanari and F. Rossi. Contextual nets. Acta Informatica, 32:545\u2013596, 1995.","journal-title":"Acta Informatica"},{"key":"33_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.D. Plotkin, and G. Winskel. Petri nets, event structures and domains I. Theor. Comput. Sci., 13:85\u2013108, 1981.","journal-title":"Theor. Comput. Sci."},{"key":"33_CR13","unstructured":"A. Semenov and A. Yakovlev. Contextual net unfolding and asynchronous circuit verification Technical Report Series No. 572, Computing Science, University of Newcastle upon Tyne, April 1997. See http:\/\/www.cs.ncl.ac.uk\/research\/trs\/lists\/97.html."},{"key":"33_CR14","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0304-3975(91)90084-F","volume":"91","author":"W. Vogler","year":"1991","unstructured":"W. Vogler. Executions: A New Partial Order Semantics of Petri Nets. Theor. Comput. Sci., 91:205\u2013238, 1991.","journal-title":"Theor. Comput. Sci."},{"key":"33_CR15","doi-asserted-by":"crossref","unstructured":"W. Vogler. Partial order semantics and read arcs. Technical Report 1997-1, Inst. f. Informatik, Univ. Augsburg, 1997. See http:\/\/www.math.uni-augsburg.de\/~vogler\/; extended abstract in MFCS 97, LNCS 1295, 508\u2013517.","DOI":"10.1007\/BFb0029994"},{"key":"33_CR16","doi-asserted-by":"crossref","unstructured":"W. Vogler, A. Semenov and A. Yakovlev. Unfolding and finite prefix for nets with read arcs. Technical Report Series No. 634, Computing Science, University of Newcastle upon Tyne, February 1998 (can be obtained from: ftp:\/\/sadko.ncl.ac.uk\/pub\/incoming\/TRs\/).","DOI":"10.1007\/BFb0055644"},{"key":"33_CR17","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/S0167-9260(96)00010-7","volume":"21","author":"A. Yakovlev","year":"1996","unstructured":"A. Yakovlev, A.M. Koelmans, A. Semenov and D.J. Kinniment. Modelling, analysis and synthesis of asynchronous control circuits using Petri nets. INTEGRATION: the VLSI Journal, 21:143\u2013170, 1996.","journal-title":"INTEGRATION: the VLSI Journal"}],"container-title":["Lecture Notes in Computer Science","CONCUR'98 Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0055644","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,20]],"date-time":"2019-04-20T04:28:58Z","timestamp":1555734538000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0055644"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540648963","9783540684558"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/bfb0055644","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}