Roberto Bruni ; Hernan Melgratti ; Ugo Montanari ; Pawel Sobocinski - Connector algebras for C/E and P/T nets' interactions

lmcs:883 - Logical Methods in Computer Science, September 17, 2013, Volume 9, Issue 3 - https://doi.org/10.2168/LMCS-9(3:16)2013
Connector algebras for C/E and P/T nets' interactionsArticle

Authors: Roberto Bruni ; Hernan Melgratti ; Ugo Montanari ; Pawel Sobocinski ORCID

    A quite flourishing research thread in the recent literature on component-based 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.


    Volume: Volume 9, Issue 3
    Published on: September 17, 2013
    Imported on: April 5, 2012
    Keywords: Computer Science - Formal Languages and Automata Theory
    Funding:
      Source : OpenAIRE Graph
    • Autonomic Service-Component Ensembles; Funder: European Commission; Code: 257414
    • Mobility between Europe and Argentina applying Logics to Systems; Funder: European Commission; Code: 295261

    24 Documents citing this article

    Consultation statistics

    This page has been seen 1098 times.
    This article's PDF has been downloaded 423 times.