Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
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.
Commoner, F.: Deadlocks in Petri Nets. CA-7206/2311, Applied Data Research, Wakefield Massachusetts, June 1972.
Genrich, H.J. and Lautenbach, K.: Synchronisationsgraphen. Acta informatica 2, 1973, pp. 143–161.
Genrich, H.J. and Stankiewicz-Wiechno, E.: A Dictionary of Some Basic Notions of Net Theory. In this volume.
Genrich, H.J., Lautenbach, K. and Thjagarajan, P.S.: An Overview of Net Theory. In this volume.
Hack, M.H.T.: Analysis of Production Schemata by Petri Nets. TR-94, Project MAC, MIT, Boston, February 1972 (corrected June 1974).
Jantzen, M. and Valk, R.: Formal Properties of Place-Transition Nets. In this volume.
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.
Lautenbach, K.: Liveness in Petri Nets. GMD-ISF internal report, Bonn 1975.
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.
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).
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.
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.
Memmi, G. and Roucairol, G.: Linear Algebra in Net Theory. In this volume.
Roucairol, G. and Valk, R.: Reductions of Nets and Parallel Programs. In this volume.
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.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1980 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Best, E. (1980). Adequacy of path programs. In: Brauer, W. (eds) Net Theory and Applications. Lecture Notes in Computer Science, vol 84. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10001-6_29
Download citation
DOI: https://doi.org/10.1007/3-540-10001-6_29
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10001-0
Online ISBN: 978-3-540-39322-1
eBook Packages: Springer Book Archive