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). © 2010 Springer-Verlag.
Cite
CITATION STYLE
Baldan, P., Bonchi, F., Gadducci, F., & Monreale, G. V. (2010). Concurrency can’t be observed, asynchronously. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6461 LNCS, pp. 424–438). Springer Verlag. https://doi.org/10.1007/978-3-642-17164-2_29
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
