{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,4]],"date-time":"2026-10-04T18:50:33Z","timestamp":1791139833558,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642153747","type":"print"},{"value":"9783642153754","type":"electronic"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15375-4_38","type":"book-chapter","created":{"date-parts":[[2010,8,20]],"date-time":"2010-08-20T18:04:18Z","timestamp":1282327458000},"page":"554-568","source":"Crossref","is-referenced-by-count":32,"title":["Representations of Petri Net Interactions"],"prefix":"10.1007","author":[{"given":"Pawe\u0142","family":"Soboci\u0144ski","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"38_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11548133_1","volume-title":"Algebra and Coalgebra in Computer Science","author":"S. Abramsky","year":"2005","unstructured":"Abramsky, S.: Abstract scalars, loops and free traced and strongly compact closed categories. In: Fiadeiro, J.L., Harman, N.A., Roggenbach, M., Rutten, J. (eds.) CALCO 2005. LNCS, vol.\u00a03629, pp. 1\u201329. Springer, Heidelberg (2005)"},{"issue":"3","key":"38_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1017\/S0960129504004153","volume":"14","author":"F. Arbab","year":"2004","unstructured":"Arbab, F.: Reo: a channel-based coordination model for component composition. Math. Struct. Comp. Sci.\u00a014(3), 1\u201338 (2004)","journal-title":"Math. Struct. Comp. Sci."},{"key":"38_CR3","series-title":"Lecture Notes in Computer Science","volume-title":"WADT 2008","author":"F. Arbab","year":"2008","unstructured":"Arbab, F., Bruni, R., Clarke, D., Lanese, I., Montanari, U.: Tiles for Reo. In: WADT 2008. LNCS, vol.\u00a05486. Springer, Heidelberg (2008)"},{"key":"38_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)"},{"issue":"1","key":"38_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1017\/S0960129504004311","volume":"15","author":"P. Baldan","year":"2005","unstructured":"Baldan, P., Corradini, A., Ehrig, H., Heckel, R.: Compositional semantics for open Petri nets based on deterministic processes. Math. Struct. Comp. Sci.\u00a015(1), 1\u201335 (2005)","journal-title":"Math. Struct. Comp. Sci."},{"issue":"4","key":"38_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2168\/LMCS-4(4:3)2008","volume":"4","author":"P. Baldan","year":"2008","unstructured":"Baldan, P., Corradini, A., Ehrig, H., Heckel, R., K\u00f6nig, B.: Bisimilarity and behaviour-preserving reconfigurations of Petri nets. Log. Meth. Comput. Sci.\u00a04(4), 1\u201341 (2008)","journal-title":"Log. Meth. Comput. Sci."},{"key":"38_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/3-540-55610-9_167","volume-title":"Advances in Petri Nets 1992","author":"E. Best","year":"1992","unstructured":"Best, E., Devillers, R., Hall, J.G.: The box calculus: A new causal algebra with multi-labelled communication. In: Rozenberg, G. (ed.) APN 1992. LNCS, vol.\u00a0609, pp. 21\u201369. Springer, Heidelberg (1992)"},{"key":"38_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"508","DOI":"10.1007\/978-3-540-85361-9_39","volume-title":"CONCUR 2008 - Concurrency Theory","author":"S. Bliudze","year":"2008","unstructured":"Bliudze, S., Sifakis, J.: A notion of glue expressiveness for component-based systems. In: van Breugel, F., Chechik, M. (eds.) CONCUR 2008. LNCS, vol.\u00a05201, pp. 508\u2013522. Springer, Heidelberg (2008)"},{"key":"38_CR9","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1016\/j.tcs.2006.07.005","volume":"366","author":"R. Bruni","year":"2006","unstructured":"Bruni, R., Lanese, I., Montanari, U.: A basic algebra of stateless connectors. Theor. Comput. Sci.\u00a0366, 98\u2013120 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"38_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/3-540-60218-6_11","volume-title":"CONCUR \u201995 Concurrency Theory","author":"N. Busi","year":"1995","unstructured":"Busi, N., Gorrieri, R.: A Petri net semantics for the \u03c0-calculus. In: Lee, I., Smolka, S.A. (eds.) CONCUR 1995. LNCS, vol.\u00a0962, pp. 145\u2013159. Springer, Heidelberg (1995)"},{"key":"38_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/3-540-45923-5_4","volume-title":"Fundamental Approaches to Software Engineering","author":"A. Cerone","year":"2002","unstructured":"Cerone, A.: Implementing Condition\/Event nets in the circal process algebra. In: Kutsche, R.-D., Weber, H. (eds.) FASE 2002. LNCS, vol.\u00a02306, pp. 49\u201363. Springer, Heidelberg (2002)"},{"key":"38_CR12","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/BF02915446","volume":"26","author":"P. Degano","year":"1988","unstructured":"Degano, P., Nicola, R.D., Montanari, U.: A distributed operational semantics for CCS based on C\/E systems. Acta Inform.\u00a026, 59\u201391 (1988)","journal-title":"Acta Inform."},{"key":"38_CR13","doi-asserted-by":"crossref","first-page":"133","DOI":"10.7551\/mitpress\/5641.003.0010","volume-title":"Proof, Language and Interaction: Essays in Honour of Robin Milner","author":"F. Gadducci","year":"2000","unstructured":"Gadducci, F., Montanari, U.: The tile model. In: Proof, Language and Interaction: Essays in Honour of Robin Milner, pp. 133\u2013166. MIT Press, Cambridge (2000)"},{"key":"38_CR14","series-title":"Lecture Notes in Computer Science","volume-title":"Semantics of Systems of Concurrent Processes","author":"U. Goltz","year":"1990","unstructured":"Goltz, U.: CCS and Petri nets. In: Guessarian, I. (ed.) LITP 1990. LNCS, vol.\u00a0469. Springer, Heidelberg (1990)"},{"issue":"1-2","key":"38_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2007.01.003","volume":"379","author":"J.F. Groote","year":"2007","unstructured":"Groote, J.F., Voorhoeve, M.: Operational semantics for Petri net components. Theor. Comput. Sci.\u00a0379(1-2), 1\u201319 (2007)","journal-title":"Theor. Comput. Sci."},{"key":"38_CR16","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/0001-8708(91)90003-P","volume":"88","author":"A. Joyal","year":"1991","unstructured":"Joyal, A., Street, R.: The geometry of tensor calculus, i. Adv. Math.\u00a088, 55\u2013112 (1991)","journal-title":"Adv. Math."},{"key":"38_CR17","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.: Representing P\/T nets in Span(Graph). In: Johnson, M. (ed.) AMAST 1997. LNCS, vol.\u00a01349, pp. 307\u2013321. Springer, Heidelberg (1997)"},{"key":"38_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1007\/BFb0000480","volume-title":"Algebraic Methodology and Software Technology","author":"P. Katis","year":"1997","unstructured":"Katis, P., Sabadini, N., Walters, R.F.C.: Span(Graph): an algebra of transition systems. In: Johnson, M. (ed.) AMAST 1997. LNCS, vol.\u00a01349, pp. 322\u2013336. Springer, Heidelberg (1997)"},{"key":"38_CR19","first-page":"3","volume-title":"Automata Studies","author":"S.C. Kleene","year":"1956","unstructured":"Kleene, S.C.: Representation of events in nerve nets and finite automata. In: Automata Studies, pp. 3\u201341. Princeton University Press, Princeton (1956)"},{"key":"38_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/BFb0015011","volume-title":"CONCUR \u201994: Concurrency Theory","author":"M. Koutny","year":"1994","unstructured":"Koutny, M., Esparza, J., Best, E.: Operational semantics for the Petri box calculus. In: Jonsson, B., Parrow, J. (eds.) CONCUR 1994. LNCS, vol.\u00a0836, pp. 210\u2013225. Springer, Heidelberg (1994)"},{"issue":"6","key":"38_CR21","doi-asserted-by":"publisher","first-page":"989","DOI":"10.1017\/S0960129506005664","volume":"16","author":"J.J. Leifer","year":"2006","unstructured":"Leifer, J.J., Milner, R.: Transition systems, link graphs and Petri nets. Math. Struct. Comp. Sci.\u00a016(6), 989\u20131047 (2006)","journal-title":"Math. Struct. Comp. Sci."},{"key":"38_CR22","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1109\/TEC.1960.5221603","volume":"9","author":"R. McNaughton","year":"1960","unstructured":"McNaughton, R., Yamada, H.: Regular expressions and state graphs for automata. IEEE Trans. Electronic Computers\u00a09, 39\u201347 (1960)","journal-title":"IEEE Trans. Electronic Computers"},{"key":"38_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-10235-3","volume-title":"A Calculus of Communication Systems","author":"R. Milner","year":"1980","unstructured":"Milner, R.: A Calculus of Communication Systems. LNCS, vol.\u00a092. Springer, Heidelberg (1980)"},{"key":"38_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"686","DOI":"10.1007\/978-3-540-27755-2_19","volume-title":"Lectures on Concurrency and Petri Nets","author":"R. Milner","year":"2004","unstructured":"Milner, R.: Bigraphs for Petri nets. In: Desel, J., Reisig, W., Rozenberg, G. (eds.) Lectures on Concurrency and Petri Nets. LNCS, vol.\u00a03098, pp. 686\u2013701. Springer, Heidelberg (2004)"},{"issue":"6","key":"38_CR25","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1007\/BF01178907","volume":"32","author":"U. Montanari","year":"1995","unstructured":"Montanari, U., Rossi, F.: Contextual nets. Acta Inform.\u00a032(6), 545\u2013596 (1995)","journal-title":"Acta Inform."},{"key":"38_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/3-540-60218-6_13","volume-title":"CONCUR \u201995 Concurrency Theory","author":"M. Nielsen","year":"1995","unstructured":"Nielsen, M., Priese, L., Sassone, V.: Characterizing behavioural congruences for Petri nets. In: Lee, I., Smolka, S.A. (eds.) CONCUR 1995. LNCS, vol.\u00a0962, pp. 175\u2013189. Springer, Heidelberg (1995)"},{"key":"38_CR27","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/j.jlap.2004.05.001","volume":"60-61","author":"G.D. Plotkin","year":"2004","unstructured":"Plotkin, G.D.: A structural approach to operational semantics. J. Logic Algebr. Progr.\u00a060-61, 17\u2013139 (2004); Originally appeared as Technical Report DAIMI FN-19, University of Aarhus (1981)","journal-title":"J. Logic Algebr. Progr."},{"key":"38_CR28","series-title":"EATCS Monographs on Theoretical Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-69968-9","volume-title":"Petri nets: an introduction","author":"W. Reisig","year":"1985","unstructured":"Reisig, W.: Petri nets: an introduction. EATCS Monographs on Theoretical Computer Science. Springer, Heidelberg (1985)"},{"key":"38_CR29","doi-asserted-by":"crossref","unstructured":"Sassone, V., Soboci\u0144ski, P.: A congruence for Petri nets. In: Petri Nets and Graph Transformation (PNGT 2004). ENTCS, vol.\u00a0127, pp. 107\u2013120 (2005)","DOI":"10.1016\/j.entcs.2005.02.008"},{"key":"38_CR30","doi-asserted-by":"crossref","unstructured":"Soboci\u0144ski, P.: A non-interleaving process calculus for multi-party synchronisation. In: Interaction and Concurrency (ICE 2009). EPTCS, vol.\u00a012 (2009)","DOI":"10.4204\/EPTCS.12.6"},{"key":"38_CR31","series-title":"Lecture Notes in Computer Science","volume-title":"PARLE Parallel Architectures and Languages Europe","author":"R. Glabbeek van","year":"1987","unstructured":"van Glabbeek, R., Vaandrager, F.: Petri net models for algebraic theories of concurrency. In: de Bakker, J.W., Nijman, A.J., Treleaven, P.C. (eds.) PARLE 1987. LNCS, vol.\u00a0259. Springer, Heidelberg (1987)"}],"container-title":["Lecture Notes in Computer Science","CONCUR 2010 - Concurrency Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15375-4_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,29]],"date-time":"2024-03-29T19:24:44Z","timestamp":1711740284000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15375-4_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642153747","9783642153754"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15375-4_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}