{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T06:15:39Z","timestamp":1725603339914},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642232169"},{"type":"electronic","value":"9783642232176"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-23217-6_21","type":"book-chapter","created":{"date-parts":[[2011,8,25]],"date-time":"2011-08-25T13:14:02Z","timestamp":1314278042000},"page":"312-326","source":"Crossref","is-referenced-by-count":19,"title":["A Connector Algebra for P\/T Nets Interactions"],"prefix":"10.1007","author":[{"given":"Roberto","family":"Bruni","sequence":"first","affiliation":[]},{"given":"Hern\u00e1n","family":"Melgratti","sequence":"additional","affiliation":[]},{"given":"Ugo","family":"Montanari","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"21_CR1","doi-asserted-by":"crossref","unstructured":"Arbab, F.: Reo: a channel-based coordination model for component composition. Math. Struct. in Comp. Science\u00a014(3), 329\u2013366 (2004)","DOI":"10.1017\/S0960129504004153"},{"key":"21_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/978-3-642-03429-9_4","volume-title":"Recent Trends in Algebraic Development Techniques","author":"F. Arbab","year":"2009","unstructured":"Arbab, F., Bruni, R., Clarke, D., Lanese, I., Montanari, U.: Tiles for reo. In: Corradini, A., Montanari, U. (eds.) WADT 2008. LNCS, vol.\u00a05486, pp. 37\u201355. Springer, Heidelberg (2009)"},{"key":"21_CR3","doi-asserted-by":"crossref","unstructured":"Baldan, P., Corradini, A., Ehrig, H., Heckel, R.: Compositional semantics for open Petri nets based on deterministic processe. Math. Struct. in Comp. Science\u00a015(1), 1\u201335 (2005)","DOI":"10.1017\/S0960129504004311"},{"key":"21_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/978-3-540-31862-0_6","volume-title":"Theoretical Aspects of Computing - ICTAC 2004","author":"M.A. Barbosa","year":"2005","unstructured":"Barbosa, M.A., Barbosa, L.S.: Specifying software connectors. In: Liu, Z., Araki, K. (eds.) ICTAC 2004. LNCS, vol.\u00a03407, pp. 52\u201367. Springer, Heidelberg (2005)"},{"issue":"10","key":"21_CR5","doi-asserted-by":"publisher","first-page":"1315","DOI":"10.1109\/TC.2008.26","volume":"57","author":"S. Bliudze","year":"2008","unstructured":"Bliudze, S., Sifakis, J.: The algebra of connectors - structuring interaction in BIP. IEEE Trans. Computers\u00a057(10), 1315\u20131330 (2008)","journal-title":"IEEE Trans. Computers"},{"issue":"2","key":"21_CR6","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/s10703-010-0091-z","volume":"36","author":"S. Bliudze","year":"2010","unstructured":"Bliudze, S., Sifakis, J.: Causal semantics for the algebra of connectors. Formal Methods in System Design\u00a036(2), 167\u2013194 (2010)","journal-title":"Formal Methods in System Design"},{"issue":"2","key":"21_CR7","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/S0304-3975(01)00318-8","volume":"286","author":"R. Bruni","year":"2002","unstructured":"Bruni, R., Gadducci, F., Montanari, U.: Normal forms for algebras of connection. Theor. Comput. Sci.\u00a0286(2), 247\u2013292 (2002)","journal-title":"Theor. Comput. Sci."},{"issue":"1-2","key":"21_CR8","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(1-2), 98\u2013120 (2006)","journal-title":"Theor. Comput. Sci."},{"issue":"1-2","key":"21_CR9","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/S0304-3975(02)00011-7","volume":"281","author":"R. Bruni","year":"2002","unstructured":"Bruni, R., Montanari, U.: Dynamic connectors for concurrency. Theor. Comput. Sci.\u00a0281(1-2), 131\u2013176 (2002)","journal-title":"Theor. Comput. Sci."},{"issue":"6","key":"21_CR10","first-page":"647","volume":"1","author":"R. Bruni","year":"2001","unstructured":"Bruni, R., Montanari, U., Rossi, F.: An interactive semantics of logic programming. TPLP\u00a01(6), 647\u2013690 (2001)","journal-title":"TPLP"},{"key":"21_CR11","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/0304-3975(92)90087-V","volume":"103","author":"A. Corradini","year":"1992","unstructured":"Corradini, A., Montanari, U.: An algebraic semantics for structured transition systems and its application to logic programs. Theoret. Comput. Sci.\u00a0103, 51\u2013106 (1992)","journal-title":"Theoret. Comput. Sci."},{"issue":"1-2","key":"21_CR12","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1006\/inco.1999.2825","volume":"156","author":"G.L. Ferrari","year":"2000","unstructured":"Ferrari, G.L., Montanari, U.: Tile formats for located and mobile systems. Inf. Comput.\u00a0156(1-2), 173\u2013235 (2000)","journal-title":"Inf. Comput."},{"issue":"2-3","key":"21_CR13","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/S0167-6423(96)00025-1","volume":"28","author":"J.L. Fiadeiro","year":"1997","unstructured":"Fiadeiro, J.L., Maibaum, T.S.E.: Categorical semantics of parallel program design. Sci. Comput. Program.\u00a028(2-3), 111\u2013138 (1997)","journal-title":"Sci. Comput. Program."},{"key":"21_CR14","doi-asserted-by":"crossref","first-page":"133","DOI":"10.7551\/mitpress\/5641.003.0010","volume-title":"Proof, Language, and Interaction","author":"F. Gadducci","year":"2000","unstructured":"Gadducci, F., Montanari, U.: The tile model. In: Proof, Language, and Interaction, pp. 133\u2013166. The MIT Press, Cambridge (2000)"},{"key":"21_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"526","DOI":"10.1007\/BFb0032056","volume-title":"Automata, Languages and Programming","author":"K.G. Larsen","year":"1990","unstructured":"Larsen, K.G., Xinxin, L.: Compositionality through an operational semantics of contexts. In: Paterson, M. (ed.) ICALP 1990. LNCS, vol.\u00a0443, pp. 526\u2013539. Springer, Heidelberg (1990)"},{"key":"21_CR16","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/0304-3975(92)90182-F","volume":"96","author":"J. Meseguer","year":"1992","unstructured":"Meseguer, J.: Conditional rewriting logic as a unified model of concurrency. Theoret. Comput. Sci.\u00a096, 73\u2013155 (1992)","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"21_CR17","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1023\/A:1008693303228","volume":"7","author":"U. Montanari","year":"1999","unstructured":"Montanari, U., Rossi, F.: Graph rewriting, constraint solving and tiles for coordinating distributed systems. Applied Categorical Structures\u00a07(4), 333\u2013370 (1999)","journal-title":"Applied Categorical Structures"},{"key":"21_CR18","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1145\/141874.141884","volume":"17","author":"D.E. Perry","year":"1992","unstructured":"Perry, D.E., Wolf, E.L.: Foundations for the study of software architecture. ACM SIGSOFT Software Engineering Notes\u00a017, 40\u201352 (1992)","journal-title":"ACM SIGSOFT Software Engineering Notes"},{"key":"21_CR19","unstructured":"Petri, C.: Kommunikation mit Automaten. PhD thesis, Institut f\u00fcr Instrumentelle Mathematik, Bonn (1962)"},{"key":"21_CR20","doi-asserted-by":"crossref","unstructured":"Plotkin, G.D.: A structural approach to operational semantics. J. Log. Algebr. Program.\u00a060-61, 17\u2013139 (2004)","DOI":"10.1016\/j.jlap.2004.03.009"},{"key":"21_CR21","doi-asserted-by":"crossref","unstructured":"Sobocinski, P.: A non-interleaving process calculus for multi-party synchronisation. In: ICE 2009. EPTCS, vol.\u00a012, pp. 87\u201398 (2009)","DOI":"10.4204\/EPTCS.12.6"},{"key":"21_CR22","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)"},{"issue":"2","key":"21_CR23","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1093\/jigpal\/6.2.349","volume":"6","author":"G. Stefanescu","year":"1998","unstructured":"Stefanescu, G.: Reaction and control i. mixing additive and multiplicative network algebras. Logic Journal of the IGPL\u00a06(2), 348\u2013369 (1998)","journal-title":"Logic Journal of the IGPL"}],"container-title":["Lecture Notes in Computer Science","CONCUR 2011 \u2013 Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-23217-6_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,10]],"date-time":"2024-04-10T14:48:30Z","timestamp":1712760510000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23217-6_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642232169","9783642232176"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23217-6_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}