{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T22:00:34Z","timestamp":1725746434516},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642402050"},{"type":"electronic","value":"9783642402067"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40206-7_29","type":"book-chapter","created":{"date-parts":[[2013,8,26]],"date-time":"2013-08-26T23:29:41Z","timestamp":1377559781000},"page":"346-352","source":"Crossref","is-referenced-by-count":2,"title":["Penrose: Putting Compositionality to Work for Petri Net Reachability"],"prefix":"10.1007","author":[{"given":"Pawe\u0142","family":"Soboci\u0144ski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Owen","family":"Stephens","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"29_CR1","unstructured":"Andersen, H.R.: An Introduction to Binary Decision Diagrams. Technical Report October 1997, Technical University of Denmark (1997)"},{"issue":"9","key":"29_CR2","doi-asserted-by":"publisher","first-page":"993","DOI":"10.1109\/12.537122","volume":"45","author":"B. Bollig","year":"1996","unstructured":"Bollig, B., Wegener, I.: Improving the Variable Ordering of OBDDs Is NP-complete. IEEE Transactions on Computers\u00a045(9), 993\u20131002 (1996)","journal-title":"IEEE Transactions on Computers"},{"key":"29_CR3","unstructured":"Bruni, R., Melgratti, H.C., Montanari, U., Soboci\u0144ski, P.: Connector algebras for C\/E and P\/T nets\u2019 interactions. In: LMCS (to appear, 2013)"},{"key":"29_CR4","unstructured":"Brzozowski, J.: Canonical regular expressions and minimal state graphs for definite events. In: Mathematical Theory of Automata. MRI Symposia, vol.\u00a012, pp. 529\u2013561. Polytechnic Institute of Brooklyn, Polytechnic Press (1962)"},{"key":"29_CR5","unstructured":"Clarke, E.M., Long, D., McMillan, K.: Compositional model checking. In: LiCS 1989, pp. 352\u2013362 (1989)"},{"issue":"2-3","key":"29_CR6","first-page":"149","volume":"10","author":"M. Fujita","year":"1993","unstructured":"Fujita, M., McGeer, P.C., Yang, J.C.-Y.: Multi-Terminal Binary Decision Diagrams: An Efficient Data Structure for Matrix Representation. Formal Methods in System Design\u00a010(2-3), 149\u2013169 (1993)","journal-title":"Formal Methods in System Design"},{"key":"29_CR7","first-page":"181","volume":"104C","author":"P. Katis","year":"2004","unstructured":"Katis, P., Sabadini, N., Walters, R.: Compositional minimization in Span(Graph): Some examples. ENTCS\u00a0104C, 181\u2013197 (2004)","journal-title":"ENTCS"},{"issue":"1","key":"29_CR8","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":"29_CR9","doi-asserted-by":"crossref","unstructured":"Minato, S.-I., Ishiura, N., Yajima, S.: Shared Binary Decision Diagram with Attributed Edges for Efficient Boolean Function Manipulation. In: Proc. DAC 1990, pp. 52\u201357. ACM Press (1990)","DOI":"10.1145\/123186.123225"},{"key":"29_CR10","unstructured":"Rathke, J., Soboci\u0144ski, P., Stephens, O.: Decomposing Petri nets. arXiv:1304.3121v1 (2013)"},{"key":"29_CR11","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":"29_CR12","unstructured":"Soboci\u0144ski, P., Stephens, O.: Reachability via compositionality in Petri nets. arXiv:1303.1399v1 (2013)"},{"key":"29_CR13","first-page":"292","volume":"4\/5","author":"P. Starke","year":"1991","unstructured":"Starke, P.: Reachability analysis of Petri nets using symmetries. Systems Analysis Modelling Simulation\u00a04\/5, 292\u2013303 (1991)","journal-title":"Systems Analysis Modelling Simulation"}],"container-title":["Lecture Notes in Computer Science","Algebra and Coalgebra in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40206-7_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T19:19:23Z","timestamp":1558034363000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40206-7_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642402050","9783642402067"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40206-7_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}