Skip to main content Accessibility help
×
Home

Synchrony versus causality in distributed systems

  • KIRSTIN PETERS (a1), JENS-WOLFHARD SCHICKE-UFFMANN (a2), URSULA GOLTZ (a2) and UWE NESTMANN (a1)

Abstract

Given a synchronous system, we study the question whether – or, under which conditions – the behaviour of that system can be realized by a (non-trivially) distributed and hence asynchronous implementation. In this paper, we partially answer this question by examining the role of causality for the implementation of synchrony in two fundamental different formalisms of concurrency, Petri nets and the π-calculus. For both formalisms it turns out that each ‘good’ encoding of synchronous interactions using just asynchronous interactions introduces causal dependencies in the translation.

Copyright

Footnotes

Hide All

This work was supported by the DFG (German Research Foundation), grants NE-1505/2-1 and GO-671/6-1.

Footnotes

References

Hide All
Badouel, É., Caillaud, B. and Darondeau, P. (2002) Distributing finite automata through petri net synthesis. Formal Aspects of Computing 13 447470.
Boreale, M. and Sangiorgi, D. (1998) A fully abstract semantics for causality in the π-calculus. Acta Informatica 35 (5) 353400.
Boudol, G. (1992) Asynchrony and the π-calculus (note). INRIA Research Report RR-1702.
Busi, N. and Gorrieri, R. (1995) A Petri net semantics for π-calculus. In: Proceedings of the 6th International Conference on Concurrency Theory, Lecture Notes in Computer Science 962 145159.
Carbone, M. and Maffeis, S. (2003) On the expressive power of polyadic synchronisation in π-calculus. Nordic Journal of Computing 10 129.
Degano, P. and Priami, C. (1999) Non-interleaving semantics for mobile processes. Theoretical Computer Science 216 (1) 237270.
Fournet, C. and Gonthier, G. (1996) The reflexive chemical abstract machine and the join-calculus. In: Proceedings of the 23rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 372–385.
van Glabbeek, R. J. (1993) The linear time - branching time spectrum II. In: Proceedings of the 4th International Conference on Concurrency Theory, 66–81.
van Glabbeek, R. J. and Goltz, U. (2001) Refinement of actions and equivalence notions for concurrent systems. Acta Informatica 37 (4/5) 229327.
van Glabbeek, R. J., Goltz, U. and Schicke, J.-W. (2008) On synchronous and asynchronous interaction in distributed systems. Technical Report 2008-04, TU Braunschweig. Extended abstract in Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science, Lecture Notes in Computer Science 5162 1635. (Available at http://arxiv.org/abs/0901.0048v1.)
van Glabbeek, R. J., Goltz, U. and Schicke-Uffmann, J.-W. (2012) On distributability of Petri nets (extended abstract). In: Proceedings of the 15th International Conference on Foundations of Software Science and Computation Structures, Lecture Notes in Computer Science 7213 331345.
Gorla, D. (2008) Comparing communication primitives via their relative expressive power. Information and Computation 206 (8) 931952.
Gorla, D. (2010) Towards a unified approach to encodability and separation results for process calculi. Information and Computation 208 (9) 10311053.
Honda, K. (1992) Notes on soundness of a mapping from π-calculus to ν-calculus. With comments added in October 1993.
Honda, K. and Tokoro, M. (1991) An object calculus for asynchronous communication. Proceedings of the European Conference on Object-Oriented Programming, Lecture Notes in Computer Science 512 133147.
Hopkins, R. P. (1991) Distributable nets. In: Advances in Petri Nets. Lecture Notes in Computer Science 524 161187.
Milner, R. and Sangiorgi, D. (1992) Barbed bisimulation. In: Proceedings of the 19th International Colloquium on Automata, Languages and Programming, Lecture Notes in Computer Science 623 685695.
Nestmann, U. (1998) On the expressive power of joint input. In: Proceedings of the Fifth International Workshop on Expressiveness in Concurrency, Electronic Notes in Theoretical Computer Science 16 145152.
Nestmann, U. (2000) What is a ‘Good’ encoding of guarded choice?. Information and Computation 156 (1–2) 287319.
Palamidessi, C. (2003) Comparing the expressive power of the synchronous and the asynchronous π-calculi. Mathematical Structures of Computer Science 13 (5) 685719.
Parrow, J. (2008) Expressiveness of process algebras. Electronic Notes in Theoretical Computer Science 209 173186.
Peters, K. (2012) Translational Expressiveness|Comparing Process Calculi using Encodings, Ph.D. thesis, TU Berlin. (Available at: http://nbn-resolving.de/urn:nbn:de:kobv:83-opus-37495)
Peters, K. and Nestmann, U. (2010) Breaking symmetries. Electronic Proceedings in Theoretical Computer Science 41 136150.
Peters, K. and Nestmann, U. (2012) Is it a ‘Good’ encoding of mixed choice? In: Proceedings of the 15th International Conference on Foundations of Software Science and Computational Structures. Lecture Notes in Computer Science 7213 210224.
Peters, K., Nestmann, U. and Goltz, U. (2013) On distributability in process calculi. In: Proceedings of the 22nd European conference on Programming Languages and Systems. Lecture Notes in Computer Science 310–329.
Petri, C. A. (1977) Non-sequential processes. GMD-ISF Report 77.05, GMD.
Pratt, V. R. (1985) The pomset model of parallel processes: Unifying the temporal and the spatial. In: Seminar on Concurrency, Carnegie-Mellon University 180–196.
Priami, C. (1996) Enhanced Operational Semantics for Concurrency, Ph.D. thesis, Universita' di Pisa-Genova-Udine.
Reisig, W. (1984) Partial order semantics versus interleaving semantics for CSP-like languages and its impact on fairness. In: Proceedings of the 11th Colloquium on Automata, Languages and Programming 403–413.
Sangiorgi, D. and Walker, D. (2001) The π-Calculus: A Theory of Mobile Processes, Cambridge University Press, NY, USA.
Schicke, J.-W. (2008) Studienarbeit: Asynchronous Petri net classes. TU Braunschweig.
Schicke, J.-W. (2009) Diplomarbeit: Synchrony and asynchrony in Petri nets. TU Braunschweig.

Synchrony versus causality in distributed systems

  • KIRSTIN PETERS (a1), JENS-WOLFHARD SCHICKE-UFFMANN (a2), URSULA GOLTZ (a2) and UWE NESTMANN (a1)

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.