Advertisement

Three metric domains of processes for bisimulation

  • Franck van Breugel
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 802)

Abstract

A new metric domain of processes is presented. This domain is located in between two metric process domains introduced by De Bakker and Zucker. The new process domain characterizes the collection of image finite processes. This domain has as advantages over the other process domains that no complications arise in the definitions of operators like sequential composition and parallel composition, and that image finite language constructions like random assignment can be modelled in an elementary way. As in the other domains, bisimilarity and equality coincide in this domain.

The three domains are obtained as unique (up to isometry) solutions of equations in a category of 1-bounded complete metric spaces. In the case the action set is finite, the three domains are shown to be equal (up to isometry). For infinite action sets, e.g., equipollent to the set of natural or real numbers, the process domains are proved not to be isometric.

Keywords

Nonexpansive Function Sequential Composition Parallel Composition Unique Fixed Point Label Transition System 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [ABKR89]
    P. America, J.W. de Bakker, J.N. Kok, and J.J.M.M. Rutten. Denotational Semantics of a Parallel Object-Oriented Language. Information and Computation, 83(2):152–205, November 1989.Google Scholar
  2. [Abr91]
    S. Abramsky. A Domain Equation for Bisimulation. Information and Computation, 92(2):161–218, June 1991.Google Scholar
  3. [Acz88]
    P. Aczel. Non-Well-Founded Sets. Number 14 in CSLI Lecture Notes. Centre for the Study of Languages and Information, Stanford, 1988.Google Scholar
  4. [AR89]
    P. America and J.J.M.M. Rutten. Solving Reflexive Domain Equations in a Category of Complete Metric Spaces. Journal of Computer and System Sciences, 39(3):343–375, December 1989.Google Scholar
  5. [AR92]
    P. America and J.J.M.M. Rutten. A Layered Semantics for a Parallel Object-Oriented Language. Formal Aspects of Computing, 4(4):376–408, 1992.Google Scholar
  6. [Ban22]
    S. Banach. Sur les Opérations dans les Ensembles Abstraits et leurs Applications aux Equations Intégrales. Fundamenta Mathematicae, 3:133–181, 1922.Google Scholar
  7. [BBKM84]
    J.W. de Bakker, J.A. Bergstra, J.W. Klop, and J.-J.Ch. Meyer. Linear Time and Branching Time Semantics for Recursion with Merge. Theoretical Computer Science, 34(1/2):135–156, 1984.Google Scholar
  8. [BK87]
    J.A. Bergstra and J.W. Klop. A Convergence Theorem in Process Algebra. Report CS-R8733, CWI, Amsterdam, July 1987. Appeared in [BR92], pages 164–195.Google Scholar
  9. [BM88]
    J.W. de Bakker and J.-J.Ch. Meyer. Metric Semantics for Concurrency. BIT, 28:504–529, 1988.Google Scholar
  10. [BR92]
    J.W. de Bakker and J.J.M.M. Rutten, editors. Ten Years of Concurrency Semantics, selected papers of the Amsterdam Concurrency Group. World Scientific, Singapore, September 1992.Google Scholar
  11. [Bre94]
    F. van Breugel. Topological Models in Comparative Semantics. PhD thesis, Vrije Universiteit, Amsterdam, 1994. In preparation.Google Scholar
  12. [BW93]
    F. van Breugel and J.H.A. Warmerdam. Solving Recursive Domain Equations in a Category of Compact Metric Spaces. CWI, Amsterdam. Preprint, to appear.Google Scholar
  13. [BZ82]
    J.W. de Bakker and J.I. Zucker. Processes and the Denotational Semantics of Concurrency. Information and Control, 54(1/2):70–120, July/August 1982.Google Scholar
  14. [BZ83]
    J.W. de Bakker and J.I. Zucker. Compactness in Semantics for Merge and Fair Merge. In E. Clarke and D. Kozen, editors, Proceedings of 4th Workshop on Logics of Programs, volume 164 of Lecture Notes in Computer Science, pages 18–33, Pittsburgh, June 1983. Springer-Verlag.Google Scholar
  15. [Eng89]
    R. Engelking. General Topology, volume 6 of Sigma Series in Pure Mathematics. Heldermann Verlag, Berlin, revised and completed edition, 1989.Google Scholar
  16. [Gla90]
    R.J. van Glabbeek. The Linear Time — Branching Time Spectrum. In J.C.M. Baeten and J.W. Klop, editors, Proceedings of CONCUR'90, volume 458 of Lecture Notes in Computer Science, pages 278–297, Amsterdam, August 1990. Springer-Verlag.Google Scholar
  17. [Gla93]
    R.J. van Glabbeek. The Linear Time — Branching Time Spectrum II. To appear in Proceedings of CONCUR'93, Hildesheim, August 1993.Google Scholar
  18. [Gol84]
    W.G. Golson. Denotational Models based on Synchronous Communicating Processes. PhD thesis, University of Michigan, Ann Arbor, 1984.Google Scholar
  19. [GR83]
    W.G. Golson and W.C. Rounds. Connections between Two Theories of Concurrency: Metric Spaces and Synchronization Trees. Information and Control, 57(2/3):102–124, May/June 1983.Google Scholar
  20. [GR89]
    R.J. van Glabbeek and J.J.M.M. Rutten. The Processes of De Bakker and Zucker represent Bisimulation Equivalence Classes. In J. W. de Bakker, 25 jaar semantiek, pages 243–246. CWI, Amsterdam, April 1989.Google Scholar
  21. [KR90]
    J.N. Kok and J.J.M.M. Rutten. Contractions in Comparing Concurrency Semantics. Theoretical Computer Science, 76(2/3):179–222, 1990.Google Scholar
  22. [Mil80]
    R. Milner. A Calculus of Communicating Systems, volume 92 of Lecture Notes in Computer Science. Springer-Verlag, 1980.Google Scholar
  23. [Mil90]
    R. Milner. Operational and Algebraic Semantics of Concurrent Processes. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B: Formal Models and Semantics, chapter 19, pages 1201–1242. The MIT Press/Elsevier, Cambridge/Amsterdam, 1990.Google Scholar
  24. [MM79]
    G. Milne and R. Milner. Concurrent Processes and Their Syntax. Journal of the ACM, 26(2):302–321, April 1979.Google Scholar
  25. [Ole87]
    F.J. Oles. Semantics for Concurrency without Powerdomains. In Proceedings of the 14th Annual ACM Symposium on Principles of Programming Languages, pages 211–222, Munich, January 1987.Google Scholar
  26. [Ole92]
    F.J. Oles, August 1992. Personal communication.Google Scholar
  27. [Par81]
    D. Park. Concurrency and Automata on Infinite Sequences. In P. Deussen, editor, Proceedings of 5th GI-Conference on Theoretical Computer Science, volume 104 of Lecture Notes in Computer Science, pages 167–183, Karlsruhe, March 1981. Springer-Verlag.Google Scholar
  28. [Plo81]
    G.D. Plotkin. A Structural Approach to Operational Semantics. Report DAIMI FN-19, Aarhus University, Aarhus, September 1981.Google Scholar
  29. [Rut92]
    J.J.M.M. Rutten. Processes as Terms: Non-Well-Founded Models for Bisimulation. Mathematical Structures in Computer Science, 2(3):257–275, September 1992.Google Scholar
  30. [RZ92]
    J.J.M.M. Rutten and J.I. Zucker. A Semantic Approach to Fairness. Fundamenta Informaticae, 16(1):1–38, January 1992.Google Scholar
  31. [War90]
    J.H.A. Warmerdam, November 1990. Personal communication.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • Franck van Breugel
    • 1
    • 2
  1. 1.Department of Software TechnologyCWISJ Amsterdam
  2. 2.Department of Mathematics and Computer ScienceVrije UniversiteitHV Amsterdam

Personalised recommendations