Connector algebras for C/E and P/T nets' interactions
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,...
| Publicado: |
2013
|
|---|---|
| Materias: | |
| Acceso en línea: | https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_18605974_v9_n3_p_Bruni http://hdl.handle.net/20.500.12110/paper_18605974_v9_n3_p_Bruni |
| Aporte de: |
| id |
paper:paper_18605974_v9_n3_p_Bruni |
|---|---|
| record_format |
dspace |
| spelling |
paper:paper_18605974_v9_n3_p_Bruni2023-06-08T16:29:27Z Connector algebras for C/E and P/T nets' interactions C/E nets with boundaries Connector algebras P/T nets with boundaries Tiles Algebraic properties Basic algebra Component based systems Compositional interfaces Different class Mutual exclusions P/T net Stateless connectors Model checking Petri nets Semantics Tile Algebra 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. © R. Bruni, H. Melgratti, U. Montanari, and P. Sobociński. 2013 https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_18605974_v9_n3_p_Bruni http://hdl.handle.net/20.500.12110/paper_18605974_v9_n3_p_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 |
C/E nets with boundaries Connector algebras P/T nets with boundaries Tiles Algebraic properties Basic algebra Component based systems Compositional interfaces Different class Mutual exclusions P/T net Stateless connectors Model checking Petri nets Semantics Tile Algebra |
| spellingShingle |
C/E nets with boundaries Connector algebras P/T nets with boundaries Tiles Algebraic properties Basic algebra Component based systems Compositional interfaces Different class Mutual exclusions P/T net Stateless connectors Model checking Petri nets Semantics Tile Algebra Connector algebras for C/E and P/T nets' interactions |
| topic_facet |
C/E nets with boundaries Connector algebras P/T nets with boundaries Tiles Algebraic properties Basic algebra Component based systems Compositional interfaces Different class Mutual exclusions P/T net Stateless connectors Model checking Petri nets Semantics Tile Algebra |
| 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. © R. Bruni, H. Melgratti, U. Montanari, and P. Sobociński. |
| title |
Connector algebras for C/E and P/T nets' interactions |
| 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 |
| publishDate |
2013 |
| url |
https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_18605974_v9_n3_p_Bruni http://hdl.handle.net/20.500.12110/paper_18605974_v9_n3_p_Bruni |
| _version_ |
1768542810130087936 |