Skip to main content

Synchrony loosening transformations for interacting processes

  • Selected Presentations
  • Conference paper
  • First Online:
CONCUR '91 (CONCUR 1991)

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

Included in the following conference series:

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. Krzysztof R. Apt. Ten years of Hoare's logic: A survey — part i. ACM Transactions on Programming Languages and Systems, 3(4):431–483, October 1981.

    Google Scholar 

  2. Paul C. Attie. A guide to raddle87 semantics. Technical Report STP-340-87, MCC, January 11 1988.

    Google Scholar 

  3. 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 

  4. Ralph-J. R. Back. A calculus of refinement for program derivation. Acta Informatica, 25:593–624, 1988.

    Google Scholar 

  5. Ralph-J. R. Back. Changing the data representation in the refinement calculus. In 21 Hawaii International Conference on Systems Science, January 1989.

    Google Scholar 

  6. Ralph-J. R. Back. Refining atomicity in parallel programs. In PARLE conference on parallel architectures and languages in Europe, Eindhoven, The Netherlands, June 1989. LNCS 366, Springer-Verlag.

    Google Scholar 

  7. Ralph-J. R. Back. Refinement calculus, part II: Parallel and reactive systems. In REX workshop on refinements of distributed systems, pages 67–93. LNCS 430, Springer-Verlag, 1990.

    Google Scholar 

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

    Google Scholar 

  9. Ralph-J. R. Back and Reino Kurki-Suonio. Decentralization of process nets with centralized control. Distributed Computing, 3:73–87, 1989.

    Google Scholar 

  10. Ralph-J. R. Back and Kaisa Sere. Refinement of action systems. Science of Computer Programming, 13:133–180, 1989/90. Preliminary form in Mathematics in program construction, LNCS 375, Springer-Verlag.

    Google Scholar 

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

    Google Scholar 

  12. E. Chang and R. Roberts. An improved algorithm for decentralized extrema finding in circular configuration of processes. Communications of the ACM, 122(5):281–283, May 1979.

    Google Scholar 

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

    Google Scholar 

  14. Tzilla Elrad and Nissim Francez. Weakest precondition semantics for communicating processes. TCS, 29(3):231–250, April 1984.

    Google Scholar 

  15. Ira R. Forman. On the design of large distributed systems. In First international conference on computer languages, pages 84–95, October 1987.

    Google Scholar 

  16. Ira R. Forman. Design by decomposition of multiparty interactions in raddle87. In Fifth International Workshop on Software Specification and Design, pages 2–10, Pittsburgh, Pa., May 19–20 1989.

    Google Scholar 

  17. Ira R. Forman. Leader election: An exercise in Raddle design. Technical Report STP-270-87, MCC, Austin, TX, September 9, 1988.

    Google Scholar 

  18. Ira R. Forman and W. Michael Evangelist. Eft: A case study in design using raddle. Technical Report STP-121-87, Microelectronics and Computer Technology Corp., April 1987.

    Google Scholar 

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

    Google Scholar 

  20. 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 

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

    Google Scholar 

  22. Nissim Francez and Ira R. Forman. Superimposition for interacting processes. In Proc. Concur'90: Theories of concurrency — unification and extension, Amsterdam, The Netherlands, August 27–30 1990.

    Google Scholar 

  23. C. A. R. Hoare. Proof of correctness of data representations. Acta Informatica, 1(19):271–281, 1972.

    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. Gary Levin and David Gries. Proof techniques for communicating sequential processes. Acta Informatica, 15:281–302, 1981.

    Google Scholar 

  26. M. Staskauskas. The formal specification and design of a distributed electronic funds-transfer system. IEEE Trans. on Computers, 37(12):1515–1528, December 1988.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Jos C. M. Baeten Jan Frisco Groote

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Francez, N., Forman, I.R. (1991). Synchrony loosening transformations for interacting processes. In: Baeten, J.C.M., Groote, J.F. (eds) CONCUR '91. CONCUR 1991. Lecture Notes in Computer Science, vol 527. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54430-5_90

Download citation

  • DOI: https://doi.org/10.1007/3-540-54430-5_90

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-54430-2

  • Online ISBN: 978-3-540-38357-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics