{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T09:31:01Z","timestamp":1725701461788},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642329395"},{"type":"electronic","value":"9783642329401"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-32940-1_33","type":"book-chapter","created":{"date-parts":[[2012,9,1]],"date-time":"2012-09-01T20:47:02Z","timestamp":1346532422000},"page":"471-485","source":"Crossref","is-referenced-by-count":13,"title":["Verification of 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":"33_CR1","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\u2019s 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":"33_CR2","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.) ToPNoC 1. LNCS, vol.\u00a05100, pp. 199\u2013220. Springer, Heidelberg (2008)"},{"key":"33_CR3","unstructured":"Chen, J.: A new SAT encoding of the at-most-one constraint. In: Proc. Constraint Modelling and Reformulation (2010)"},{"key":"33_CR4","doi-asserted-by":"crossref","unstructured":"Codish, M., Genaim, S., Stuckey, P.J.: A declarative encoding of telecommunications feature subscription in SAT. In: Proc. PPDP, pp. 255\u2013266. ACM (2009)","DOI":"10.1145\/1599410.1599442"},{"issue":"1-2","key":"33_CR5","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1016\/j.tcs.2006.01.035","volume":"356","author":"V. Diekert","year":"2006","unstructured":"Diekert, V., Gastin, P.: From local to global temporal logics over Mazurkiewicz traces. Theoretical Computer Science\u00a0356(1-2), 126\u2013135 (2006)","journal-title":"Theoretical Computer Science"},{"key":"33_CR6","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":"33_CR7","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":"33_CR8","unstructured":"Esparza, J., Heljanko, K.: Unfoldings - A Partial-Order Approach to Model Checking. EATCS Monographs in Theoretical Computer Science. Springer (2008)"},{"key":"33_CR9","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"},{"issue":"3-4","key":"33_CR10","first-page":"231","volume":"47","author":"J. Esparza","year":"2001","unstructured":"Esparza, J., Schr\u00f6ter, C.: Unfolding based algorithms for the reachability problem. Fund. Inf.\u00a047(3-4), 231\u2013245 (2001)","journal-title":"Fund. Inf."},{"issue":"3","key":"33_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(3), 247\u2013268 (1999)","journal-title":"Fund. Inf."},{"key":"33_CR12","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"},{"issue":"5","key":"33_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 \u2013 a new condensed representation of Petri net behaviour. Act. Inf.\u00a043(5), 307\u2013330 (2006)","journal-title":"Act. Inf."},{"key":"33_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1007\/3-540-44618-4_30","volume-title":"CONCUR 2000 - Concurrency Theory","author":"V. Khomenko","year":"2000","unstructured":"Khomenko, V., Koutny, M.: LP Deadlock Checking Using Partial Order Dependencies. In: Palamidessi, C. (ed.) CONCUR 2000. LNCS, vol.\u00a01877, pp. 410\u2013425. Springer, Heidelberg (2000)"},{"issue":"2","key":"33_CR15","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s10703-006-0022-1","volume":"30","author":"V. Khomenko","year":"2007","unstructured":"Khomenko, V., Koutny, M.: Verification of bounded Petri nets using integer programming. Formal Methods in System Design\u00a030(2), 143\u2013176 (2007)","journal-title":"Formal Methods in System Design"},{"key":"33_CR16","unstructured":"Khomenko, V.: Punf, \n                    \n                      homepages.cs.ncl.ac.uk\/victor.khomenko\/tools\/punf\/"},{"key":"33_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 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":"33_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)"},{"key":"33_CR19","unstructured":"Raynal, M.: Algorithms for Mutual Exclusion. MIT Press (1986)"},{"key":"33_CR20","unstructured":"Rodr\u00edguez, C.: Cunf, \n                    \n                      http:\/\/www.lsv.ens-cachan.fr\/~rodriguez\/tools\/cunf\/"},{"key":"33_CR21","doi-asserted-by":"crossref","unstructured":"Rodr\u00edguez, C., Schwoon, S.: Verification of Petri Nets with Read Arcs. Tech. Rep. LSV-12-12, LSV, ENS de Cachan (2012)","DOI":"10.1007\/978-3-642-32940-1_33"},{"key":"33_CR22","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":"33_CR23","unstructured":"Schr\u00f6ter, C.: Halbordnungs- und Reduktionstechniken f\u00fcr die automatische Verifikation von verteilten Systemen. Ph.D. thesis, Universit\u00e4t Stuttgart (2006)"},{"key":"33_CR24","unstructured":"Schwoon, S.: Mole, \n                    \n                      http:\/\/www.lsv.ens-cachan.fr\/~schwoon\/tools\/mole\/"},{"key":"33_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1007\/978-3-642-22600-7_3","volume-title":"DCFS 2011","author":"S. Schwoon","year":"2011","unstructured":"Schwoon, S., Rodr\u00edguez, C.: Construction and SAT-Based Verification of Contextual Unfoldings. In: Holzer, M. (ed.) DCFS 2011. LNCS, vol.\u00a06808, pp. 34\u201342. Springer, Heidelberg (2011)"}],"container-title":["Lecture Notes in Computer Science","CONCUR 2012 \u2013 Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-32940-1_33.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:49:39Z","timestamp":1620128979000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-32940-1_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642329395","9783642329401"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32940-1_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}