Skip to main content

Multiway synchronization verified with coupled simulation

  • Conference paper
  • First Online:
CONCUR '92 (CONCUR 1992)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 630))

Included in the following conference series:

Abstract

We consider the problem of implementing multiway synchronization in a distributed environment providing only binary asynchronous communication. Our implementation strategy is formulated as a transformation on transition systems and we give a distributed algorithm for multiway synchronization. Correctness assertions and proofs are based on a new method: coupled simulations. The coupled simulation equivalence is weaker than observation equivalence and stronger than testing equivalence and combines some of their advantages. Like observation equivalence (and unlike testing) it is established through case analysis over single transitions. Like testing equivalence (and unlike observation) it allows an internal choice to be distributed onto several internal choices. The latter is particularly important when relating our distributed implementations to their specifications.

Partly funded by NUTEK as part of Esprit Basic Research Action 3006: Concur.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R. J. R. Back and R. Kurki-Suonio. Distributed cooperation with action systems. ACM Transactions on Programming Languages and Systems, 10(4):513–554, 1988.

    Article  MATH  Google Scholar 

  2. R. Bagrodia. Process synchronization: Design and performance evaluation of distributed algorithms. IEEE Transactions on Software Engineering, 15(9):1053–1065, September 1989.

    Article  Google Scholar 

  3. T. Bolognesi and E. Brinksma. Introduction to the ISO specification language LOTOS. In P. H. J. van Eijk, C. A. Vissers, and M. Diaz, editors, The Formal Description Technique LOTOS, pages 23–73. North-Holland, 1989.

    Google Scholar 

  4. A. Charlesworth. The multiway rendezvous. ACM Transactions on Programming Languages and Systems, 9(2):350–366, July 1987.

    Article  MATH  Google Scholar 

  5. R. De Nicola and M. C. B. Hennessy. Testing equivalences for processes. Theoretical Computer Science, 34(1,2):83–133, 1984.

    Article  MATH  MathSciNet  Google Scholar 

  6. P. Eklund. Synchronizing multiple processes in common handshakes. Reports on Computer Science and Mathematics 39, Åbo Akademi, Finland, 1984.

    Google Scholar 

  7. M. Evangelist, N. Francez, and S. Katz. Multiparty interactions for interprocess communication and synchronization. IEEE Transactions on Software Engineering, 15(11):1417–1426, November 1989.

    Article  Google Scholar 

  8. N. Francez and I. R. Forman. Superimposition for interacting processes. In J. C. M. Baeten and J. W. Klop, editors, Proceedings of CONCUR '90, volume 458 of Lecture Notes in Computer Science, pages 230–245. Springer-Verlag, 1990.

    Google Scholar 

  9. N. Francez, B. Hailpern, and G. Taubenfeld. Script: A communication abstraction mechanism. Science of Computer Programming, 6(1):35–88, January 1986.

    Article  MATH  Google Scholar 

  10. Y.-J. Joung and S. A. Smolka. Coordinating first-order multiparty interactions. In Proc. 17th Annual ACM Symposium on Principles of Programming Languages, pages 209–220, Orlando, Florida, January 1991.

    Google Scholar 

  11. D. Kumar. An implementation of N-party synchronization using tokens. In Proc. 10th International Conference on Distributed Computing Systems, pages 320–327. IEEE, 1990.

    Google Scholar 

  12. R. Milner. Communication and Concurrency. Prentice Hall, 1989.

    Google Scholar 

  13. K. Mitchell. Implementations of Process Synchronization and their Analysis. PhD thesis, Department of Computer Science, University of Edinburgh, July 1986.

    Google Scholar 

  14. M. H. Park and M. Kim. A distributed synchronization scheme for fair multi-process handshakes. Information Processing Letters, 34(3):131–138, April 1990.

    Article  MATH  MathSciNet  Google Scholar 

  15. S. Ramesh. A new and efficient implementation of multiprocess synchronization. In Parallel Architectures and Languages Europe, volume 259 of Lecture Notes in Computer Science, pages 387–401. Springer-Verlag, 1987.

    Google Scholar 

  16. S. Ramesh and S. L. Mehndiratta. A methodology for developing distributed programs. IEEE Transactions on Software Engineering, SE-13(8):967–976, August 1987.

    Google Scholar 

  17. P. Sjödin. From LOTOS Specifications to Distributed Implementations. PhD thesis, Department of Computer Systems, Uppsala University, Uppsala, Sweden, 1991.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

W.R. Cleaveland

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Parrow, J., Sjödin, P. (1992). Multiway synchronization verified with coupled simulation. In: Cleaveland, W. (eds) CONCUR '92. CONCUR 1992. Lecture Notes in Computer Science, vol 630. Springer, Berlin, Heidelberg . https://doi.org/10.1007/BFb0084813

Download citation

  • DOI: https://doi.org/10.1007/BFb0084813

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55822-4

  • Online ISBN: 978-3-540-47293-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics