Advertisement

Synchronization of Concurrent Processes without Globality Assumptions

  • P. E. Lauer
Conference paper
Part of the Nato Advanced Study Institutes Series book series (ASIC, volume 80)

Abstract

The mathematically precise definition of a simple notation for designing and Implementing programs involving synchronization of parallel processes introduced by C.A.R. Hoare in (2) and (3) Is expressed in the COSY formalism. The latter formalism not only generalizes the semantic trace model used by Hoare but also reduces the complexity of the formalism for representing concurrency and simplifies the proofs of correctness carried out in the model. A number of versions of Hoare’s examples are developed and absence of partial or total system deadlock is demonstrated.

Keywords

Regular Expression Sequential System Event Occurrence Concurrent System Concurrent Process 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Net theory and Applications: Proceedings of the Advanced Course on General Net Theory of Processes and Systems, Hamburg 1979 (Ed. W. Brauer) Lecture Notes in Computer Science 84, Springer Verlag 1980.Google Scholar
  2. 2.
    Hoare, C.A.R.: Synchronisation of Parallel Processes. In: Advanced Techniques for Microprocessor Systems. (Ed. F.K. Hanna ), Peter Peregrinus Ltd. 1980.Google Scholar
  3. 3.
    Hoare, C.A.R.: Communicating Sequential Processes. Ins On the construction of programs. (Eds. McKeag and MacNaghten) Cambridge University Press 1980.Google Scholar
  4. 4.
    Milner, R.2: A Calculus of Communicating Systems. Lecture Notes in Computer Science 921 Springer Verlag 1980.Google Scholar
  5. 5.
    Lauer, P.E., Campbell, R.H.: Pormal semantics for a class of high level primitives for coordinating concurrent processes. Acta Informatica 5, 247–332 (1975).MathSciNetCrossRefGoogle Scholar
  6. 6.
    Lauer, P.E., Shields, M.W., Best, E.: The design and certification of asynchronous systems of processes. Proc. of EEC Advanced Course on Abstract Software Specification, Lyngby, Jan. 22 — Feb. 2, 1979. Lecture Notes in Computer Science, No. 86, Springer Verlag, 1979, pp. 451–503.Google Scholar
  7. 7.
    Lauer, P.E., Torrigiani, P.R., Shields, M.W.: COSY: a system specification language based on paths and processes. Acta Informatica, Vol. 12, pp. 109–158, 1979.CrossRefMATHGoogle Scholar
  8. 8.
    Lauer, P.E., Shields, M.W.: Abstract specification of resource accessing disciplines:: adequacy, starvation, priority and interrupts. SIGPLAN Notices, Vol. 13, No. 12, Dec. 1978.Google Scholar
  9. 9.
    Lauer, P.E., Shields, M.W.: COSY An environment for development and analysis of concurrent and distributed svstems. In: Software Engineering Environments (Ed. H. Hunke) North Holland 1981.Google Scholar
  10. 10.
    Shields, M.W.: Adequate Path Expressions. Proc. Symp. on the Semantics of Concurrent Computation, Evian-les-Bains, July 2–4, 1979. Lecture Notes in Computer Science Vol. 70, Springer Verlag 1979.Google Scholar
  11. 11.
    Shields, M.W., Lauer, P.E.: On the abstract specification and formal analysis of synchronization properties of concurrent systems. Proc. of Int. Conf. on Mathematical Studies of Information Processing. Aug. 23–26, Kyoto, 1978. Lecture Notes in Computer Science 75, Springer Verlag 1979, pp. 1–32.Google Scholar
  12. 12.
    Shields, M.W,, Lauer, P.E.: A formal semantics for concurrent systems. Proc. 6th Int. Colloqu. for Automata, Languages and Programming, July 16–21, 1979 Graz, Lecture Notes in Computer Science, 71, Springer Verlag, 1979, pp. 569–584.MathSciNetGoogle Scholar
  13. 13.
    Shields, M.W., Lauer, P.E.: Verifying concurrent system specification in COSY. Proc. 8th Symposium on Mathematical Foundations of Computer Science, Aug. 31 — Sept. 6, 1980, Poland. Lecture Notes in Computer Science, No. 88, Springer Verlag 1980, pp. 576–586.Google Scholar
  14. 14.
    Lauer, P.E., Torrigiani, P.R., Devillers, R.: A COSY Bankers Specification of highly parallel and distributed resource management. Proc. 4th International Symposium on Programming, Paris, April 22–24, 1980. Lecture Notes in Computer Science, 83, Springer Verlag 1980, pp. 223–239.Google Scholar
  15. 15.
    Campbell, R.H., Habermann, A.N.: The specification of process synchronization by path expressions. Lecture Notes in Computer Science V. 16, Springer Verlag, pp. 89–102.Google Scholar
  16. 16.
    Best, E.: Adequacy of Path Programs In: Net Theory and Applications: Proceedings of the Advanced Course on General Net Theory of Processes and Systems. Hamburg, 1979. (Ed. Prof. Wilfried Brauer). Lecture Notes in Computer Science 84, Springer Verlag 1980.Google Scholar
  17. 17.
    Lauer, P.E., Shields, M.W., Best, E.: Formal Theory of the Basic COSY Notation. The Computing Laboratory, University of Newcastle upon Tyne, Tech. Rep. Series No. 143, November 1979.Google Scholar

Copyright information

© D. Reidel Publishing Company 1982

Authors and Affiliations

  • P. E. Lauer
    • 1
  1. 1.Computing LaboratoryUniversity of Newcastle upon TyneNewcastle upon TyneUK

Personalised recommendations