{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T06:06:55Z","timestamp":1725602815156},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642232169"},{"type":"electronic","value":"9783642232176"}],"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-23217-6_23","type":"book-chapter","created":{"date-parts":[[2011,8,25]],"date-time":"2011-08-25T09:14:02Z","timestamp":1314263642000},"page":"342-357","source":"Crossref","is-referenced-by-count":8,"title":["Efficient Contextual Unfolding"],"prefix":"10.1007","author":[{"given":"C\u00e9sar","family":"Rodr\u00edguez","sequence":"first","affiliation":[]},{"given":"Stefan","family":"Schwoon","sequence":"additional","affiliation":[]},{"given":"Paolo","family":"Baldan","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"23_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/BFb0053542","volume-title":"Foundations of Software Science and Computation Structures","author":"P. Baldan","year":"1998","unstructured":"Baldan, P., Corradini, A., Montanari, U.: An event structure semantics for P\/T contextual nets: Asymmetric event structures. In: Nivat, M. (ed.) FOSSACS 1998. LNCS, vol.\u00a01378, pp. 63\u201380. Springer, Heidelberg (1998)"},{"key":"23_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/978-3-642-15928-2_7","volume-title":"Graph Transformations","author":"P. Baldan","year":"2010","unstructured":"Baldan, P., Bruni, A., Corradini, A., K\u00f6nig, B., Schwoon, S.: On the computation of mcMillan\u201ds prefix for contextual nets and graph grammars. In: Ehrig, H., Rensink, A., Rozenberg, G., Sch\u00fcrr, A. (eds.) ICGT 2010. LNCS, vol.\u00a06372, pp. 91\u2013106. Springer, Heidelberg (2010)"},{"key":"23_CR3","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.) Transactions on Petri Nets and Other Models of Concurrency I. LNCS, vol.\u00a05100, pp. 199\u2013220. Springer, Heidelberg (2008)","DOI":"10.1007\/978-3-540-89287-8_12"},{"key":"23_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"},{"key":"23_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/3-540-45139-0_4","volume-title":"Model Checking Software","author":"J. Esparza","year":"2001","unstructured":"Esparza, J., Heljanko, K.: Implementing LTL model checking with net unfoldings. In: Dwyer, M.B. (ed.) SPIN 2001. LNCS, vol.\u00a02057, pp. 37\u201356. Springer, Heidelberg (2001)"},{"key":"23_CR6","unstructured":"Esparza, J., Heljanko, K.: Unfoldings - A Partial-Order Approach to Model Checking. EATCS Monographs in Theoretical Computer Science. Springer, Heidelberg (2008)"},{"key":"23_CR7","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":"23_CR8","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":"23_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/3-540-54430-5_97","volume-title":"CONCUR \u201991","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":"23_CR10","unstructured":"Khomenko, V.: Punf, http:\/\/homepages.cs.ncl.ac.uk\/victor.khomenko\/tools\/punf\/"},{"key":"23_CR11","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":"23_CR12","doi-asserted-by":"crossref","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. Springer, Heidelberg (1994)","DOI":"10.1007\/3-540-57787-4_18"},{"key":"23_CR13","unstructured":"Ristori, G.: Modelling Systems with Shared Resources via Petri Nets. Ph.D. thesis, Department of Computer Science, University of Pisa (1994)"},{"key":"23_CR14","unstructured":"Rodr\u00edguez, C.: Cunf, http:\/\/www.lsv.ens-cachan.fr\/~rodriguez\/tools\/cunf\/"},{"key":"23_CR15","doi-asserted-by":"crossref","unstructured":"Rodr\u00edguez, C., Schwoon, S., Baldan, P.: Efficient contextual unfolding. Tech. Rep. LSV-11-14, LSV, ENS de Cachan (2011)","DOI":"10.1007\/978-3-642-23217-6_23"},{"key":"23_CR16","unstructured":"Schwoon, S.: Mole, http:\/\/www.lsv.ens-cachan.fr\/~schwoon\/tools\/mole\/"},{"key":"23_CR17","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":"23_CR18","unstructured":"Winkowski, J.: Reachability in contextual nets. Fundamenta Informaticae\u00a051(1-2), 235\u2013250 (2002)"}],"container-title":["Lecture Notes in Computer Science","CONCUR 2011 \u2013 Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-23217-6_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,14]],"date-time":"2019-06-14T07:45:09Z","timestamp":1560498309000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23217-6_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642232169","9783642232176"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23217-6_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}