Abstract
Throughout Chap. 2 we have encountered two types of basic COSY programs. First, uninterpreted programs, which involve a (usually small) number of uninterpreted events to permit the illustration of notation, to support the definition of concepts arising in the context of concurrency theory, and to support the formulation and proof of important laws relating these concepts. Second, interpreted programs, which involve a (usually much larger) number of interpreted events which permit the application of the results of concurrency theory to develop verified solutions to problems arising in the area of concurrent system design and specification.
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.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Janicki, R., Lauer, P.E. (1992). High-level COSY Programs and System Design. In: Specification and Analysis of Concurrent Systems. EATCS Monographs in Theoretical Computer Science. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-77337-2_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-77337-2_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-77339-6
Online ISBN: 978-3-642-77337-2
eBook Packages: Springer Book Archive