Concurrency can't be observed, asynchronously

Authors:
Paolo Baldan;Filippo Bonchi;Fabio Gadducci;Giacoma Valentina Monreale
Affiliations:
Dipartimento di Matematica Pura e Applicata, Università Padova;Laboratoire de l'Informatique du Parallélisme, ENS Lyon;Dipartimento di Informatica, Università di Pisa;Dipartimento di Informatica, Università di Pisa
Venue:
APLAS'10 Proceedings of the 8th Asian conference on Programming languages and systems
Year:
2010

Citing 30
Cited 0

Petri net models for algebraic theories of concurrency

Volume II: Parallel Languages on PARLE: Parallel Architectures and Languages Europe
On reduction-based process semantics

Selected papers of the thirteenth conference on Foundations of software technology and theoretical computer science
The reflexive CHAM and the join-calculus

POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Some congruence properties for &pgr;-calculus bisimilarities

Theoretical Computer Science
Communicating and mobile systems: the &pgr;-calculus

Communicating and mobile systems: the &pgr;-calculus
Comparing three semantics for Linda-like languages

Theoretical Computer Science
Mobile ambients

Theoretical Computer Science
Communication and Concurrency

Communication and Concurrency
Equivalence Notions for Concurrent Systems and Refinement of Actions (Extended Abstract)

MFCS '89 Proceedings on Mathematical Foundations of Computer Science 1989
An Object Calculus for Asynchronous Communication

ECOOP '91 Proceedings of the European Conference on Object-Oriented Programming
Causal Trees

ICALP '89 Proceedings of the 16th International Colloquium on Automata, Languages and Programming
Barbed Bisimulation

ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
First-Order Axioms for Asynchrony

CONCUR '97 Proceedings of the 8th International Conference on Concurrency Theory
Deriving Bisimulation Congruences for Reactive Systems

CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Process Algebra with Asynchronous Communication Mechanisms

Seminar on Concurrency, Carnegie-Mellon University
The Linear Time-Branching Time Spectrum (Extended Abstract)

CONCUR '90 Proceedings of the Theories of Concurrency: Unification and Extension
A Petri Net Semantics for pi-Calculus

CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
On Bisimulations for the Asynchronous pi-Calculus

CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
A Compositional Partial Order Semantics for Petri Net Components

ICATPN '97 Proceedings of the 18th International Conference on Application and Theory of Petri Nets
Partial orderings descriptions and observations of nondeterministic concurrent processes

Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop
Comparing the expressive power of the synchronous and asynchronous $pi$-calculi

Mathematical Structures in Computer Science
Compositional semantics for open Petri nets based on deterministic processes

Mathematical Structures in Computer Science
Concurrent and Located Synchronizations in π-Calculus

SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
On the Asynchronous Nature of the Asynchronous Π-Calculus

Concurrency, Graphs and Models
Towards a Unified Approach to Encodability and Separation Results for Process Calculi

CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
Symmetric and Asymmetric Asynchronous Interaction

Electronic Notes in Theoretical Computer Science (ENTCS)
Encoding Asynchronous Interactions Using Open Petri Nets

CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Bisimulation proof methods for mobile ambients

ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Semantic barbs and biorthogonality

FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
Compositional event structure semantics for the internal π-calculus

CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 two case studies, related to nominal calculi (π-calculus) and visual specification formalisms (Petri nets).