{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T22:34:36Z","timestamp":1784241276237,"version":"3.55.0"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319114385","type":"print"},{"value":"9783319114392","type":"electronic"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-11439-2_18","type":"book-chapter","created":{"date-parts":[[2014,9,15]],"date-time":"2014-09-15T01:30:11Z","timestamp":1410744611000},"page":"230-243","source":"Crossref","is-referenced-by-count":8,"title":["Compositional Reachability in Petri Nets"],"prefix":"10.1007","author":[{"given":"Julian","family":"Rathke","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Pawe\u0142","family":"Soboci\u0144ski","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Owen","family":"Stephens","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"18_CR1","doi-asserted-by":"crossref","unstructured":"Bonchi, F., Pous, D.: Checking NFA Equivalence with Bisimulations up to Congruence. In: PoPL (2013)","DOI":"10.1145\/2429069.2429124"},{"key":"18_CR2","doi-asserted-by":"crossref","unstructured":"Bruni, R., Melgratti, H., Montanari, U., Soboci\u0144ski, P.: Connector algebras for C\/E and P\/T nets\u2019 Interactions. Logical Methods in Computer Science\u00a09(3) (2013)","DOI":"10.2168\/LMCS-9(3:16)2013"},{"key":"18_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1007\/978-3-642-23217-6_21","volume-title":"CONCUR 2011 \u2013 Concurrency Theory","author":"R. Bruni","year":"2011","unstructured":"Bruni, R., Melgratti, H., Montanari, U.: A connector algebra for P\/T nets interactions. In: Katoen, J.-P., K\u00f6nig, B. (eds.) CONCUR 2011. LNCS, vol.\u00a06901, pp. 312\u2013326. Springer, Heidelberg (2011)"},{"key":"18_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1007\/3-540-57529-4_66","volume-title":"Foundations of Software Technology and Theoretical Computer Science","author":"A. Cheng","year":"1993","unstructured":"Cheng, A., Esparza, J., Palsberg, J.: Complexity results for 1-safe nets. In: Shyamasundar, R.K. (ed.) FSTTCS 1993. LNCS, vol.\u00a0761, pp. 326\u2013337. Springer, Heidelberg (1993)"},{"key":"18_CR5","unstructured":"Clarke, E.M., Long, D., McMillan, K.: Compositional model checking. In: LiCS 1989, pp. 352\u2013362 (1989)"},{"issue":"3","key":"18_CR6","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(3), 161\u2013180 (1996)","journal-title":"IEEE Transactions on Software Engineering"},{"key":"18_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":"18_CR8","unstructured":"Esparza, J., Heljanko, K.: Unfoldings: a partial-order approach to model checking. Springer (2008)"},{"issue":"3","key":"18_CR9","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1023\/A:1014746130920","volume":"30","author":"J. Esparza","year":"2002","unstructured":"Esparza, J., R\u00f6mer, S., Vogler, W.: An improvement of McMillan\u2019s unfolding algorithm. Form Method Syst Des\u00a030(3), 285\u2013310 (2002)","journal-title":"Form Method Syst Des"},{"key":"18_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/3-540-46002-0_26","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"K. Heljanko","year":"2002","unstructured":"Heljanko, K., Khomenko, V., Koutny, M.: Parallelisation of the Petri Net Unfolding Algorithm. In: Katoen, J.-P., Stevens, P. (eds.) TACAS 2002. LNCS, vol.\u00a02280, pp. 371\u2013385. Springer, Heidelberg (2002)"},{"key":"18_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/BFb0000479","volume-title":"Algebraic Methodology and Software Technology","author":"P. Katis","year":"1997","unstructured":"Katis, P., Sabadini, N., Walters, R.F.C.: Span(Graph): A categorical algebra of transition systems. In: Johnson, M. (ed.) AMAST 1997. LNCS, vol.\u00a01349, pp. 307\u2013321. Springer, Heidelberg (1997)"},{"key":"18_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1007\/11539452_27","volume-title":"CONCUR 2005 \u2013 Concurrency Theory","author":"V. Khomenko","year":"2005","unstructured":"Khomenko, V., Kondratyev, A., Koutny, M., Vogler, W.: Merged Processes \u2014 A New Condensed Representation of Petri Net Behaviour. In: Abadi, M., de Alfaro, L. (eds.) CONCUR 2005. LNCS, vol.\u00a03653, pp. 338\u2013352. Springer, Heidelberg (2005)"},{"issue":"2","key":"18_CR13","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, W.: Canonical prefixes of Petri net unfoldings. Acta Inform.\u00a040(2), 95\u2013118 (2003)","journal-title":"Acta Inform."},{"key":"18_CR14","doi-asserted-by":"crossref","unstructured":"Koutny, M., Khomenko, V.: Linear Programming Deadlock Checking Using Partial Order Dependencies. Technical report, Newcastle University (2000)","DOI":"10.1007\/3-540-44618-4_30"},{"key":"18_CR15","doi-asserted-by":"crossref","unstructured":"Mayr, R., Clemente, L.: Advanced Automata Minimization. In: POPL (2013)","DOI":"10.1145\/2429069.2429079"},{"issue":"1","key":"18_CR16","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/BF01384314","volume":"6","author":"K. McMillan","year":"1995","unstructured":"McMillan, K.: A technique of a state space search based on unfolding. Form. Method Syst. Des.\u00a06(1), 45\u201365 (1995)","journal-title":"Form. Method Syst. Des."},{"key":"18_CR17","unstructured":"Milner, R.: A Calculus of Communicating Systems. Prentice Hall (1989)"},{"issue":"1","key":"18_CR18","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0304-3975(81)90112-2","volume":"13","author":"M. Nielsen","year":"1981","unstructured":"Nielsen, M., Plotkin, G., Winskel, G.: Petri Nets, Event Structures and Domains, Part I. Theoretical Computer Science\u00a013(1), 85\u2013108 (1981)","journal-title":"Theoretical Computer Science"},{"key":"18_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"492","DOI":"10.1007\/978-3-319-02444-8_42","volume-title":"Automated Technology for Verification and Analysis","author":"C. Rodr\u00edguez","year":"2013","unstructured":"Rodr\u00edguez, C., Schwoon, S.: Cunf: A Tool for Unfolding and Verifying Petri Nets with Read Arcs. In: Van Hung, D., Ogawa, M. (eds.) ATVA 2013. LNCS, vol.\u00a08172, pp. 492\u2013495. Springer, Heidelberg (2013)"},{"key":"18_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/3-540-44988-4_27","volume-title":"Application and Theory of Petri Nets 2000","author":"K. Schmidt","year":"2000","unstructured":"Schmidt, K.: LoLA A Low Level Analyser. In: Nielsen, M., Simpson, D. (eds.) ICATPN 2000. LNCS, vol.\u00a01825, pp. 465\u2013474. Springer, Heidelberg (2000)"},{"key":"18_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"554","DOI":"10.1007\/978-3-642-15375-4_38","volume-title":"CONCUR 2010 - Concurrency Theory","author":"P. Soboci\u0144ski","year":"2010","unstructured":"Soboci\u0144ski, P.: Representations of petri net interactions. In: Gastin, P., Laroussinie, F. (eds.) CONCUR 2010. LNCS, vol.\u00a06269, pp. 554\u2013568. Springer, Heidelberg (2010)"},{"key":"18_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1007\/978-3-642-40206-7_29","volume-title":"Algebra and Coalgebra in Computer Science","author":"P. Soboci\u0144ski","year":"2013","unstructured":"Soboci\u0144ski, P., Stephens, O.: Penrose: Putting Compositionality to Work for Petri Net Reachability. In: Heckel, R., Milius, S. (eds.) CALCO 2013. LNCS, vol.\u00a08089, pp. 346\u2013352. Springer, Heidelberg (2013)"},{"key":"18_CR23","unstructured":"Soboci\u0144ski, P., Stephens, O.: Reachability via compositionality in Petri nets. arXiv:1303.1399v1 (2013)"},{"key":"18_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1007\/978-3-319-07734-5_9","volume-title":"Application and Theory of Petri Nets and Concurrency","author":"P. Soboci\u0144ski","year":"2014","unstructured":"Soboci\u0144ski, P., Stephens, O.: A Programming Language for Spatial Distribution of Net Systems. In: Ciardo, G., Kindler, E. (eds.) PETRI NETS 2014. LNCS, vol.\u00a08489, pp. 150\u2013169. Springer, Heidelberg (2014)"},{"key":"18_CR25","first-page":"292","volume":"5","author":"P. Starke","year":"1991","unstructured":"Starke, P.: Reachability analysis of Petri nets using symmetries. Systems Analysis Modelling Simulation\u00a05, 292\u2013303 (1991)","journal-title":"Systems Analysis Modelling Simulation"}],"container-title":["Lecture Notes in Computer Science","Reachability Problems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-11439-2_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,20]],"date-time":"2023-02-20T11:05:19Z","timestamp":1676891119000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-11439-2_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319114385","9783319114392"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-11439-2_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}