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
Autores principales:	Bruni, R., Melgratti, H., Montanari, U.
Formato:	SER
Materias:	Basic algebra Component framework Component-based software architecture Coordinated system Independent components Mathematical foundations Mathematical frameworks Tile models Middleware Petri nets Information science
Acceso en línea:	http://hdl.handle.net/20.500.12110/paper_03029743_v7162LNCS_n_p19_Bruni
Aporte de:	Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) de Universidad de Buenos Aires

id	todo:paper_03029743_v7162LNCS_n_p19_Bruni
record_format	dspace
spelling	todo:paper_03029743_v7162LNCS_n_p19_Bruni2023-10-03T15:19:23Z Connector algebras, Petri nets, and BIP Bruni, R. Melgratti, H. Montanari, U. Basic algebra Component framework Component-based software architecture Coordinated system Independent components Mathematical foundations Mathematical frameworks Tile models Middleware Petri nets Information science 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. SER info:eu-repo/semantics/openAccess http://creativecommons.org/licenses/by/2.5/ar http://hdl.handle.net/20.500.12110/paper_03029743_v7162LNCS_n_p19_Bruni
institution	Universidad de Buenos Aires
institution_str	I-28
repository_str	R-134
collection	Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA)
topic	Basic algebra Component framework Component-based software architecture Coordinated system Independent components Mathematical foundations Mathematical frameworks Tile models Middleware Petri nets Information science
spellingShingle	Basic algebra Component framework Component-based software architecture Coordinated system Independent components Mathematical foundations Mathematical frameworks Tile models Middleware Petri nets Information science Bruni, R. Melgratti, H. Montanari, U. Connector algebras, Petri nets, and BIP
topic_facet	Basic algebra Component framework Component-based software architecture Coordinated system Independent components Mathematical foundations Mathematical frameworks Tile models Middleware Petri nets Information science
description	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.
format	SER
author	Bruni, R. Melgratti, H. Montanari, U.
author_facet	Bruni, R. Melgratti, H. Montanari, U.
author_sort	Bruni, R.
title	Connector algebras, Petri nets, and BIP
title_short	Connector algebras, Petri nets, and BIP
title_full	Connector algebras, Petri nets, and BIP
title_fullStr	Connector algebras, Petri nets, and BIP
title_full_unstemmed	Connector algebras, Petri nets, and BIP
title_sort	connector algebras, petri nets, and bip
url	http://hdl.handle.net/20.500.12110/paper_03029743_v7162LNCS_n_p19_Bruni
work_keys_str_mv	AT brunir connectoralgebraspetrinetsandbip AT melgrattih connectoralgebraspetrinetsandbip AT montanariu connectoralgebraspetrinetsandbip
_version_	1807319237276991488

Connector algebras, Petri nets, and BIP

Ejemplares similares