Concurrency cannot be observed, asynchronously - Département d'informatique Accéder directement au contenu
Article Dans Une Revue Mathematical Structures in Computer Science Année : 2015

Concurrency cannot be observed, asynchronously

Résumé

The paper is devoted to an analysis of the concurrent features of asynchronous systems. A preliminary step is represented by the introduction of a non-interleaving extension of barbed equivalence. This notion is then exploited in order to prove that concurrency cannot be observed through asynchronous interactions, i.e., that the interleaving and concurrent versions of a suitable asynchronous weak equivalence actually coincide. The theory is validated on some case studies, related to nominal calculi (π-calculus) and visual specification formalisms (Petri nets). Additionally, we prove that a class of systems which is deemed (output-buffered) asynchronous, according to a characterization that was previously proposed in the literature, falls into our theory.
Fichier non déposé

Dates et versions

hal-01284912 , version 1 (08-03-2016)

Identifiants

Citer

Filippo Bonchi, Fabio Gadducci, Paolo Baldan, Valentina Monreale. Concurrency cannot be observed, asynchronously. Mathematical Structures in Computer Science, 2015, ⟨10.1017/S0960129513000108⟩. ⟨hal-01284912⟩
129 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More