Abstract
One of the objections to the use of Petri nets or, equivalently, specifications written in the COSY (Concurrent Systems) notation, for modelling realistic systems is that they would grow too large to be of any practical use. Generators for the concise representation of large (possibly infinite) structures in net theory or specifications in COSY are traced to their origins in Carl Adam Petri’s thesis [P62]. The generators implemented in the current version of COSY and its accompanying simulation and analysis tools are presented in detail together with design decisions which led to their present form.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Best E., Adequacy Properties of Path Programs, Theoretical Computer Science 18 (1982), 149–171.
Brauer W. (Ed.), Application and Theory of Petri Nets, Lecture Notes in Computer Science 84, Springer 1980.
Cotronis J.Y., Programming and verifying asynchronous systems, Ph.D. Thesis, Report ASM/123, Computing Laboratory, University of Newcastle upon Tyne, 1982.
Genrich H., Handlungslogik: Logik des Planens, Delegierens und Handelns, unpublished memo, 1975.
Hoare C.A.R., Notes on Communicating Sequential Systems, In: M. Broy (Ed.) Control Flow and Data Flow: Concepts of Distributing Programming, NATO ASI Series Vol. F14, Springer 1985, 123–204.
Lauer P.E., Toward a system specification language based on paths and processes, Part 1: The notation, Report ASM/19, Computing Laboratory, University of Newcastle upon Tyne, 1976.
Lauer P.E., COSY Subnotations: Replicators and Basic Notation, Part 4, Report ASM/62, Computing Laboratory, University of Newcastle upon Tyne, 1979.
Lauer P.E., The COSY approach to distributed computing systems, In: D.A. Duce (Ed.) Distributed Computing Systems Programme, Peter Peregrinus, London 1984, 107–126.
Lauer P.E., Campbell R.H., Formal semantics for a class of high level primitives for coordinating concurrent processes, Acta Informatica 5 (1975), 247–332.
Lauer P.E., Shields M.W., Best E., Formal Theory of the Basic COSY Notation, Technical Report 143, Computing Laboratory, University of Newcastle upon Tyne, 1979.
Lauer P.E., Shields M.W., Best E., Design and Analysis of Highly Parallel and Distributed Systems, Lecture Notes in Computer Science 86, Springer 1980, 451–503.
Lauer P.E., Shields M.W., Cotronis J.Y., Formal behavioural specification of concurrent systems without globality assumptions, Lecture Notes in Computer Science 107, Springer 1981, 115–151.
Lauer P.E., Torrigiani P.R., Toward a system specification language based on paths and processes, Technical Report 120, Computing Laboratory, University of Newcastle upon Tyne, 1978.
Lauer P.E., Torrigiani P.R., Devillers R., A COSY Banker, Lecture Notes in Computer Science 83, Springer 1980, 223–229.
Lauer P.E., Torrigiani P.R., Shields M.W., COSY: a system specification language based on path expressions, Acta Informatica 12 (1979), 109–158.
Milanetti M., A Prototype of the COSY Environment Ported to UNIX. User Manual, Report ASM/135, Department of Computer Science and Systems, McMaster University, Hamilton, Canada, 1986.
The OCCAM Programming Manual, INMOS Ltd., Prentice Hall, 1984.
Petri C.A., Kommunikation mit Automaten, Schriften des UM Nr. 2, Bonn Universitat, 1962.
Reisig W., Recursive Nets, Informatik-Fachberichte 52, Springer 1982, 125–130.
Shields M.W., Adequate Path Expressions, Lecture Notes in Computer Science 70, Springer 1979, 249–265.
Shields M.W., Lauer P.E., The equivalence of path expressions and extended semaphore primitives, Report ASM/42, Computing Laboratory, University of Newcastle upon Tyne, 1977.
Torrigiani P.R., Lauer P.E., An object oriented notation for paths and processes, AICA Annual Conference, Vol. 3, pp. 349–371, Pisa, 1977.
Wong P., Users introduction to CS: the compiler and expander for the general macro COSY notation, Report ASM/131, Computing Laboratory, University of Newcastle upon Tyne, 1985.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1987 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Lauer, P.E., Janicki, R. (1987). An Introduction to the Macro Cosy Notation. In: Voss, K., Genrich, H.J., Rozenberg, G. (eds) Concurrency and Nets. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-72822-8_20
Download citation
DOI: https://doi.org/10.1007/978-3-642-72822-8_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-72824-2
Online ISBN: 978-3-642-72822-8
eBook Packages: Springer Book Archive