{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T21:27:46Z","timestamp":1775078866384,"version":"3.50.1"},"publisher-location":"Cham","reference-count":9,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319024431","type":"print"},{"value":"9783319024448","type":"electronic"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"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":[[2013]]},"DOI":"10.1007\/978-3-319-02444-8_42","type":"book-chapter","created":{"date-parts":[[2013,8,29]],"date-time":"2013-08-29T05:11:21Z","timestamp":1377753081000},"page":"492-495","source":"Crossref","is-referenced-by-count":14,"title":["Cunf: A Tool for Unfolding and Verifying Petri Nets with Read Arcs"],"prefix":"10.1007","author":[{"given":"C\u00e9sar","family":"Rodr\u00edguez","sequence":"first","affiliation":[]},{"given":"Stefan","family":"Schwoon","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"42_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":"42_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/978-3-540-89287-8_12","volume-title":"ToPNoC 1","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.) ToPNoC I. LNCS, vol.\u00a05100, pp. 199\u2013220. Springer, Heidelberg (2008)"},{"key":"42_CR3","unstructured":"Cosyverif Project: Cosyverif \n                    \n                      http:\/\/www.cosyverif.org"},{"key":"42_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"502","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. 502\u2013518. Springer, Heidelberg (2004)"},{"key":"42_CR5","unstructured":"LIP6\/MoVe Team: Coloane, \n                    \n                      http:\/\/coloane.lip6.fr\/"},{"key":"42_CR6","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)"},{"issue":"4","key":"42_CR7","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"},{"key":"42_CR8","unstructured":"Rodr\u00edguez, C.: Cunf, \n                    \n                      http:\/\/www.lsv.ens-cachan.fr\/~rodriguez\/tools\/cunf\/"},{"key":"42_CR9","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)"}],"container-title":["Lecture Notes in Computer Science","Automated Technology for Verification and Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-02444-8_42","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,10,9]],"date-time":"2018-10-09T20:25:59Z","timestamp":1539116759000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-02444-8_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783319024431","9783319024448"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-02444-8_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}