Adequacy of path programs

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 84)


Syntax and semantics of a subset of the path notation are introduced. Then a property of path programs called adequacy is defined; roughly, programs are adequate if there is no partial deadlock. Finally, two results are presented concerning adequacy. The first result solves the adequacy problem for a certain subclass of programs, and the second result characterises the problem in terms of PT-nets for another subclass. An overview of the results on adequacy which have been obtained so far is also given. Even so, this is intended to serve as an introductory text.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [CAH74]
    Campbell, R.H. and Habermann, A.N.: The Specification of Process Synchronisation by Path Expressions. In: Lecture Notes in Computer Science 16, Springer Verlag, Berlin 1974.Google Scholar
  2. [COM72]
    Commoner, F.: Deadlocks in Petri Nets. CA-7206/2311, Applied Data Research, Wakefield Massachusetts, June 1972.Google Scholar
  3. [GEL73]
    Genrich, H.J. and Lautenbach, K.: Synchronisationsgraphen. Acta informatica 2, 1973, pp. 143–161.CrossRefGoogle Scholar
  4. [GES80]
    Genrich, H.J. and Stankiewicz-Wiechno, E.: A Dictionary of Some Basic Notions of Net Theory. In this volume.Google Scholar
  5. [GLT80]
    Genrich, H.J., Lautenbach, K. and Thjagarajan, P.S.: An Overview of Net Theory. In this volume.Google Scholar
  6. [HAC72]
    Hack, M.H.T.: Analysis of Production Schemata by Petri Nets. TR-94, Project MAC, MIT, Boston, February 1972 (corrected June 1974).Google Scholar
  7. [JAV80]
    Jantzen, M. and Valk, R.: Formal Properties of Place-Transition Nets. In this volume.Google Scholar
  8. [LAC75]
    Lauer, P.E. and Campbell, R.H.: Formal Semantics for a Class of High-Level Primitives for Coordinating Concurrent Processes. Acta informatica 5, 1975, pp. 247–332.CrossRefGoogle Scholar
  9. [LAU75]
    Lautenbach, K.: Liveness in Petri Nets. GMD-ISF internal report, Bonn 1975.Google Scholar
  10. [LBS78]
    Lauer, P.E., Best, E. and Shields, M.W.: On the Problem of Achieving Adequacy of Concurrent Programs. In: Formal Description of Programming Concepts (ed. E. Neuhold), North Holland 1978.Google Scholar
  11. [LSB78]
    Lauer, P.E., Shields, M.W. and Best, E.: On the Design and Certification of Asynchronous Systems of Processes. Final Report, part II: Formal Theory of the Basic COSY Notation, ASM/45, Computing Laboratory, University of Newcastle upon Tyne, 1978 (also to appear as Technical Report).Google Scholar
  12. [LSB79]
    Lauer, P.E., Shields, M.W. and Best, E.: Design and Analysis of Highly Parallel and Distributed Systems. To appear in: Lecture Notes in Computer Science, Springer Verlag, Berlin 1979.Google Scholar
  13. [LTS79]
    Lauer, P.E., Torrigiani, P.R. and Shields, M.W.: COSY — a System Specification Language Based on Paths and Processes. Acta informatica 12, 1979, pp. 109–158.CrossRefGoogle Scholar
  14. [MER80]
    Memmi, G. and Roucairol, G.: Linear Algebra in Net Theory. In this volume.Google Scholar
  15. [ROU80]
    Roucairol, G. and Valk, R.: Reductions of Nets and Parallel Programs. In this volume.Google Scholar
  16. [SHI79]
    Shields, M.W.: Adequate Path Expressions. TR/142, University of Newcastle upon Tyne, 1979; also in: Proceedings of the International Symposium on Semantics of Concurrent Computation, in: Lecture Notes in Computer Science 70, Springer Verlag, Berlin 1970.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1980

Authors and Affiliations

  • E. Best
    • 1
  1. 1.Computing LaboratoryUniversity of Newcastle upon TyneEngland

Personalised recommendations