Skip to main content Accessibility help
×
×
Home

Concurrency cannot be observed, asynchronously

  • PAOLO BALDAN (a1), FILIPPO BONCHI (a2), FABIO GADDUCCI (a3) and GIACOMA VALENTINA MONREALE (a4)
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 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.

Copyright
Footnotes
Hide All

Supported by the MIUR project SisteR and the University of Padova project AVIAMO.

Footnotes
References
Hide All
Agerwala, T. and Flynn, M. J. (1973) Comments on capabilities, limitations and ‘correctness’ of Petri nets. Computer Architecture News 4 (2)8186.
Amadio, R. M., Castellani, I. and Sangiorgi, D. (1996) On bisimulations for the asynchronous π-calculus. In: Proceeding of CONCUR'96. Springer Lecture Notes In Computer science 1119 147162.
Baldan, P., Bonchi, F. and Gadducci, F. (2009) Encoding asynchronous interactions using open Petri nets. In: Proceeding of CONCUR'09. Springer Lecture Notes In Computer Science 5710 99114.
Baldan, P., Bonchi, F., Gadducci, F. and Monreale, G. V. (2010) Concurrency can't be observed, asynchronously. In: Proceeding of APLAS'10. Springer Lecture Notes In Computer Science 6461 424438.
Baldan, P., Corradini, A., Ehrig, H. and Heckel, R. (2005) Compositional semantics for open Petri nets based on deterministic processes. Mathematical String in Computer Science 15 (1)135.
Beauxis, R., Palamidessi, C. and Valencia, F. D. (2008) On the asynchronous nature of the asynchronous π-calculus. Concurrency, Graphs and Models, Lecture Notes in Computer Science volume 5065 Springer 473492.
Bergstra, J. A., Klop, J. W. and Tucker, J. V. (1984) Process algebra with asynchronous communication mechanisms. Seminar on Concurrency, Lecture Notes in Computer Science volume 197 Springer 7695.
Bonchi, F., Gadducci, F. and Monreale, G. V. (2010) On barbs and labels in reactive systems. In: Proceeding of SOS'09. Electronic Proceedings in Theoretical Computer Science 18 4661.
Boreale, M. and Sangiorgi, D. (1998) Some congruence properties for π-calculus bisimilarities. Theoretical Computer Science 198 (1–2)159176.
Boudol, G. (1992) Asynchrony and the π-calculus. Technical Report 1702, INRIA.
Boudol, G., Castellani, I., Hennessy, M. and Kiehn, A. (1991) Observing localities. In: Proceeding of MFCS'91. Springer Lecture Notes in Computer Science 520 93102.
Bruni, R., Melgratti, H. C. and Montanari, U. (2006) Event structure semantics for dynamic graph grammars. In: Proceeding of PNGT'06. EASST 2.
Busi, N. and Gorrieri, R. (1995) A Petri net semantics for π-calculus. In: Proceeding of CONCUR'95. Springer Lecture Notes in Computer Science 962 145159.
Busi, N., Gorrieri, R. and Zavattaro, G. (2000) Comparing three semantics for linda-like languages. Theoretical Computer Science 240 (1)4990.
Cardelli, L. and Gordon, A. D. (2000) Mobile ambients. Theoretical Computer Science 240 (1)177213.
Crafa, S., Varacca, D. and Yoshida, N. (2007) Compositional event structure semantics for the internal π-calculus. In: Proceeding of CONCUR'07. Springer Lecture Notes in Computer Science 4703 317332.
Darondeau, P. and Degano, P. (1989) Causal trees. In: Proceeding of ICALP'89. Springer Lecture Notes in Computer Science 372 234248.
de Boer, F.S., Klop, J. W. and Palamidessi, C. (1992) Asynchronous communication in process algebra. Proceeding of LICS'92, IEEE Computer Society 137147.
Degano, P., Nicola, R. D. and Montanari, U. (1988) Partial orderings descriptions and observations of nondeterministic concurrent processes. In: Proceeding of REX Workshop. Springer Lecture Notes in Computer Science 354 438466.
Fournet, C. and Gonthier, G. (1996) The reflexive CHAM and the Join-calculus. Proceeding of POPL'96. ACM Press 372385.
Fournet, C. and Gonthier, G. (2005) A hierarchy of equivalences for asynchronous calculi. Journal of Logic and Algebraic Programming 63 (1)131173.
Gorla, D. (2008) Towards a unified approach to encodability and separation results for process calculi. In: Proceeding of CONCUR'08. Springer Lecture Notes in Computer Science 5201 492507.
Habel, A., Heckel, R. and Taentzer, G. (1996) Graph grammars with negative application conditions. Fundamenta Informaticae 26 (3/4)287313.
Honda, K. and Tokoro, M. (1991) An object calculus for asynchronous communication. In: Proceeding of ECOOP'91. Springer Lecture Notes in Computer Science 512 133147.
Honda, K. and Yoshida, N. (1995) On reduction-based process semantics. Theoretical Computer Science 151 (2)437486.
Kindler, E. (1997) A compositional partial order semantics for Petri net components. In: Proceeding of ATPN'97. Springer Lecture Notes in Computer Science 1248 235252.
Lanese, I. (2007) Concurrent and located synchronizations in π-calculus. In: Proceeding of SOFSEM'07. Springer Lecture Notes in Computer Science 4362 388399.
Leifer, J. J. and Milner, R. (2000) Deriving bisimulation congruences for reactive systems. In: Proceeding of CONCUR'00. Springer Lecture Notes in Computer Science 1877 243258.
Merro, M. and Nardelli, F. Z. (2003) Bisimulation proof methods for mobile ambients. In: Proceeding of ICALP'03. Springer Lecture Notes In Computer Science 2719 584598.
Milner, R. (1989) Communication and Concurrency, Prentice Hall.
Milner, R. (1999) Communicating and Mobile Systems: the π-Calculus, Cambridge University Press.
Milner, R. (2003) Bigraphs for Petri nets. In: Lectures on Concurrency and Petri Nets. Springer Lecture Notes in Computer Science 3098 686701.
Milner, R. and Sangiorgi, D. (1992) Barbed bisimulation. In: Proceeding of ICALP'92. Springer Lecture Notes in Computer Science 623 685695.
Montanari, U. and Pistore, M. (1995) Concurrent semantics for the π-calculus. In: Proceeding of MFPS'95. Electronic Notes in Theoretical Computer Science 1.
Palamidessi, C. (2003) Comparing the expressive power of the synchronous and asynchronous π-calculi. Mathematical String in Computer Science 13 (5)685719.
Phillips, I. (2008) CCS with priority guards. Journal of Logic and Algebraic Programming 75 (1)139165.
Rathke, J., Sassone, V. and Sobociński, P. (2007) Semantic barbs and biorthogonality. In: Proceeding of FoSSaCS'07. Springer Lecture Notes in Computer Science 4423 302316.
Sassone, V. and Sobociński, P. (2005) A congruence for Petri nets. Proceeding of PNGT'04. Electronic Notes in Theoretical Computer Science 127 107120.
Selinger, P. (1997) First-order axioms for asynchrony. In: Proceeding of CONCUR'97. Springer Lecture Notes in Computer Science 1243 376390.
van Glabbeek, R. J. (1990) The linear time-branching time spectrum. In: Proceeding of CONCUR'90. Springer Lecture Notes in Computer Science 458 278297.
van Glabbeek, R. J. and Goltz, U. (1989) Equivalence notions for concurrent systems and refinement of actions. In: Proceeding of MFCS'89. Springer Lecture Notes in computer Science 379 237248.
van Glabbeek, R. J., Goltz, U. and Schicke, J. W. (2009) Symmetric and asymmetric asynchronous interaction. In: Proceeding of ICE'08. Electronic Notes in Theoretical Computer Science 229 (3)7795.
van Glabbeek, R. J. and Vaandrager, F. W. (1987) Petri net models for algebraic theories of concurrency. In: Proceeding of PARLE'87. Springer Lecture Notes in Computer Science 259 224242.
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Mathematical Structures in Computer Science
  • ISSN: 0960-1295
  • EISSN: 1469-8072
  • URL: /core/journals/mathematical-structures-in-computer-science
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed