Summary
This paper shows how to treat the hiding operator originally defined by Hoare et al. for finite observations of processes, in an order theoretic setting based on finite and infinite streams. The main technical contribution is the continuity proof of the hiding operator based on a mixture of topological and order-theoretic arguments. As an application of the continuity of hiding, syntactic transformation rules for its calculation are derived. This calculus utilizes a general fixed point transformation technique.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Back, R.J.R.: A Continuous Semantics for Unbounded Nondeterminism. Theor. Comput. Sci. 23, 187–210 (1983)
Baeten, J.C.M., Bergstra, J.A.: Global Renaming Operators in Concrete Process Algebra. Report CS-R8521, Centre of Mathematics and Computer Science, Amsterdam, 1985
de Bakker, J.W.: Mathematical Theory of Program Correctness. Englewood Cliffs, New Jersey: Prentice-Hall 1980
de Bakker, J.W., Meyer, J.-J.Ch.: Order and Metric in the Stream Semantics of Elemental Concurrency. Acta Inf. 24, 491–511 (1987)
de Bakker, W., Meyer, J.-J.Ch., Zucker, J.I.: On Infinite Computations in Denotational Semantics. Theor. Comput. Sci. 26, 53–82 (1983) (Corrigendum, Theor. Comput. Sci. 29, 229–230 (1984))
de Bakker, J.W., Meyer, J.-J.Ch., Olderog, E.-R.: Infinite Streams and Finite Observations in the Semantics of Uniform Concurrency. Theor. Comput. Sci. 49, 87–112 (1987)
Berstra, J.A., Klop, J.W.: Algebra of Communicating Processes. In: de Bakker, J.W., Hazewinkel, M., Lenstra, J.K. (eds.) Mathematics and Computer Science, pp. 84–138. CWI Monographs 1. Amsterdam: North-Holland 1986
Brookes, S.D., Hoare, C.A.R., Roscoe, A.W.: A Theory of Communicating Sequential Processes. J. ACM 31, 560–599
Broy, M.: Fixed Point Theory for Communication and Concurrency. In: Bjørner, D. (ed.) Formal Description of Programming Concepts II, pp. 125–147. Amsterdam: North-Holland 1983
Joshi, K.D.: Introduction to General Topology. New Delhi: Wiley 1983
Kuratowski, K.: Topology, Vol. 1. New York: Academic Press 1966
Meyer, J.-J.Ch.: Programming Calculi Based on Fixed Point Transformations: Semantics and Applications. Ph.D. dissertation, Free University of Amsterdam, 1985
Meyer, J.-J.Ch.: Merging Regular Processes by Means of Fixed Point Theory. Theor. Comput. Sci. 45, 193–260 (1986)
Meyer, J.-J.Ch., de Vink, E.P.: Application of Compactness in the Smyth Power-domain of Streams. Theor. Comput. Sci. 57, 251–282 (1988)
Milner, R.: A Calculus of Communicating Systems. Lect. Notes Comput. Sci., Vol 92. Berlin Heidelberg New York: Springer 1980
Olderog, E.-R., Hoare, C.A.R.: Specification-oriented Semantics for Communicating Processes. Acta Inf. 23, 9–66 (1986)
Reed, G.M., Roscoe, A.W.: Metric Spaces as Models for Real-Time Concurrency. In: Proc. Mathematical Foundations of Programming Languages (New Orleans, L.A., 1987). Lect. Notes Comput. Sci. 298, 331–343 (1988)
Rounds, W.C.: On the Relationship between Scott Domains, Synchronization Trees and Metric Spaces. Report University of Michigan, CRL-TR-25-83, 1983
Smyth, M.B.: Power Domains. J. Comput. Syst. Sci. 16, 23–36 (1978)
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Meyer, J.J.C., Olderog, E.R. Hiding in stream semantics of uniform concurrency. Acta Informatica 27, 381–397 (1990). https://doi.org/10.1007/BF00289016
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00289016