{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T18:17:13Z","timestamp":1781893033200,"version":"3.54.5"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319077338","type":"print"},{"value":"9783319077345","type":"electronic"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"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":[[2014]]},"DOI":"10.1007\/978-3-319-07734-5_9","type":"book-chapter","created":{"date-parts":[[2014,7,1]],"date-time":"2014-07-01T13:57:34Z","timestamp":1404223054000},"page":"150-169","source":"Crossref","is-referenced-by-count":7,"title":["A Programming Language for Spatial Distribution of Net Systems"],"prefix":"10.1007","author":[{"given":"Pawe\u0142","family":"Soboci\u0144ski","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Owen","family":"Stephens","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"1","key":"9_CR1","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1023\/B:FORM.0000004786.30007.f8","volume":"24","author":"P.A. Abdulla","year":"2004","unstructured":"Abdulla, P.A., Iyer, S.P., Nyl\u00e9n, A.: SAT-Solving the Coverability Problem for Petri Nets. Formal Methods in System Design\u00a024(1), 25\u201343 (2004)","journal-title":"Formal Methods in System Design"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"Abramsky, S., Coecke, B.: A categorical semantics of quantum protocols. In: LiCS 2004. IEEE Press (2004)","DOI":"10.1109\/LICS.2004.1319636"},{"issue":"1-2","key":"9_CR3","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/S0304-3975(02)00006-3","volume":"281","author":"Andr\u00e9 Arnold","year":"2002","unstructured":"Arnold, A.: Nivat\u2019s processes and their synchronization. TCS\u00a0281(1-2), 31\u201326 (2002)","journal-title":"Theoretical Computer Science"},{"key":"9_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/3-540-44685-0_34","volume-title":"CONCUR 2001 - Concurrency Theory","author":"P. Baldan","year":"2001","unstructured":"Baldan, P., Corradini, A., Ehrig, H., Heckel, R.: Compositional modelling of reactive systems using open nets. In: Larsen, K.G., Nielsen, M. (eds.) CONCUR 2001. LNCS, vol.\u00a02154, pp. 502\u2013518. Springer, Heidelberg (2001)"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Best, E., Devillers, R., Koutny, M.: Petri Net Algebra. Springer (2001)","DOI":"10.1007\/978-3-662-04457-5"},{"key":"9_CR6","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":"9_CR7","doi-asserted-by":"crossref","unstructured":"Bruni, R., Melgratti, H.C., Montanari, U., Soboci\u0144ski, P.: Connector algebras for C\/E and P\/T nets\u2019 interactions. Log. Meth. Comput. Sci. 9(3:16), 1\u201365 (2013)","DOI":"10.2168\/LMCS-9(3:16)2013"},{"key":"9_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/3-540-56863-8_47","volume-title":"Application and Theory of Petri Nets 1993","author":"S. Christensen","year":"1993","unstructured":"Christensen, S., Hansen, N.D.: Coloured Petri Nets Extended With Place Capacities, Test Arcs and Inhibitor Arcs. In: Ajmone Marsan, M. (ed.) ICATPN 1993. LNCS, vol.\u00a0691, pp. 186\u2013205. Springer, Heidelberg (1993)"},{"issue":"3","key":"9_CR9","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":"9_CR10","doi-asserted-by":"crossref","unstructured":"Hoare, C.A.R.: Communicating Sequential Processes. Prentice Hall (1985)","DOI":"10.1007\/978-3-642-82921-5_4"},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"Junker, B.H., Schreiber, F.: Analysis of Biological Networks. Wiley (2008)","DOI":"10.1002\/9780470253489"},{"key":"9_CR12","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":"9_CR13","doi-asserted-by":"crossref","unstructured":"Kennedy, A.: Relational Parametricity and Units of Measure. In: POPL 1997, pp. 442\u2013455. ACM (1997)","DOI":"10.1145\/263699.263761"},{"key":"9_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/3-540-63139-9_39","volume-title":"Application and Theory of Petri Nets 1997","author":"E. Kindler","year":"1997","unstructured":"Kindler, E.: A compositional partial order semantics for petri net components. In: Az\u00e9ma, P., Balbo, G. (eds.) ICATPN 1997. LNCS, vol.\u00a01248, pp. 235\u2013252. Springer, Heidelberg (1997)"},{"issue":"12","key":"9_CR15","doi-asserted-by":"publisher","first-page":"838","DOI":"10.1002\/minf.201000086","volume":"29","author":"I. Koch","year":"2010","unstructured":"Koch, I.: Petri nets - a mathematical formalism to analyze chemical reaction networks. Molecular Informatics\u00a029(12), 838\u2013843 (2010)","journal-title":"Molecular Informatics"},{"key":"9_CR16","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/S0022-4049(03)00069-0","volume":"184","author":"Y. Lafont","year":"2003","unstructured":"Lafont, Y.: Towards an algebraic theory of boolean circuits. J. Pure. Appl. Alg.\u00a0184, 257\u2013310 (2003)","journal-title":"J. Pure. Appl. Alg."},{"key":"9_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/3-540-50580-6_35","volume-title":"Advances in Petri Nets 1988","author":"A. Mazurkiewicz","year":"1988","unstructured":"Mazurkiewicz, A.: Compositional semantics of pure place\/transition systems. In: Rozenberg, G. (ed.) APN 1988. LNCS, vol.\u00a0340, pp. 307\u2013330. Springer, Heidelberg (1988)"},{"issue":"1","key":"9_CR18","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":"9_CR19","unstructured":"Milner, R.: A Calculus of Communicating Systems. Prentice Hall (1989)"},{"key":"9_CR20","unstructured":"Petri, C.A.: Communication with automata. Technical report, Air Force Systems Command, Griffiss Air Force Base, New York (1966)"},{"key":"9_CR21","unstructured":"Rathke, J., Soboci\u0144ski, P., Stephens, O.: Decomposing Petri nets. arXiv:1304.3121v1 (2013)"},{"key":"9_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/978-3-642-02424-5_4","volume-title":"Applications and Theory of Petri Nets","author":"W. Reisig","year":"2009","unstructured":"Reisig, W.: Simple composition of nets. In: Franceschinis, G., Wolf, K. (eds.) PETRI NETS 2009. LNCS, vol.\u00a05606, pp. 23\u201342. Springer, Heidelberg (2009)"},{"issue":"3","key":"9_CR23","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1016\/j.tcs.2005.06.019","volume":"343","author":"J. Rutten","year":"2005","unstructured":"Rutten, J.: A tutorial on coinductive stream calculus and signal flow graphs. Theor. Comput. Sci.\u00a0343(3), 443\u2013481 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"9_CR24","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1007\/s002360050002","volume":"36","author":"K. Schmidt","year":"2000","unstructured":"Schmidt, K.: How to calculate symmetries of Petri nets. Acta. Inf.\u00a036, 545\u2013590 (2000)","journal-title":"Acta. Inf."},{"key":"9_CR25","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":"9_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1007\/978-3-642-40206-7_29","volume-title":"CALCO 2013","author":"P. Soboci\u0144ski","year":"2013","unstructured":"Soboci\u0144ski, P., Stephens, O.: Penrose: Putting Compositionality to Work for Petri Net Reachability. In: Heckel, R. (ed.) CALCO 2013. LNCS, vol.\u00a08089, pp. 346\u2013352. Springer, Heidelberg (2013)"},{"key":"9_CR27","unstructured":"Soboci\u0144ski, P., Stephens, O.: Reachability via compositionality in Petri nets. arXiv:1303.1399v1 (2013)"},{"key":"9_CR28","doi-asserted-by":"crossref","unstructured":"van der Aalst, W.: Process Mining: Discovery, Conformance and Enhancement of Business Processes. Springer (2011)","DOI":"10.1007\/978-3-642-19345-3"}],"container-title":["Lecture Notes in Computer Science","Application and Theory of Petri Nets and Concurrency"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-07734-5_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,10]],"date-time":"2022-04-10T05:34:04Z","timestamp":1649568844000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-07734-5_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319077338","9783319077345"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07734-5_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}