{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T08:42:03Z","timestamp":1759826523069,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642218330"},{"type":"electronic","value":"9783642218347"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-21834-7_6","type":"book-chapter","created":{"date-parts":[[2011,6,27]],"date-time":"2011-06-27T22:04:11Z","timestamp":1309212251000},"page":"89-108","source":"Crossref","is-referenced-by-count":10,"title":["An Algorithm for Direct Construction of Complete Merged Processes"],"prefix":"10.1007","author":[{"given":"Victor","family":"Khomenko","sequence":"first","affiliation":[]},{"given":"Andrey","family":"Mokhov","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"6_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/978-3-540-89287-8_12","volume-title":"Transactions on Petri Nets and Other Models of Concurrency I","author":"P. Baldan","year":"2008","unstructured":"Baldan, P., Corradini, A., K\u00f6nig, B., Schwoon, S.: McMillan\u2019s complete prefix for contextual nets. In: Jensen, K., van der Aalst, W.M.P., Billington, J. (eds.) Transactions on Petri Nets and Other Models of Concurrency I. LNCS, vol.\u00a05100, pp. 199\u2013220. Springer, Heidelberg (2008)"},{"key":"6_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1007\/978-3-540-30232-2_21","volume-title":"Formal Techniques for Networked and Distributed Systems \u2013 FORTE 2004","author":"T. Chatain","year":"2004","unstructured":"Chatain, T., Jard, C.: Symbolic diagnosis of partially observable concurrent systems. In: de Frutos-Escrig, D., N\u00fa\u00f1ez, M. (eds.) FORTE 2004. LNCS, vol.\u00a03235, pp. 326\u2013342. Springer, Heidelberg (2004)"},{"key":"6_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/11767589_8","volume-title":"Petri Nets and Other Models of Concurrency - ICATPN 2006","author":"T. Chatain","year":"2006","unstructured":"Chatain, T., Jard, C.: Complete finite prefixes of symbolic unfoldings of safe time Petri nets. In: Donatelli, S., Thiagarajan, P.S. (eds.) ICATPN 2006. LNCS, vol.\u00a04024, pp. 125\u2013145. Springer, Heidelberg (2006)"},{"key":"6_CR4","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 Trans. Softw. Eng.\u00a022, 161\u2013180 (1996)","journal-title":"IEEE Trans. Softw. Eng."},{"key":"6_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/978-3-540-24605-3_37","volume-title":"Theory and Applications of Satisfiability Testing","author":"N. E\u00e9n","year":"2004","unstructured":"E\u00e9n, N., S\u00f6rensson, N.: An extensible SAT-solver. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol.\u00a02919, pp. 333\u2013336. Springer, Heidelberg (2004)"},{"key":"6_CR6","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1007\/BF01463946","volume":"28","author":"J. Engelfriet","year":"1991","unstructured":"Engelfriet, J.: Branching processes of Petri nets. Acta Inf.\u00a028, 575\u2013591 (1991)","journal-title":"Acta Inf."},{"key":"6_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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":"6_CR8","series-title":"EATCS Monographs in Theoretical Computer Science","volume-title":"Unfoldings \u2013 A Partial-Order Approach to Model Checking","author":"J. Esparza","year":"2008","unstructured":"Esparza, J., Heljanko, K.: Unfoldings \u2013 A Partial-Order Approach to Model Checking. EATCS Monographs in Theoretical Computer Science. Springer, Heidelberg (2008)"},{"issue":"3","key":"6_CR9","first-page":"285","volume":"20","author":"J. Esparza","year":"2002","unstructured":"Esparza, J., R\u00f6mer, S., Vogler, W.: An improvement of McMillan\u2019s unfolding algorithm. FMSD\u00a020(3), 285\u2013310 (2002)","journal-title":"FMSD"},{"unstructured":"Heljanko, K.: Minimizing finite complete prefixes. In: Proc. CS&P 1999, pp. 83\u201395 (1999)","key":"6_CR10"},{"key":"6_CR11","first-page":"247","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. Fund. Inf.\u00a037, 247\u2013268 (1999)","journal-title":"Fund. Inf."},{"doi-asserted-by":"crossref","unstructured":"Khomenko, V.: Model Checking Based on Prefixes of Petri Net Unfoldings. Ph.D. thesis, School of Comp. Sci., Newcastle Univ. (2003)","key":"6_CR12","DOI":"10.1007\/3-540-45657-0_49"},{"issue":"5","key":"6_CR13","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/s00236-006-0023-y","volume":"43","author":"V. Khomenko","year":"2006","unstructured":"Khomenko, V., Kondratyev, A., Koutny, M., Vogler, W.: Merged processes \u2014 a new condensed representation of Petri net behaviour. Acta Inf.\u00a043(5), 307\u2013330 (2006)","journal-title":"Acta Inf."},{"issue":"2","key":"6_CR14","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 Inf.\u00a040(2), 95\u2013118 (2003)","journal-title":"Acta Inf."},{"doi-asserted-by":"crossref","unstructured":"Khomenko, V., Mokhov, A.: An algorithm for direct construction of complete merged processes. Tech. Rep. CS-TR-1231, School of Comp. Sci., Newcastle Univ. (2011), http:\/\/www.cs.ncl.ac.uk\/publications\/trs\/papers\/1231.pdf","key":"6_CR15","DOI":"10.1007\/978-3-642-21834-7_6"},{"doi-asserted-by":"crossref","unstructured":"McMillan, K.: Symbolic Model Checking: an Approach to the State Explosion Problem. Ph.D. thesis, School of Comp. Sci., Carnegie Mellon Univ. (1992)","key":"6_CR16","DOI":"10.1007\/978-1-4615-3190-6_3"},{"key":"6_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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":"6_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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)"},{"unstructured":"MINISAT tool home page, http:\/\/minisat.se","key":"6_CR19"},{"doi-asserted-by":"crossref","unstructured":"Moskewicz, S., Madigan, C., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engineering an efficient SAT solver. In: Proc. DAC 2001, pp. 530\u2013535. ASME Technical Publishing (2001)","key":"6_CR20","DOI":"10.1145\/378239.379017"},{"issue":"4","key":"6_CR21","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. Proc. of the IEEE\u00a077(4), 541\u2013580 (1989)","journal-title":"Proc. of the IEEE"},{"unstructured":"PUNF home page, http:\/\/homepages.cs.ncl.ac.uk\/victor.khomenko\/tools\/punf","key":"6_CR22"},{"key":"6_CR23","volume-title":"Proc. SAT 2004","author":"D. Ranjan","year":"2004","unstructured":"Ranjan, D., Tang, D., Malik, S.: A comparative study of 2QBF algorithms. In: SAT 2004, ACM, New York (2004)"},{"issue":"1","key":"6_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(76)90061-X","volume":"3","author":"L.J. Stockmeyer","year":"1976","unstructured":"Stockmeyer, L.J.: The polynomial-time hierarchy. Theor. Comp. Sci.\u00a03(1), 1\u201322 (1976)","journal-title":"Theor. Comp. Sci."},{"key":"6_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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)"},{"key":"6_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/BFb0055644","volume-title":"CONCUR \u201998 Concurrency Theory","author":"W. Vogler","year":"1998","unstructured":"Vogler, W., Semenov, A., Yakovlev, A.: Unfolding and finite prefix for nets with read arcs. In: Sangiorgi, D., de Simone, R. (eds.) CONCUR 1998. LNCS, vol.\u00a01466, pp. 501\u2013516. Springer, Heidelberg (1998)"},{"key":"6_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"582","DOI":"10.1007\/3-540-45657-0_2","volume-title":"Computer Aided Verification","author":"L. Zhang","year":"2002","unstructured":"Zhang, L., Malik, S.: The quest for efficient Boolean satisfiability solvers. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol.\u00a02404, pp. 582\u2013595. Springer, Heidelberg (2002)"}],"container-title":["Lecture Notes in Computer Science","Applications and Theory of Petri Nets"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21834-7_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,12]],"date-time":"2019-06-12T08:24:51Z","timestamp":1560327891000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21834-7_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642218330","9783642218347"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21834-7_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}