Abstract
Vector languages may be used to model the non-sequential behaviour of systems of co-operating sequential processes. This report presents some preliminary results of an investigation into the following. Given that all the processes are cyclic, in what circumstances will the system as a whole be (asynchronously) cyclic? The question is of interest because many real-world systems are composed partially of cyclic sequential processes and have behaviour which is conceived of as being made up of transactions, which in our case are the asynchronous cycles.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Hoare, C. A. R: Communicating Sequential Processes, Prentice-Hall, 1985
Janicki, R. and Lauer, P. E.: Specification and Analysis for Concurrent Systems, Springer Verlag, 1992.
Concurrent Program Schemes and their Interpretations. DAIMI Rep. PB 78, Aarhus University, Aarhus, 1977.
A Prefix Function View of States and Events, Proceedings POMIV'96 Workshop on Partial Order Methods in Verification, Princeton, July 1997.
Shields, M. W.: Non-Sequential Behaviours: 1, Tech. Report CRS-120-82, Department of Computer Science, University of Edinburgh, June 1982.
Shields, M. W.: Semantics of Parallelism, Springer Verlag, 1997.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Shields, M.W. (1997). Cyclic vector languages. In: Mazurkiewicz, A., Winkowski, J. (eds) CONCUR '97: Concurrency Theory. CONCUR 1997. Lecture Notes in Computer Science, vol 1243. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63141-0_3
Download citation
DOI: https://doi.org/10.1007/3-540-63141-0_3
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63141-5
Online ISBN: 978-3-540-69188-4
eBook Packages: Springer Book Archive