A normal form for stateful connectors

In this paper we consider a calculus of connectors that allows for the most general combination of synchronisation, non-determinism and buffering. According to previous results, this calculus is tightly related to a flavour of Petri nets with interfaces for composition, called Petri nets with bounda...

Descripción completa

Detalles Bibliográficos
Publicado: 2015
Materias:
Acceso en línea:https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_03029743_v9200_n_p205_Bruni
http://hdl.handle.net/20.500.12110/paper_03029743_v9200_n_p205_Bruni
Aporte de:
id paper:paper_03029743_v9200_n_p205_Bruni
record_format dspace
spelling paper:paper_03029743_v9200_n_p205_Bruni2023-06-08T15:28:56Z A normal form for stateful connectors Algebras of connectors Petri nets with boundaries Computation theory Computer circuits Petri nets Reconfigurable hardware Semantics Bisimilarity Finite state Non Determinism Normal form P/T net Calculations In this paper we consider a calculus of connectors that allows for the most general combination of synchronisation, non-determinism and buffering. According to previous results, this calculus is tightly related to a flavour of Petri nets with interfaces for composition, called Petri nets with boundaries. The calculus and the net version are equipped with equivalent bisimilarity semantics. Also the buffers (the net places) can be one-place (C/E nets) or with unlimited capacity (P/T nets). In the paper we investigate the idea of finding normal form representations for terms of this calculus, in the sense that equivalent (bisimilar) terms should have the same (isomorphic) normal form. We show that this is possible for finite state terms. The result is obtained by computing the minimal marking graph (when finite) for the net with boundaries corresponding to the given term, and reconstructing from it a canonical net and a canonical term. © Springer International Publishing Switzerland 2015. 2015 https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_03029743_v9200_n_p205_Bruni http://hdl.handle.net/20.500.12110/paper_03029743_v9200_n_p205_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 Algebras of connectors
Petri nets with boundaries
Computation theory
Computer circuits
Petri nets
Reconfigurable hardware
Semantics
Bisimilarity
Finite state
Non Determinism
Normal form
P/T net
Calculations
spellingShingle Algebras of connectors
Petri nets with boundaries
Computation theory
Computer circuits
Petri nets
Reconfigurable hardware
Semantics
Bisimilarity
Finite state
Non Determinism
Normal form
P/T net
Calculations
A normal form for stateful connectors
topic_facet Algebras of connectors
Petri nets with boundaries
Computation theory
Computer circuits
Petri nets
Reconfigurable hardware
Semantics
Bisimilarity
Finite state
Non Determinism
Normal form
P/T net
Calculations
description In this paper we consider a calculus of connectors that allows for the most general combination of synchronisation, non-determinism and buffering. According to previous results, this calculus is tightly related to a flavour of Petri nets with interfaces for composition, called Petri nets with boundaries. The calculus and the net version are equipped with equivalent bisimilarity semantics. Also the buffers (the net places) can be one-place (C/E nets) or with unlimited capacity (P/T nets). In the paper we investigate the idea of finding normal form representations for terms of this calculus, in the sense that equivalent (bisimilar) terms should have the same (isomorphic) normal form. We show that this is possible for finite state terms. The result is obtained by computing the minimal marking graph (when finite) for the net with boundaries corresponding to the given term, and reconstructing from it a canonical net and a canonical term. © Springer International Publishing Switzerland 2015.
title A normal form for stateful connectors
title_short A normal form for stateful connectors
title_full A normal form for stateful connectors
title_fullStr A normal form for stateful connectors
title_full_unstemmed A normal form for stateful connectors
title_sort normal form for stateful connectors
publishDate 2015
url https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_03029743_v9200_n_p205_Bruni
http://hdl.handle.net/20.500.12110/paper_03029743_v9200_n_p205_Bruni
_version_ 1768544594967920640