Superimposition for interacting processes | SpringerLink
Skip to main content
Springer Nature Link
Log in

Superimposition for interacting processes

  • Selected Presentations
  • Conference paper
  • First Online:
CONCUR '90 Theories of Concurrency: Unification and Extension (CONCUR 1990)

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

Included in the following conference series:

  • 177 Accesses

Abstract

The paper defines an operator for superimposition, in contrast to previous transformational views. It does so in the context of the multiparty interaction as the primitive for synchronization and interprocess communication in distributed programs. The operator is given a (structured) operational semantics, and some aspects of its methodological importance are discussed. The papers distills the essentials of superimposition, in contrast to other approaches where its role is mixed with other programming aspects. A simple example of its use is provided. Large design examples and more details are presented elsewhere.

On sabbatical from Computer Science Dept., Technion, Haifa, Israel

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Paul C. Attie, Nissim Francez, and Orna Grumberg. Fairness and hyperfairness in multi-party interactions. In 17th ACM-POPL, pages 292–305, San-Francisco, CA, January 17–19 1990.

    Google Scholar 

  2. Krzysztof R. Apt, Nissim Francez, and Shmuel M. Katz. Appraising fairness in distributed languages. Distributed Computing, 2:226–241, August 1988.

    Google Scholar 

  3. Luc Bougé and Nissim Francez. A compositional approach to superimposition. In 15th ACM-POPL, pages 240–249, San Diego, CA, January 13–15 1988.

    Google Scholar 

  4. Ralph-J. R. Back and Reino Kurki-Suonio. Distributed cooperation with action systems. TOPLAS, 10(4):513–554, October 1988.

    Google Scholar 

  5. Luc Bougé. Symmetry and generity for CSP distributed systems. Technical Report, LITP, Univ. Paris, May 7 1985.

    Google Scholar 

  6. G. N. Buckley and A. Silberschatz. An efficient implementation for the generalized input-output construct of csp. ACM Trans. on Programming Languages and Systems, 5(2):223–235, April 1983.

    Google Scholar 

  7. B. Caillaud. The superimposition of estelle programs: a tool for the implementation of observation and control algorithms. In FORTE '89, October 1989.

    Google Scholar 

  8. K. Mani Chandy and Leslie Lamport. Distributed snapshots: determining global states of distributed systems. ACM Transactions on Computer Systems, 3(1):63–75, February 1985.

    Google Scholar 

  9. K. Mani Chandy and Jayadev Misra. Parallel program design: A foundation. Addison-Wesley, 1988.

    Google Scholar 

  10. Edsger W. Dijkstra. Guarded commands, nondterminacy and, formal derivation of programs. Communications of the ACM, 18(8):453–457, August 1975.

    Google Scholar 

  11. Edsger W. Dijkstra and C. S. Scholten. Termination detection for diffusing computations. IPL, 11(1):1–4, 1980.

    Google Scholar 

  12. Tzilla Elrad and Nissim Francez. Decomposition of distributed programs into communication-closed layers. SCP, 2:155–173, 1982.

    Google Scholar 

  13. Nissim Francez and Ira R. Forman. Conflict propagation. In IEEE International Conference on Computer Languages (ICCL'90), pages 155–168, New Orleans, LA, March 12–15 1990.

    Google Scholar 

  14. Nissim Francez and Ira R. Forman. Interacting Processes: A Multiparty Approach to Coordinated Distributed Programming. Forthcoming book, 1990.

    Google Scholar 

  15. Limor Fix, Nissim Francez, and Orna Grumberg. Semantics-driven decomposition for the verification of distributed programs. In IFIP WG 2.2/2.3 working conference on programming concepts and methods, Sea of Galilee, Israel, April 2–5 1990.

    Google Scholar 

  16. Nissim Francez. Distributed termination. ACM Trans. on Programming Languages and Systems, 2(1):42–55, January 1980.

    Google Scholar 

  17. Nissim Francez. Cooperative proofs for distributed programs with multi-party interactions. IPL, 32:235–242, September 22 1989.

    Google Scholar 

  18. E. Gafni. Perspectives on distributed network protocols: a case for building blocks. In Proc. MILCOMM 86, October 1986.

    Google Scholar 

  19. Orna Grumberg, Nissim Francez, and Shmuel M. Katz. Fair termination of communicating processes. In Third ACM-PODC, Vancouver, BC, Canada, August 1984.

    Google Scholar 

  20. R. G. Gallager, R. A. Humblet, and P. M. Spira. A distributed algorithm for minimum-weight spanning trees. IEEE Trans. on Communications, 31(6):756–762, 1983.

    Google Scholar 

  21. C. A. R. Hoare. Communicating sequential processes. Communications of the ACM, 21(8):666–677, August 1978.

    Google Scholar 

  22. Shmuel M. Katz. A superimposition control construct for distributed systems. Technical Report, Microelectronics and Computer Technology Corp., August 1987.

    Google Scholar 

  23. Shmuel M. Katz. A superimposition control construct for distributed systems. Submitted to ACM-TOPLAS, November 1989.

    Google Scholar 

  24. Shmuel M. Katz, Ira R. Forman, and W. Michael Evangelist. Language constructs for distributed systems. In IFIP TC2 Working Conference on Programming Concepts and Methods, Sea of Galilee, Israel, April 2–5 1990.

    Google Scholar 

  25. Reino Kurki-Suonio and Hannu-Matti Jävinen. Action system approach to the specification and design of distributed systems. In Proceedings Fifth Int'l Workshop on Software Specification and Design, pages 34–40, May 19–20 1989.

    Google Scholar 

  26. E. Korach, S. Kutten, and S. Moran. A modular technique for the design of efficient distributed leader finding algorithms. In Proc. 4th Annual ACM Symp. on Principles of Distributed Computing, 1985.

    Google Scholar 

  27. Gordon D. Plotkin. An operational semantics for csp. In D. Bjorner, editor, Formal description of programming concepts, North-Holland, Amsterdam, 1983. IFIP TC.2 WG conference, Garmisch Partenkierchen.

    Google Scholar 

  28. J. S. Schwarz. Distributed synchronization of communicating sequential processes. Technical Report, Dept. Artificial Intelligence, Univ. Edinburgh, 1978.

    Google Scholar 

  29. Frank A. Stomp and Willem P. De Roever. A correctness proof of a distributed minimum-weight spanning tree algorithm. Technical Report, Dept. Informatics, Nimegen Univ., April 1987.

    Google Scholar 

  30. Nir Shavit and Nissim Francez. A new approach to detection of totally indicative stability. In Proc. 13th ICALP, July 1986.

    Google Scholar 

  31. G. Tel, R. B. Tan, and J. van Leeuwen. The derivation of graph marking algorithms from distributed termination algorithms. Technical Report, Univ. Utrecht, August 1986.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Microelectronics and Computer Technology Corp., Austin, Texas

    Nissim Francez & Ira R. Forman

Authors
  1. Nissim Francez
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ira R. Forman
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

J. C. M. Baeten J. W. Klop

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Francez, N., Forman, I.R. (1990). Superimposition for interacting processes. In: Baeten, J.C.M., Klop, J.W. (eds) CONCUR '90 Theories of Concurrency: Unification and Extension. CONCUR 1990. Lecture Notes in Computer Science, vol 458. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0039063

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-53048-0

  • Online ISBN: 978-3-540-46395-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation