Abstract
This paper represents the beginning of a study aimed at devising semantic models for true concurrency that provide clear distinctions between concurrency, parallelismand choice. We present a simple programming language which includes (weakly) sequential composition, asynchronous and synchronous parallel composition, a restriction operator, and that supports recursion. We develop an operational and a denotational semantics for this language, and we obtain a theorem relating the behavior of a process as described by the transition system to the meaning of the process in the denotational model. This implies that the denotational model is adequate with respect to the operational model. Our denotational model is based on the resource traces of Gastin and Teodesiu, and since a single resource trace represents all possible executions of a concurrent process, we are able to model each term of our concurrent language by a single trace. Therefore we obtain a deterministic semantics for our language and we are able to model parallelism without introducing nondeterminism.
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
Abramsky, S and A. Jung, Domain Theory, in: “Handbook of Computer Science and Logic,” Volume 3, Clarendon Press, 1995.
Diekert, V. and P. Gastin, Approximating traces, Acta Informatica 35 (1998), pp. 567–593.
Diekert, V. and G. Rozenberg, editors, “The Book of Traces,” World Scientific, Singapore (1995).
Gastin, P. and D. Teodesiu, Resource traces: a domain for process sharing exclusive resources, Theoretical Computer Science, to appear.
Hennessy, M. and G. D. Plotkin, Full abstraction for a simple parallel programming language, Lecture Notes in Computer Science 74 (1979), Springer-Verlag
Mazurkiewicz, A., Trace theory, Lecture Notes in Computer Science 255 (1987), pp. 279–324.
Pratt, V., On the composition of processes, Proceedings of the Ninth POPL (1982).
Reisig, W., “Petri Nets,” EATCS Monographs in Theoretical Computer Science 4 (1985), Springer-Verlag.
Winskel, G., “Events in Computation,” Ph.D. Thesis, University of Cambridge, 1980.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gastin, P., Mislove, M. (1999). A Truly Concurrent Semantics for a Simple Parallel Programming Language. In: Flum, J., Rodriguez-Artalejo, M. (eds) Computer Science Logic. CSL 1999. Lecture Notes in Computer Science, vol 1683. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48168-0_36
Download citation
DOI: https://doi.org/10.1007/3-540-48168-0_36
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66536-6
Online ISBN: 978-3-540-48168-3
eBook Packages: Springer Book Archive