{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T08:46:46Z","timestamp":1759826806335},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540008989"},{"type":"electronic","value":"9783540365778"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-36577-x_34","type":"book-chapter","created":{"date-parts":[[2010,3,29]],"date-time":"2010-03-29T21:12:04Z","timestamp":1269897124000},"page":"458-472","source":"Crossref","is-referenced-by-count":19,"title":["Branching Processes of High-Level Petri Nets"],"prefix":"10.1007","author":[{"given":"Victor","family":"Khomenko","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maciej","family":"Koutny","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,2,28]]},"reference":[{"key":"34_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1007\/3-540-60029-9_36","volume-title":"ICATPN\u20191995","author":"E. Best","year":"1995","unstructured":"E. Best, H. Fleischhack, W. Fraczak, R. Hopkins, H. Klaudel, and E. Pelz: A Class of Composable High Level Petri Nets. ICATPN\u20191995, LNCS 935 (1995) 103\u2013120."},{"key":"34_CR2","series-title":"Lect Notes Comput Sci","first-page":"397","volume-title":"TACAS\u201996","author":"E. Best","year":"1996","unstructured":"E. Best and B. Grahlmann: PEP \u2014 more than a Petri Net Tool. TACAS\u201996, LNCS 1055 (1996) 397\u2013401."},{"key":"34_CR3","unstructured":"A. Bystrov and A. Yakovlev: Asynchronous Circuit Synthesis by Direct Mapping: Interfacing to Environment. ASYNC\u201902, IEEE Comp. Soc. Press (2002) 127\u2013136."},{"key":"34_CR4","unstructured":"E. M. Clarke, O. Grumberg, and D. Peled: Model Checking. MIT Press (1999)."},{"key":"34_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/3-540-45740-2_9","volume-title":"ICATPN\u20192001","author":"J.-M. Couvreur","year":"2001","unstructured":"J.-M. Couvreur, S. Grivet, and Denis Poitrenaud: Unfolding of Products of Symmetrical Petri Nets. ICATPN\u20192001, LNCS 2075 (2001) 121\u2013143."},{"key":"34_CR6","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 Inf. 28 (1991) 575\u2013591.","journal-title":"Acta Inf."},{"key":"34_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1007\/3-540-48320-9_2","volume-title":"CONCUR\u201999","author":"J. Esparza","year":"1999","unstructured":"J. Esparza and S. R\u00f6mer: An Unfolding Algorithm for Synchronous Products of Transition Systems. CONCUR\u201999, LNCS 1664 (1999) 2\u201320."},{"key":"34_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/3-540-61042-1_40","volume-title":"TACAS\u201996","author":"J. Esparza","year":"1996","unstructured":"J. Esparza, S. R\u00f6mer and W. Vogler: An Improvement of McMillan\u2019s Unfolding Algorithm. TACAS\u201996, LNCS 1055 (1996) 87\u2013106. Full version: Formal Methods in System Design 20(3) (2002) 285-310."},{"key":"34_CR9","unstructured":"H. Fleischhack, B. Grahlmann: A Petri Net Semantics for B(PN)2 with Procedures. PDSE\u201997, IEEE Computer Society Press (1997) 15\u201327."},{"key":"34_CR10","unstructured":"K. Heljanko: Minimizing Finite Complete Prefixes. CS&P\u201999, Workshop Concurrency, Specification and Programming (1999) 83\u201395."},{"issue":"3","key":"34_CR11","first-page":"247","volume":"37","author":"K. Heljanko","year":"1999","unstructured":"K. Heljanko: Using Logic Programs with Stable Model Semantics to Solve Deadlock and Reachability Problems for 1-Safe Petri Nets. Fund. Inf. 37(3) (1999) 247\u2013268.","journal-title":"Fund. Inf."},{"key":"34_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1007\/3-540-46002-0_26","volume-title":"TACAS\u201902","author":"K. Heljanko","year":"2002","unstructured":"K. Heljanko, V. Khomenko and M. Koutny: Parallelisation of the Petri Net Unfolding Algorithm. TACAS\u201902, LNCS 2280 (2002) 371\u2013385."},{"key":"34_CR13","doi-asserted-by":"crossref","unstructured":"K. Jensen: Colored Petri Nets. Basic Concepts, Analysis Methods and Practical Use. EATCS Monographs on Theoretical Computer Science (1992).","DOI":"10.1007\/978-3-662-06289-0"},{"key":"34_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"410","DOI":"10.1007\/3-540-44618-4_30","volume-title":"CONCUR\u20192000","author":"V. Khomenko","year":"2000","unstructured":"V. Khomenko and M. Koutny: LP Deadlock Checking Using Partial Order Dependencies. CONCUR\u20192000, LNCS 1877 (2000) 410\u2013425."},{"key":"34_CR15","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"366","DOI":"10.1007\/3-540-44685-0_25","volume-title":"CONCUR\u20192001","author":"V. Khomenko","year":"2001","unstructured":"V. Khomenko and M. Koutny: Towards An Efficient Algorithm for Unfolding Petri Nets. CONCUR\u20192001, LNCS 2154 (2001) 366\u2013380."},{"key":"34_CR16","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"582","DOI":"10.1007\/3-540-45657-0_49","volume-title":"CAV\u201902","author":"V. Khomenko","year":"2002","unstructured":"V. Khomenko, M. Koutny, and V. Vogler: Canonical Prefixes of Petri Net Unfoldings. CAV\u201902, LNCS 2404 (2002) 582\u2013595."},{"key":"34_CR17","unstructured":"V. Khomenko and M. Koutny: Branching Processes of High-Level Petri Nets.Techn. Rep. CS-TR-763, Department of Computing Science, University of Newcastle (2002)."},{"key":"34_CR18","unstructured":"V. E. Kozura: Unfolding of Colored Petri Nets. Techn. Rep. 80, A. P. Ershov Institute of Informatics Systems (2000)."},{"issue":"1","key":"34_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/7351.7352","volume":"5","author":"L. Lamport","year":"1987","unstructured":"L. Lamport: A Fast Mutual Exclusion Algorithm. ACM Transactions on Computer Systems 5(1) (1987) 1\u201311.","journal-title":"ACM Transactions on Computer Systems"},{"key":"34_CR20","series-title":"Lect Notes Comput Sci","first-page":"164","volume-title":"CAV\u201992","author":"K. L. McMillan","year":"1992","unstructured":"K. L. McMillan: Using Unfoldings to Avoid State Explosion Problem in the Verification of Asynchronous Circuits. CAV\u201992, LNCS 663 (1992) 164\u2013174."},{"key":"34_CR21","doi-asserted-by":"crossref","unstructured":"K. L. McMillan: Symbolic Model Checking. PhD thesis, CMU-CS-92-131 (1992).","DOI":"10.1007\/978-1-4615-3190-6"},{"key":"34_CR22","unstructured":"S. R\u00f6mer: Entwicklung und Implementierung von Verifikationstechniken auf der Basis von Netzentfaltungen. PhD thesis, Technische Universitat Munchen (2000)."},{"key":"34_CR23","doi-asserted-by":"crossref","unstructured":"A. Semenov: Verification and Synthesis of Asynchronous Control Circuits Using Petri Net Unfolding. PhD Thesis, University of Newcastle upon Tyne (1997).","DOI":"10.1145\/240518.240530"}],"container-title":["Lecture Notes in Computer Science","Tools and Algorithms for the Construction and Analysis of Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36577-X_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T18:49:47Z","timestamp":1558982987000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36577-X_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540008989","9783540365778"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/3-540-36577-x_34","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}