{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,2]],"date-time":"2025-11-02T16:20:07Z","timestamp":1762100407154},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540283096"},{"type":"electronic","value":"9783540319344"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11539452_27","type":"book-chapter","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T09:54:50Z","timestamp":1127814890000},"page":"338-352","source":"Crossref","is-referenced-by-count":7,"title":["Merged Processes \u2014 A New Condensed Representation of Petri Net Behaviour"],"prefix":"10.1007","author":[{"given":"Victor","family":"Khomenko","sequence":"first","affiliation":[]},{"given":"Alex","family":"Kondratyev","sequence":"additional","affiliation":[]},{"given":"Maciej","family":"Koutny","sequence":"additional","affiliation":[]},{"given":"Walter","family":"Vogler","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"27_CR1","volume-title":"Model Checking","author":"E.M. Clarke","year":"1999","unstructured":"Clarke, E.M., Grumberg, O., Peled, D.: Model Checking. MIT Press, Cambridge (1999)"},{"key":"27_CR2","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1109\/32.489078","volume":"22","author":"J.C. Corbett","year":"1996","unstructured":"Corbett, J.C.: Evaluating Deadlock Detection Methods for Concurrent Software. IEEE Transactions on Software Engineering\u00a022, 161\u2013180 (1996)","journal-title":"IEEE Transactions on Software Engineering"},{"key":"27_CR3","series-title":"Cambridge Tracts in Theoretical Computer Science","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511526558","volume-title":"Free Choice Petri Nets","author":"J. Desel","year":"1995","unstructured":"Desel, J., Esparza, J.: Free Choice Petri Nets. Cambridge Tracts in Theoretical Computer Science, vol.\u00a040. Cambridge University Press, Cambridge (1995)"},{"key":"27_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1007\/3-540-65306-6_20","volume-title":"Lectures on Petri Nets I: Basic Models","author":"J. Esparza","year":"1998","unstructured":"Esparza, J.: Decidability and Complexity of Petri Net Problems \u2014 an Introduction. In: Reisig, W., Rozenberg, G. (eds.) APN 1998. LNCS, vol.\u00a01491, pp. 374\u2013428. Springer, Heidelberg (1998)"},{"key":"27_CR5","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, 285\u2013310 (2002)","journal-title":"Formal Methods in System Design"},{"key":"27_CR6","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 Informatica\u00a037, 247\u2013268 (1999)","journal-title":"Fundamenta Informatica"},{"key":"27_CR7","doi-asserted-by":"crossref","unstructured":"Khomenko, V.: Model Checking Based on Prefixes of Petri Net Unfoldings. PhD Thesis, School of Computing Science, University of Newcastle upon Tyne (2003)","DOI":"10.1007\/s00236-003-0122-y"},{"key":"27_CR8","doi-asserted-by":"crossref","unstructured":"Khomenko, V., Kondratyev, A., Koutny, M., Vogler, V.: Merged Processes \u2014 a New Condensed Representation of Petri Net Behaviour. Technical Report CS-TR-884, School of Computing Science, University of Newcastle (2005), http:\/\/homepages.cs.ncl.ac.uk\/victor.khomenko\/home.formal\/papers\/CS-TR-884.pdf","DOI":"10.1007\/11539452_27"},{"key":"27_CR9","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, V.: Canonical Prefixes of Petri Net Unfoldings. Acta Informatica\u00a040, 95\u2013118 (2003)","journal-title":"Acta Informatica"},{"key":"27_CR10","first-page":"221","volume":"62","author":"V. Khomenko","year":"2004","unstructured":"Khomenko, V., Koutny, M., Yakovlev, A.: Detecting State Coding Conflicts in STG Unfoldings Using SAT. Fundamenta Informatica\u00a062, 221\u2013241 (2004)","journal-title":"Fundamenta Informatica"},{"key":"27_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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 State Explosion Problem in the Verification of Asynchronous Circuits. In: Probst, D.K., von Bochmann, G. (eds.) CAV 1992. LNCS, vol.\u00a0663, pp. 164\u2013174. Springer, Heidelberg (1993)"},{"key":"27_CR12","unstructured":"McMillan, K.L.: Symbolic Model Checking: an Approach to the State Explosion Problem. PhD thesis, CMU-CS-92-131 (1992)"},{"key":"27_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"352","DOI":"10.1007\/3-540-63166-6_35","volume-title":"Computer Aided Verification","author":"S. Melzer","year":"1997","unstructured":"Melzer, S., R\u00f6mer, S.: Deadlock Checking Using Net Unfoldings. In: Grumberg, O. (ed.) CAV 1997. LNCS, vol.\u00a01254, pp. 352\u2013363. Springer, Heidelberg (1997)"},{"key":"27_CR14","doi-asserted-by":"crossref","unstructured":"Moskewicz, S., Madigan, C., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engineering an Efficient SAT Solver. In: Proc. of DAC 2001, pp. 530\u2013535. ASME Tech. Publ (2001)","DOI":"10.1145\/378239.379017"},{"key":"27_CR15","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1109\/5.24143","volume":"77","author":"T. Murata","year":"1989","unstructured":"Murata, T.: Petri Nets: Properties, Analysis and Applications. Proceedings of the IEEE\u00a077, 541\u2013580 (1989)","journal-title":"Proceedings of the IEEE"},{"key":"27_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1007\/3-540-65306-6_21","volume-title":"Lectures on Petri Nets I: Basic Models","author":"A. Valmari","year":"1998","unstructured":"Valmari, A.: The State Explosion Problem. In: Reisig, W., Rozenberg, G. (eds.) APN 1998. LNCS, vol.\u00a01491, pp. 429\u2013528. Springer, Heidelberg (1998)"}],"container-title":["Lecture Notes in Computer Science","CONCUR 2005 \u2013 Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11539452_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,9]],"date-time":"2020-04-09T18:42:47Z","timestamp":1586457767000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11539452_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540283096","9783540319344"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/11539452_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}