Connector algebras for C/E and P/T nets' interactions
- Autores
- Bruni, Roberto; Melgratti, Hernan Claudio; Montanari, Ugo; Soboscinski, Pawel
- Año de publicación
- 2013
- Idioma
- inglés
- Tipo de recurso
- artículo
- Estado
- versión publicada
- Descripción
- A quite flourishing research thread in the recent literature on componentbased systems is concerned with the algebraic properties of different classes of connectors. In a recent paper, an algebra of stateless connectors was presented that consists of five kinds of basic connectors, namely symmetry, synchronization, mutual exclusion, hiding and inaction, plus their duals, and it was shown how they can be freely composed in series and in parallel to model sophisticated “glues”. In this paper we explore the expressiveness of stateful connectors obtained by adding one-place buffers or unbounded buffers to the stateless connectors. The main results are: i) we show how different classes of connectors exactly correspond to suitable classes of Petri nets equipped with compositional interfaces, called nets with boundaries; ii) we show that the difference between strong and weak semantics in stateful connectors is reflected in the semantics of nets with boundaries by moving from the classic step semantics (strong case) to a novel banking semantics (weak case), where a step can be executed by taking some “debit” tokens to be given back during the same step; iii) we show that the corresponding bisimilarities are congruences (w.r.t. composition of connectors in series and in parallel); iv) we show that suitable monoidality laws, like those arising when representing stateful connectors in the tile model, can nicely capture concurrency (in the sense of step semantics) aspects; and v) as a side result, we provide a basic algebra, with a finite set of symbols, out of which we can compose all P/T nets with boundaries, fulfilling a long standing quest.
Fil: Bruni, Roberto. Universitá di Pisa. Dipartimento di Informatica; Italia
Fil: Melgratti, Hernan Claudio. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina. Consejo Nacional de Investigaciones Cientificas y Tecnicas. Oficina de Coordinacion Administrativa Ciudad Universitaria; Argentina
Fil: Montanari, Ugo. Universitá di Pisa. Dipartimento di Informatica; Italia
Fil: Soboscinski, Pawel. University of Southampton. Electronics and Computer Science; Reino Unido - Materia
-
C/E Nets with Boundaries
P/T Nets with Boundaries
Connector Algebras
Tiles - Nivel de accesibilidad
- acceso abierto
- Condiciones de uso
- https://creativecommons.org/licenses/by-nc/2.5/ar/
- Repositorio
- Institución
- Consejo Nacional de Investigaciones Científicas y Técnicas
- OAI Identificador
- oai:ri.conicet.gov.ar:11336/2756
Ver los metadatos del registro completo
id |
CONICETDig_8d780dbb576808439d00b2954c8377c3 |
---|---|
oai_identifier_str |
oai:ri.conicet.gov.ar:11336/2756 |
network_acronym_str |
CONICETDig |
repository_id_str |
3498 |
network_name_str |
CONICET Digital (CONICET) |
spelling |
Connector algebras for C/E and P/T nets' interactionsBruni, RobertoMelgratti, Hernan ClaudioMontanari, UgoSoboscinski, PawelC/E Nets with BoundariesP/T Nets with BoundariesConnector AlgebrasTileshttps://purl.org/becyt/ford/1.1https://purl.org/becyt/ford/1https://purl.org/becyt/ford/1.2https://purl.org/becyt/ford/1A quite flourishing research thread in the recent literature on componentbased systems is concerned with the algebraic properties of different classes of connectors. In a recent paper, an algebra of stateless connectors was presented that consists of five kinds of basic connectors, namely symmetry, synchronization, mutual exclusion, hiding and inaction, plus their duals, and it was shown how they can be freely composed in series and in parallel to model sophisticated “glues”. In this paper we explore the expressiveness of stateful connectors obtained by adding one-place buffers or unbounded buffers to the stateless connectors. The main results are: i) we show how different classes of connectors exactly correspond to suitable classes of Petri nets equipped with compositional interfaces, called nets with boundaries; ii) we show that the difference between strong and weak semantics in stateful connectors is reflected in the semantics of nets with boundaries by moving from the classic step semantics (strong case) to a novel banking semantics (weak case), where a step can be executed by taking some “debit” tokens to be given back during the same step; iii) we show that the corresponding bisimilarities are congruences (w.r.t. composition of connectors in series and in parallel); iv) we show that suitable monoidality laws, like those arising when representing stateful connectors in the tile model, can nicely capture concurrency (in the sense of step semantics) aspects; and v) as a side result, we provide a basic algebra, with a finite set of symbols, out of which we can compose all P/T nets with boundaries, fulfilling a long standing quest.Fil: Bruni, Roberto. Universitá di Pisa. Dipartimento di Informatica; ItaliaFil: Melgratti, Hernan Claudio. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina. Consejo Nacional de Investigaciones Cientificas y Tecnicas. Oficina de Coordinacion Administrativa Ciudad Universitaria; ArgentinaFil: Montanari, Ugo. Universitá di Pisa. Dipartimento di Informatica; ItaliaFil: Soboscinski, Pawel. University of Southampton. Electronics and Computer Science; Reino UnidoLogical Methods in Computer Science e.V.2013-09-17info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionhttp://purl.org/coar/resource_type/c_6501info:ar-repo/semantics/articuloapplication/pdfapplication/pdfhttp://hdl.handle.net/11336/2756Bruni, Roberto; Melgratti, Hernan Claudio; Montanari, Ugo; Soboscinski, Pawel; Connector algebras for C/E and P/T nets' interactions; Logical Methods in Computer Science e.V.; Logical Methods in Computer Science; 9; 3; 17-9-2013; 1-651860-5974enginfo:eu-repo/semantics/altIdentifier/url/http://www.lmcs-online.org/ojs/viewarticle.php?id=1189&layout=abstractinfo:eu-repo/semantics/altIdentifier/url/http://arxiv.org/pdf/1307.0204v2info:eu-repo/semantics/openAccesshttps://creativecommons.org/licenses/by-nc/2.5/ar/reponame:CONICET Digital (CONICET)instname:Consejo Nacional de Investigaciones Científicas y Técnicas2025-09-29T10:10:40Zoai:ri.conicet.gov.ar:11336/2756instacron:CONICETInstitucionalhttp://ri.conicet.gov.ar/Organismo científico-tecnológicoNo correspondehttp://ri.conicet.gov.ar/oai/requestdasensio@conicet.gov.ar; lcarlino@conicet.gov.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:34982025-09-29 10:10:40.424CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicasfalse |
dc.title.none.fl_str_mv |
Connector algebras for C/E and P/T nets' interactions |
title |
Connector algebras for C/E and P/T nets' interactions |
spellingShingle |
Connector algebras for C/E and P/T nets' interactions Bruni, Roberto C/E Nets with Boundaries P/T Nets with Boundaries Connector Algebras Tiles |
title_short |
Connector algebras for C/E and P/T nets' interactions |
title_full |
Connector algebras for C/E and P/T nets' interactions |
title_fullStr |
Connector algebras for C/E and P/T nets' interactions |
title_full_unstemmed |
Connector algebras for C/E and P/T nets' interactions |
title_sort |
Connector algebras for C/E and P/T nets' interactions |
dc.creator.none.fl_str_mv |
Bruni, Roberto Melgratti, Hernan Claudio Montanari, Ugo Soboscinski, Pawel |
author |
Bruni, Roberto |
author_facet |
Bruni, Roberto Melgratti, Hernan Claudio Montanari, Ugo Soboscinski, Pawel |
author_role |
author |
author2 |
Melgratti, Hernan Claudio Montanari, Ugo Soboscinski, Pawel |
author2_role |
author author author |
dc.subject.none.fl_str_mv |
C/E Nets with Boundaries P/T Nets with Boundaries Connector Algebras Tiles |
topic |
C/E Nets with Boundaries P/T Nets with Boundaries Connector Algebras Tiles |
purl_subject.fl_str_mv |
https://purl.org/becyt/ford/1.1 https://purl.org/becyt/ford/1 https://purl.org/becyt/ford/1.2 https://purl.org/becyt/ford/1 |
dc.description.none.fl_txt_mv |
A quite flourishing research thread in the recent literature on componentbased systems is concerned with the algebraic properties of different classes of connectors. In a recent paper, an algebra of stateless connectors was presented that consists of five kinds of basic connectors, namely symmetry, synchronization, mutual exclusion, hiding and inaction, plus their duals, and it was shown how they can be freely composed in series and in parallel to model sophisticated “glues”. In this paper we explore the expressiveness of stateful connectors obtained by adding one-place buffers or unbounded buffers to the stateless connectors. The main results are: i) we show how different classes of connectors exactly correspond to suitable classes of Petri nets equipped with compositional interfaces, called nets with boundaries; ii) we show that the difference between strong and weak semantics in stateful connectors is reflected in the semantics of nets with boundaries by moving from the classic step semantics (strong case) to a novel banking semantics (weak case), where a step can be executed by taking some “debit” tokens to be given back during the same step; iii) we show that the corresponding bisimilarities are congruences (w.r.t. composition of connectors in series and in parallel); iv) we show that suitable monoidality laws, like those arising when representing stateful connectors in the tile model, can nicely capture concurrency (in the sense of step semantics) aspects; and v) as a side result, we provide a basic algebra, with a finite set of symbols, out of which we can compose all P/T nets with boundaries, fulfilling a long standing quest. Fil: Bruni, Roberto. Universitá di Pisa. Dipartimento di Informatica; Italia Fil: Melgratti, Hernan Claudio. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina. Consejo Nacional de Investigaciones Cientificas y Tecnicas. Oficina de Coordinacion Administrativa Ciudad Universitaria; Argentina Fil: Montanari, Ugo. Universitá di Pisa. Dipartimento di Informatica; Italia Fil: Soboscinski, Pawel. University of Southampton. Electronics and Computer Science; Reino Unido |
description |
A quite flourishing research thread in the recent literature on componentbased systems is concerned with the algebraic properties of different classes of connectors. In a recent paper, an algebra of stateless connectors was presented that consists of five kinds of basic connectors, namely symmetry, synchronization, mutual exclusion, hiding and inaction, plus their duals, and it was shown how they can be freely composed in series and in parallel to model sophisticated “glues”. In this paper we explore the expressiveness of stateful connectors obtained by adding one-place buffers or unbounded buffers to the stateless connectors. The main results are: i) we show how different classes of connectors exactly correspond to suitable classes of Petri nets equipped with compositional interfaces, called nets with boundaries; ii) we show that the difference between strong and weak semantics in stateful connectors is reflected in the semantics of nets with boundaries by moving from the classic step semantics (strong case) to a novel banking semantics (weak case), where a step can be executed by taking some “debit” tokens to be given back during the same step; iii) we show that the corresponding bisimilarities are congruences (w.r.t. composition of connectors in series and in parallel); iv) we show that suitable monoidality laws, like those arising when representing stateful connectors in the tile model, can nicely capture concurrency (in the sense of step semantics) aspects; and v) as a side result, we provide a basic algebra, with a finite set of symbols, out of which we can compose all P/T nets with boundaries, fulfilling a long standing quest. |
publishDate |
2013 |
dc.date.none.fl_str_mv |
2013-09-17 |
dc.type.none.fl_str_mv |
info:eu-repo/semantics/article info:eu-repo/semantics/publishedVersion http://purl.org/coar/resource_type/c_6501 info:ar-repo/semantics/articulo |
format |
article |
status_str |
publishedVersion |
dc.identifier.none.fl_str_mv |
http://hdl.handle.net/11336/2756 Bruni, Roberto; Melgratti, Hernan Claudio; Montanari, Ugo; Soboscinski, Pawel; Connector algebras for C/E and P/T nets' interactions; Logical Methods in Computer Science e.V.; Logical Methods in Computer Science; 9; 3; 17-9-2013; 1-65 1860-5974 |
url |
http://hdl.handle.net/11336/2756 |
identifier_str_mv |
Bruni, Roberto; Melgratti, Hernan Claudio; Montanari, Ugo; Soboscinski, Pawel; Connector algebras for C/E and P/T nets' interactions; Logical Methods in Computer Science e.V.; Logical Methods in Computer Science; 9; 3; 17-9-2013; 1-65 1860-5974 |
dc.language.none.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
info:eu-repo/semantics/altIdentifier/url/http://www.lmcs-online.org/ojs/viewarticle.php?id=1189&layout=abstract info:eu-repo/semantics/altIdentifier/url/http://arxiv.org/pdf/1307.0204v2 |
dc.rights.none.fl_str_mv |
info:eu-repo/semantics/openAccess https://creativecommons.org/licenses/by-nc/2.5/ar/ |
eu_rights_str_mv |
openAccess |
rights_invalid_str_mv |
https://creativecommons.org/licenses/by-nc/2.5/ar/ |
dc.format.none.fl_str_mv |
application/pdf application/pdf |
dc.publisher.none.fl_str_mv |
Logical Methods in Computer Science e.V. |
publisher.none.fl_str_mv |
Logical Methods in Computer Science e.V. |
dc.source.none.fl_str_mv |
reponame:CONICET Digital (CONICET) instname:Consejo Nacional de Investigaciones Científicas y Técnicas |
reponame_str |
CONICET Digital (CONICET) |
collection |
CONICET Digital (CONICET) |
instname_str |
Consejo Nacional de Investigaciones Científicas y Técnicas |
repository.name.fl_str_mv |
CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicas |
repository.mail.fl_str_mv |
dasensio@conicet.gov.ar; lcarlino@conicet.gov.ar |
_version_ |
1844613997834272768 |
score |
13.070432 |