Connector algebras, Petri nets, and BIP

In the area of component-based software architectures, the term connector has been coined to denote an entity (e.g. the communication network, middleware or infrastructure) that regulates the interaction of independent components. Hence, a rigorous mathematical foundation for connectors is crucial f...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autor principal: Bruni, R.
Otros Autores: Melgratti, H., Montanari, U.
Formato: Acta de conferencia Capítulo de libro
Lenguaje:Inglés
Publicado: 2012
Acceso en línea:Registro en Scopus
DOI
Handle
Registro en la Biblioteca Digital
Aporte de:Registro referencial: Solicitar el recurso aquí
LEADER 08772caa a22008417a 4500
001 PAPER-23428
003 AR-BaUEN
005 20230518205507.0
008 190411s2012 xx ||||fo|||| 00| 0 eng|d
024 7 |2 scopus  |a 2-s2.0-84862106336 
040 |a Scopus  |b spa  |c AR-BaUEN  |d AR-BaUEN 
100 1 |a Bruni, R. 
245 1 0 |a Connector algebras, Petri nets, and BIP 
260 |c 2012 
270 1 0 |m Bruni, R.; Dipartimento di Informatica, Università di PisaItaly 
506 |2 openaire  |e Política editorial 
504 |a Arbab, F., Reo: A channel-based coordination model for component composition (2004) Mathematical Structures in Computer Science, 14 (3), pp. 329-366 
504 |a Arbab, F., Bruni, R., Clarke, D., Lanese, I., Montanari, U., Tiles for reo (2009) WADT 2008, 5486, pp. 37-55. , Corradini, A., Montanari, U. (eds.) LNCS Springer, Heidelberg 
504 |a Arbab, F., Rutten, J.J.M.M., A coinductive calculus of component connectors (2003) WADT 2003, 2755, pp. 34-55. , Wirsing, M., Pattinson, D., Hennicker, R. (eds.) LNCS Springer, Heidelberg 
504 |a Baier, C., Sirjani, M., Arbab, F., Rutten, J.J.M.M., (2006) Modeling Component Connectors in Reo by Constraint Automata. Sci. Comput. Program, 61 (2), pp. 75-113 
504 |a Baldan, P., Corradini, A., Ehrig, H., Heckel, R., Compositional semantics for open petri nets based on deterministic processes (2005) Mathematical Structures in Computer Science, 15 (1), pp. 1-35 
504 |a Basu, A., Bozga, M., Sifakis, J., Modeling heterogeneous real-time components in BIP (2006) Fourth IEEE International Conference on Software Engineering and Formal Methods (SEFM 2006), pp. 3-12. , IEEE Computer Society 
504 |a Bliudze, S., Sifakis, J., The algebra of connectors - Structuring interaction in BIP (2008) IEEE Trans. Computers, 57 (10), pp. 1315-1330 
504 |a Bliudze, S., Sifakis, J., Causal semantics for the algebra of connectors (2010) Formal Methods in System Design, 36 (2), pp. 167-194 
504 |a Bruni, R., Tile logic for synchronized rewriting of concurrent systems (1999) Computer Science Department, , PhD thesis University of Pisa, Published as Technical Report TD-1/99 
504 |a Bruni, R., Gadducci, F., Montanari, U., Normal forms for algebras of connection (2002) Theor. Comput. Sci., 286 (2), pp. 247-292 
504 |a Bruni, R., Lanese, I., Montanari, U., A basic algebra of stateless connectors (2006) Theor. Comput. Sci., 366 (1-2), pp. 98-120 
504 |a Bruni, R., Melgratti, H., Montanari, U., A connector algebra for P/T nets interactions (2011) CONCUR 2011 - Concurrency Theory, 6901, pp. 312-326. , Katoen, J.-P., König, B. (eds.) LNCS Springer, Heidelberg 
504 |a Bruni, R., Meseguer, J., Montanari, U., Symmetric monoidal and cartesian double categories as a semantic framework for tile logic (2002) Mathematical Structures in Computer Science, 12 (1), pp. 53-90 
504 |a Bruni, R., Montanari, U., Cartesian closed double categories, their lambdanotation, and the pi-calculus (1999) LICS, pp. 246-265 
504 |a Bruni, R., Montanari, U., Dynamic connectors for concurrency (2002) Theor. Comput. Sci., 281 (1-2), pp. 131-176 
504 |a Bruni, R., Montanari, U., Rossi, F., An interactive semantics of logic programming (2001) TPLP, 1 (6), pp. 647-690 
504 |a Clarke, D., Costa, D., Arbab, F., Connector colouring I: Synchronisation and context dependency (2007) Sci. Comput. Program, 66 (3), pp. 205-225 
504 |a Ferrari, G.L., Montanari, U., Tile formats for located and mobile systems (2000) Inf. Comput., 156 (1-2), pp. 173-235 
504 |a Fiadeiro, J.L., Maibaum, T.S.E., Categorical semantics of parallel program design (1997) Sci. Comput. Program, 28 (2-3), pp. 111-138 
504 |a Gadducci, F., Montanari, U., The tile model (2000) Proof, Language, and Interaction, pp. 133-166. , Plotkin, G.D., Stirling, C., Tofte, M. (eds.) The MIT Press 
504 |a Gadducci, F., Montanari, U., Comparing logics for rewriting: Rewriting logic, action calculi and tile logic (2002) Theor. Comput. Sci., 285 (2), pp. 319-358 
504 |a Katis, P., Sabadini, N., Walters, R.F.C., Representing place/transition nets in span(Graph) (1997) AMAST 1997, 1349, pp. 322-336. , Johnson, M. (ed.) LNCS Springer, Heidelberg 
504 |a Katis, P., Sabadini, N., Walters, R.F.C., Span(Graph): A categorial algebra of transition systems (1997) AMAST 1997, 1349, pp. 307-321. , Johnson, M. (ed.) LNCS Springer, Heidelberg 
504 |a König, B., Montanari, U., Observational equivalence for synchronized graph rewriting with mobility (2001) TACS 2001, 2215, pp. 145-164. , Kobayashi, N., Babu, C. S. (eds.) LNCS Springer, Heidelberg 
504 |a MacLane, S., (1998) Categories for the Working Mathematician, , 2nd edn. Springer, Heidelberg 
504 |a Montanari, U., Rossi, F., Graph rewriting, constraint solving and tiles for coordinating distributed systems (1999) Applied Categorical Structures, 7 (4), pp. 333-370 
504 |a Perry, D.E., Wolf, E.L., Foundations for the study of software architecture (1992) ACM SIGSOFT Software Engineering Notes, 17, pp. 40-52 
504 |a Petri, C., Kommunikation mit automaten (1962) Institut für Instrumentelle Mathematik, Bonn, , PhD thesis 
504 |a Sobocinski, P., A non-interleaving process calculus for multi-party synchronisation (2009) ICE. EPTCS, 12, pp. 87-98. , Bonchi, F., Grohmann, D., Spoletini, P., Tuosto, E. (eds.) 
504 |a Sobociński, P., Representations of petri net interactions (2010) CONCUR 2010, 6269, pp. 554-568. , Gastin, P., Laroussinie, F. (eds.) LNCS Springer, Heidelberg 
504 |a Stefanescu, G., Reaction and control I. Mixing additive and multiplicative network algebras (1998) Logic Journal of the IGPL, 6 (2), pp. 348-369 
520 3 |a In the area of component-based software architectures, the term connector has been coined to denote an entity (e.g. the communication network, middleware or infrastructure) that regulates the interaction of independent components. Hence, a rigorous mathematical foundation for connectors is crucial for the study of coordinated systems. In recent years, many different mathematical frameworks have been proposed to specify, design, analyse, compare, prototype and implement connectors rigorously. In this paper, we overview the main features of three notable frameworks and discuss their similarities, differences, mutual embedding and possible enhancements. First, we show that Sobocinski's nets with boundaries are as expressive as Sifakis et al.'s BI(P), the BIP component framework without priorities. Second, we provide a basic algebra of connectors for BI(P) by exploiting Montanari et al.'s tile model and a recent correspondence result with nets with boundaries. Finally, we exploit the tile model as a unifying framework to compare BI(P) with other models of connectors and to propose suitable enhancements of BI(P). © 2012 Springer-Verlag Berlin Heidelberg.  |l eng 
593 |a Dipartimento di Informatica, Università di Pisa, Italy 
593 |a Departamento de Computación, Universidad de Buenos Aires - Conicet, Argentina 
690 1 0 |a BASIC ALGEBRA 
690 1 0 |a COMPONENT FRAMEWORK 
690 1 0 |a COMPONENT-BASED SOFTWARE ARCHITECTURE 
690 1 0 |a COORDINATED SYSTEM 
690 1 0 |a INDEPENDENT COMPONENTS 
690 1 0 |a MATHEMATICAL FOUNDATIONS 
690 1 0 |a MATHEMATICAL FRAMEWORKS 
690 1 0 |a TILE MODELS 
690 1 0 |a MIDDLEWARE 
690 1 0 |a PETRI NETS 
690 1 0 |a INFORMATION SCIENCE 
700 1 |a Melgratti, H. 
700 1 |a Montanari, U. 
711 2 |c Novosibirsk  |d 27 June 2011 through 1 July 2011  |g Código de la conferencia: 89862 
773 0 |d 2012  |g v. 7162 LNCS  |h pp. 19-38  |p Lect. Notes Comput. Sci.  |n Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)  |x 03029743  |w (AR-BaUEN)CENRE-983  |z 9783642297083  |t 8th International Ershov Informatics Conference on Perspectives of System Informatics, PSI 2011 
856 4 1 |u https://www.scopus.com/inward/record.uri?eid=2-s2.0-84862106336&doi=10.1007%2f978-3-642-29709-0_2&partnerID=40&md5=8661411d034478d2b5bac495d58f6cbe  |y Registro en Scopus 
856 4 0 |u https://doi.org/10.1007/978-3-642-29709-0_2  |y DOI 
856 4 0 |u https://hdl.handle.net/20.500.12110/paper_03029743_v7162LNCS_n_p19_Bruni  |y Handle 
856 4 0 |u https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_03029743_v7162LNCS_n_p19_Bruni  |y Registro en la Biblioteca Digital 
961 |a paper_03029743_v7162LNCS_n_p19_Bruni  |b paper  |c PE 
962 |a info:eu-repo/semantics/article  |a info:ar-repo/semantics/artículo  |b info:eu-repo/semantics/publishedVersion 
963 |a VARI 
999 |c 84381