Abstract
Full abstraction of a denotational model w.r.t. operational ones for a concurrent language L is investigated. The language is nonuniform in that the meaning of atomic statements generally depends on the current state; it has parameterization with channel- and value-parameters and locality in the form of local variables and local channels, in addition to more conventional constructs: value assignments to variables, parallel composition with CSP/CCS-like communication, nondeterministic choice, and recursion. First two operational models O L and O *L for L are introduced in terms of a Plotkin-style transition system. Both models are linear in that they map each statement to the set of its possible execution paths of a certain kind; the second model O *L is more abstract than the first one in that O *L ignores states while O L involves them. Then a denotational model D is defined compositionally using interpreted operations of the language, with meanings of recursive programs as fixed points in an appropriate complete metric space. The the full abstraction of D w.r.t. O L and O *L established. That is, it is shown for O=O L, O *L that D is most abstract of those models C which are compositional and more distinctive than O.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
P. America and J.J.M.M. Rutten (1989), Solving reflexive domain equations in a category of complete metric spaces, Journal of Computer and System Sciences, Vol. 39, No. 3, pp. 343–375.
J.W. de Barker and J.I. Zucker (1982), Processes and the denotational semantics of concurrency, Information and Control Vol. 54, pp. 70–120.
J.A. Bergstra, J.W. Klop, and E.-R. Olderog (1988), Readies and failures in the algebra of communicating processes, SIAM J. of Computing Vol. 17, No. 6, pp. 1134–1177.
F.S. de Boer, J.N. Kok, C. pAlamidesi, and J.J.M.M. Rutten (1992), On blocks: locality and asynchronous communication (extended abstract), to appear as a CWI Report, Amsterdam.
S.D. Brookes, C.A.R. Hoare, and A.W. Roscoe (1984), A theory of communicating sequential processes, Journal of the Association for Computing Machinery, Vol. 31, pp. 560–599.
R. De Nicola and M. Hennessy (1983), Testing equivalence and processes, Theoretical Computer Science, Vol. 34, pp. 83–133.
J. Dugundji (1966), Topology, Allyn and Bacon, Boston.
R. Engelking (1977), General topology, Polish Scientific Publishers.
L. Henkin, J.D. Monk, and A. Tarski (1971), Cylindric Algebras (Part 1), North-Holland.
M. Hennessy (1985), Acceptance trees, Journal of the Association for Computing Machinery, Vol. 32, pp. 896–928.
M. Hennessy (1988), Algebraic theory of processes, MIT Press.
M. Hennessy and A. Ingólfsdóttir (1990), A theory of communicating processes with value-passing, in Proceedings 17th ICALP, Warwick University, Lecture Notes in Computer Science, Vol. 443, pp. 209–219, Springer.
E. Horita (1992), Fully abstract models for communicating processes with respect to weak linear semantics with divergence, IEICE Transactions on Information and Systems Vol. E75-D, No. 1, pp. 64–77.
E. Horita (1992), Full abstraction of metric semantics for imperative concurrency with communication, to appear as a CWI Report, Amsterdam.
E. Horita (1992), Full abstraction of metric semantics for communicating processes with value-passing, to appear as a CWI Report, Amsterdam.
E. Horita, J.W. de Barker, and J.J.M.M. Rutten (1990), Fully abstract denotational models for nonuniform concurrent languages, CWI Report CS-R9027, Amsterdam.
J.N. Kok and J.J.M.M. Rutten (1990), Contractions in comparing concurrency semantics, in Theoretical Computer Science, Vol. 76, pp. 179–222.
R. Milner (1973), Processes: a mathematical model of computing agents, in Proceedings of Logic Colloquium 73 (H.E. Rose, J.C. Shepherdson, eds.), pp. 157–173, North-Holland.
R. Milner (1989), Communication and concurrency, Prentice Hall International.
J.C. Mitchell (1990), Type systems for programming languages, in Handbook of Theoretical Computer Science, Vol. B, Formal Models and Semantics (J.V. Leeuwen, ed.), pp. 365–458, The MIT Press/Elsevier.
P.W. O'hearn and R.D. Tennent (1992), Semantics of local variables, LFCS Report ECS-LFCS-92-192, Department of Computer Science, University of Edinburgh.
G.D. Plotkin (1981), A structured approach to operational semantics, Report DAIMI FN-19, Computer Science Department, Aarhus University.
J.J.M.M. Rutten (1989), Correctness and full abstraction of metric semantics for concurrency, in Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency (J.W. de Barker, W.P. de Roever, G. Rozenberg, eds.), Lecture Notes in Computer Science Vol. 354, PP-628–658, Springer.
V.A. Saraswat, M. Rinard, and P. Panangaden, Semantic foundation of concurrent constraint programming (preliminary report), In Prod. of the eighteenth ACM Symposium on Principles of Programming Languages, pp. 333–352, ACM.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Horita, E. (1993). A fully abstract model for a nonuniform concurrent language with parameterization and locality. In: de Bakker, J.W., de Roever, W.P., Rozenberg, G. (eds) Semantics: Foundations and Applications. REX 1992. Lecture Notes in Computer Science, vol 666. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56596-5_38
Download citation
DOI: https://doi.org/10.1007/3-540-56596-5_38
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56596-3
Online ISBN: 978-3-540-47595-8
eBook Packages: Springer Book Archive