Navegar

Colección

Datos Estadísticas

Artículo

Bruni, R.; Melgratti, H.; Montanari, U. "Connector algebras, Petri nets, and BIP" (2012) 8th International Ershov Informatics Conference on Perspectives of System Informatics, PSI 2011. 7162 LNCS:19-38
El editor solo permite decargar el artículo en su versión post-print desde el repositorio. Por favor, si usted posee dicha versión, enviela a
Consulte el artículo en la página del editor
Consulte la política de Acceso Abierto del editor

Abstract:

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.

Registro:

Documento: Artículo
Título:Connector algebras, Petri nets, and BIP
Autor:Bruni, R.; Melgratti, H.; Montanari, U.
Ciudad:Novosibirsk
Filiación:Dipartimento di Informatica, Università di Pisa, Italy
Departamento de Computación, Universidad de Buenos Aires - Conicet, Argentina
Palabras clave:Basic algebra; Component framework; Component-based software architecture; Coordinated system; Independent components; Mathematical foundations; Mathematical frameworks; Tile models; Middleware; Petri nets; Information science
Año:2012
Volumen:7162 LNCS
Página de inicio:19
Página de fin:38
DOI: http://dx.doi.org/10.1007/978-3-642-29709-0_2
Título revista:8th International Ershov Informatics Conference on Perspectives of System Informatics, PSI 2011
Título revista abreviado:Lect. Notes Comput. Sci.
ISSN:03029743
Registro:https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_03029743_v7162LNCS_n_p19_Bruni

Referencias:

  • Arbab, F., Reo: A channel-based coordination model for component composition (2004) Mathematical Structures in Computer Science, 14 (3), pp. 329-366
  • 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
  • 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
  • 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
  • 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
  • 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
  • Bliudze, S., Sifakis, J., The algebra of connectors - Structuring interaction in BIP (2008) IEEE Trans. Computers, 57 (10), pp. 1315-1330
  • Bliudze, S., Sifakis, J., Causal semantics for the algebra of connectors (2010) Formal Methods in System Design, 36 (2), pp. 167-194
  • 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
  • Bruni, R., Gadducci, F., Montanari, U., Normal forms for algebras of connection (2002) Theor. Comput. Sci., 286 (2), pp. 247-292
  • Bruni, R., Lanese, I., Montanari, U., A basic algebra of stateless connectors (2006) Theor. Comput. Sci., 366 (1-2), pp. 98-120
  • 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
  • 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
  • Bruni, R., Montanari, U., Cartesian closed double categories, their lambdanotation, and the pi-calculus (1999) LICS, pp. 246-265
  • Bruni, R., Montanari, U., Dynamic connectors for concurrency (2002) Theor. Comput. Sci., 281 (1-2), pp. 131-176
  • Bruni, R., Montanari, U., Rossi, F., An interactive semantics of logic programming (2001) TPLP, 1 (6), pp. 647-690
  • Clarke, D., Costa, D., Arbab, F., Connector colouring I: Synchronisation and context dependency (2007) Sci. Comput. Program, 66 (3), pp. 205-225
  • Ferrari, G.L., Montanari, U., Tile formats for located and mobile systems (2000) Inf. Comput., 156 (1-2), pp. 173-235
  • Fiadeiro, J.L., Maibaum, T.S.E., Categorical semantics of parallel program design (1997) Sci. Comput. Program, 28 (2-3), pp. 111-138
  • 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
  • Gadducci, F., Montanari, U., Comparing logics for rewriting: Rewriting logic, action calculi and tile logic (2002) Theor. Comput. Sci., 285 (2), pp. 319-358
  • 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
  • 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
  • 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
  • MacLane, S., (1998) Categories for the Working Mathematician, , 2nd edn. Springer, Heidelberg
  • Montanari, U., Rossi, F., Graph rewriting, constraint solving and tiles for coordinating distributed systems (1999) Applied Categorical Structures, 7 (4), pp. 333-370
  • Perry, D.E., Wolf, E.L., Foundations for the study of software architecture (1992) ACM SIGSOFT Software Engineering Notes, 17, pp. 40-52
  • Petri, C., Kommunikation mit automaten (1962) Institut für Instrumentelle Mathematik, Bonn, , PhD thesis
  • 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.)
  • Sobociński, P., Representations of petri net interactions (2010) CONCUR 2010, 6269, pp. 554-568. , Gastin, P., Laroussinie, F. (eds.) LNCS Springer, Heidelberg
  • Stefanescu, G., Reaction and control I. Mixing additive and multiplicative network algebras (1998) Logic Journal of the IGPL, 6 (2), pp. 348-369

Citas:

---------- APA ----------
Bruni, R., Melgratti, H. & Montanari, U. (2012) . Connector algebras, Petri nets, and BIP. 8th International Ershov Informatics Conference on Perspectives of System Informatics, PSI 2011, 7162 LNCS, 19-38.
http://dx.doi.org/10.1007/978-3-642-29709-0_2
---------- CHICAGO ----------
Bruni, R., Melgratti, H., Montanari, U. "Connector algebras, Petri nets, and BIP" . 8th International Ershov Informatics Conference on Perspectives of System Informatics, PSI 2011 7162 LNCS (2012) : 19-38.
http://dx.doi.org/10.1007/978-3-642-29709-0_2
---------- MLA ----------
Bruni, R., Melgratti, H., Montanari, U. "Connector algebras, Petri nets, and BIP" . 8th International Ershov Informatics Conference on Perspectives of System Informatics, PSI 2011, vol. 7162 LNCS, 2012, pp. 19-38.
http://dx.doi.org/10.1007/978-3-642-29709-0_2
---------- VANCOUVER ----------
Bruni, R., Melgratti, H., Montanari, U. Connector algebras, Petri nets, and BIP. Lect. Notes Comput. Sci. 2012;7162 LNCS:19-38.
http://dx.doi.org/10.1007/978-3-642-29709-0_2