The University of Southampton
University of Southampton Institutional Repository

Connector algebras for C/E and P/T nets interactions

Connector algebras for C/E and P/T nets interactions
Connector algebras for C/E and P/T nets interactions
A quite fourishing research thread in the recent literature on component based system 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 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, fulfilling a long standing quest.
1-65
Bruni, Roberto
90d7d677-7d01-487d-8f47-4717b3baad3f
Hernan, Melgratti
4b5a6cbc-0407-4a81-9695-55cc2827fb18
Ugo, Montanari
2bc4881f-315f-4c63-b839-a4caedb9d80f
Pawel, Sobocinski
439334ab-2826-447b-9fe5-3928be3fd4fd
Bruni, Roberto
90d7d677-7d01-487d-8f47-4717b3baad3f
Hernan, Melgratti
4b5a6cbc-0407-4a81-9695-55cc2827fb18
Ugo, Montanari
2bc4881f-315f-4c63-b839-a4caedb9d80f
Pawel, Sobocinski
439334ab-2826-447b-9fe5-3928be3fd4fd

Bruni, Roberto, Hernan, Melgratti, Ugo, Montanari and Pawel, Sobocinski (2013) Connector algebras for C/E and P/T nets interactions [in special issue: Selected Papers of the "22nd International Conference on Concurrency Theory" CONCUR 2011 Aachen, Germany, 2011] Logical Methods in Computer Science, 9, (3), pp. 1-65. (doi:10.2168/LMCS-9(3:16)2013).

Record type: Article

Abstract

A quite fourishing research thread in the recent literature on component based system 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 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, fulfilling a long standing quest.

PDF __userfiles.soton.ac.uk_Users_nsc_mydesktop_339065sobocinski.pdf - Version of Record
Available under License Other.
Download (1MB)

More information

Published date: 17 September 2013
Organisations: Electronics & Computer Science

Identifiers

Local EPrints ID: 339065
URI: https://eprints.soton.ac.uk/id/eprint/339065
PURE UUID: eee9b8cd-a05d-4d09-8c31-f945498722c4

Catalogue record

Date deposited: 22 May 2012 09:29
Last modified: 18 Jul 2017 05:55

Export record

Altmetrics

Contributors

Author: Roberto Bruni
Author: Melgratti Hernan
Author: Montanari Ugo
Author: Sobocinski Pawel

University divisions

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Library staff edit
Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of https://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×