{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T18:04:09Z","timestamp":1725732249675},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642386961"},{"type":"electronic","value":"9783642386978"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38697-8_3","type":"book-chapter","created":{"date-parts":[[2013,6,19]],"date-time":"2013-06-19T01:48:46Z","timestamp":1371606526000},"page":"29-48","source":"Crossref","is-referenced-by-count":6,"title":["Contextual Merged Processes"],"prefix":"10.1007","author":[{"given":"C\u00e9sar","family":"Rodr\u00edguez","sequence":"first","affiliation":[]},{"given":"Stefan","family":"Schwoon","sequence":"additional","affiliation":[]},{"given":"Victor","family":"Khomenko","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"3_CR1","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/j.tcs.2012.04.046","volume":"449","author":"P. Baldan","year":"2012","unstructured":"Baldan, P., Bruni, A., Corradini, A., K\u00f6nig, B., Rodr\u00edguez, C., Schwoon, S.: Efficient unfolding of contextual Petri nets. Theo. Comp. Sci.\u00a0449, 2\u201322 (2012)","journal-title":"Theo. Comp. Sci."},{"key":"3_CR2","doi-asserted-by":"crossref","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.) ToPNoC I, LNCS, vol.\u00a05100, pp. 199\u2013220. Springer, Heidelberg (2008)","DOI":"10.1007\/978-3-540-89287-8_12"},{"issue":"1","key":"3_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.2001.3060","volume":"171","author":"P. Baldan","year":"2001","unstructured":"Baldan, P., Corradini, A., Montanari, U.: Contextual Petri nets, asymmetric event structures, and processes. Inf. Comput.\u00a0171(1), 1\u201349 (2001)","journal-title":"Inf. Comput."},{"key":"3_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 Transactions on Software Engineering\u00a022, 161\u2013180 (1996)","journal-title":"IEEE Transactions on Software Engineering"},{"issue":"9","key":"3_CR5","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1145\/365559.365617","volume":"8","author":"E.W. Dijkstra","year":"1965","unstructured":"Dijkstra, E.W.: Solution of a problem in concurrent programming control. Commun. ACM\u00a08(9), 569 (1965)","journal-title":"Commun. ACM"},{"key":"3_CR6","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":"3_CR7","doi-asserted-by":"crossref","unstructured":"Heljanko, K.: Deadlock and reachability checking with finite complete prefixes. Licentiate\u2019s thesis, Helsinki University of Technology (1999)","DOI":"10.1007\/3-540-44618-4_10"},{"key":"3_CR8","unstructured":"Heljanko, K.: Minimizing finite complete prefixes. In: Proc. CS&P, pp. 83\u201395 (1999)"},{"key":"3_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1007\/3-540-54430-5_97","volume-title":"CONCUR 1991","author":"R. Janicki","year":"1991","unstructured":"Janicki, R., Koutny, M.: Invariant semantics of nets with inhibitor arcs. In: Groote, J.F., Baeten, J.C.M. (eds.) CONCUR 1991. LNCS, vol.\u00a0527, pp. 317\u2013331. Springer, Heidelberg (1991)"},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"Kahlon, V.: Boundedness vs. unboundedness of lock chains: Characterizing decidability of CFL-reachability for threads communicating via locks. In: Proc. LICS, pp. 27\u201336 (2009)","DOI":"10.1109\/LICS.2009.45"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Khomenko, V.: Model Checking Based on Prefixes of Petri Net Unfoldings. Ph.D. thesis, School of Computing Science, Newcastle University (2003)","DOI":"10.1007\/3-540-45657-0_49"},{"key":"3_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/978-3-642-21834-7_6","volume-title":"Applications and Theory of Petri Nets","author":"V. Khomenko","year":"2011","unstructured":"Khomenko, V., Mokhov, A.: An algorithm for direct construction of complete merged processes. In: Kristensen, L.M., Petrucci, L. (eds.) PETRI NETS 2011. LNCS, vol.\u00a06709, pp. 89\u2013108. Springer, Heidelberg (2011)"},{"key":"3_CR13","unstructured":"Khomenko, V.: Punf, \n                    \n                      http:\/\/homepages.cs.ncl.ac.uk\/victor.khomenko\/tools\/punf\/"},{"issue":"5","key":"3_CR14","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 \u2013 a new condensed representation of Petri net behaviour. Act. Inf.\u00a043(5), 307\u2013330 (2006)","journal-title":"Act. Inf."},{"key":"3_CR15","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 the state explosion problem in the verification of asynchronous circuits. In: Probst, D.K., von Bochmann, G. (eds.) CAV 1992. LNCS, vol.\u00a0663, pp. 164\u2013177. Springer, Heidelberg (1993)"},{"key":"3_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/3-540-57787-4_18","volume-title":"Graph Transformations in Computer Science","author":"U. Montanari","year":"1994","unstructured":"Montanari, U., Rossi, F.: Contextual occurrence nets and concurrent constraint programming. In: Ehrig, H., Schneider, H.-J. (eds.) Dagstuhl Seminar 1993. LNCS, vol.\u00a0776, pp. 280\u2013295. Springer, Heidelberg (1994)"},{"key":"3_CR17","unstructured":"Ranjan, D.P., Tang, D., Malik, S.: A comparative study of 2QBF algorithms. In: Proc. SAT (2004)"},{"key":"3_CR18","unstructured":"Ristori, G.: Modelling Systems with Shared Resources via Petri Nets. Ph.D. thesis, Department of Computer Science, University of Pisa (1994)"},{"key":"3_CR19","unstructured":"Rodr\u00edguez, C.: Cunf, \n                    \n                      http:\/\/www.lsv.ens-cachan.fr\/~rodriguez\/tools\/cunf\/"},{"key":"3_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/978-3-642-32940-1_33","volume-title":"CONCUR 2012 \u2013 Concurrency Theory","author":"C. Rodr\u00edguez","year":"2012","unstructured":"Rodr\u00edguez, C., Schwoon, S.: Verification of Petri Nets with Read Arcs. In: Koutny, M., Ulidowski, I. (eds.) CONCUR 2012. LNCS, vol.\u00a07454, pp. 471\u2013485. Springer, Heidelberg (2012)"},{"key":"3_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1007\/978-3-642-23217-6_23","volume-title":"CONCUR 2011 \u2013 Concurrency Theory","author":"C. Rodr\u00edguez","year":"2011","unstructured":"Rodr\u00edguez, C., Schwoon, S., Baldan, P.: Efficient contextual unfolding. In: Katoen, J.-P., K\u00f6nig, B. (eds.) CONCUR 2011. LNCS, vol.\u00a06901, pp. 342\u2013357. Springer, Heidelberg (2011)"},{"key":"3_CR22","doi-asserted-by":"crossref","unstructured":"Rodr\u00edguez, C., Schwoon, S., Khomenko, V.: Contextual merged processes. Tech. Rep. LSV-13-06, LSV, ENS de Cachan (2013)","DOI":"10.1007\/978-3-642-38697-8_3"},{"key":"3_CR23","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":"3_CR24","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)"}],"container-title":["Lecture Notes in Computer Science","Application and Theory of Petri Nets and Concurrency"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38697-8_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,14]],"date-time":"2019-05-14T08:15:36Z","timestamp":1557821736000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38697-8_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642386961","9783642386978"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38697-8_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}