Metric semantics from partial order semantics

Acta Informatica

Volumn 34, Issue 9, 1997, Pages 701-735

  Baier, Christel ^a   Majster Cederbaum, Mila E ^a  

^a UNIVERSITY OF MANNHEIM   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; MATHEMATICAL OPERATORS; RECURSIVE FUNCTIONS; SET THEORY;

METRIC SEMANTICS; PARTIAL ORDER SEMANTICS;

COMPUTATIONAL LINGUISTICS;

EID: 0031295244     PISSN: 00015903     EISSN: None     Source Type: Journal    
DOI: 10.1007/s002360050104     Document Type: Article

References (38)

1. S. Abramsky: A Domain Equation for Bisimulation, Information and Computation 92, pp 161-218, 1991
2. S. Abramsky, A. Jung: Domain Theory, In S. Abramsky, D.M. Gabbay and T.S.E. Maibaum, editors. Handbook of Logic in Computer Science, Vol. 3, Clarendon Press, 1994
3. P. America, J.J.M.M. Rutten: Solving Domain Equations in a Category of Complete Metric Spaces, Journal of Computer and System Science, Vol. 39, No. 3, pp 343-475, 1989
4. C. Baier, M.E. Majster-Cederbaum: Denotational Semantics in the CPO and Metric Approach, Theoretical Computer Science, Vol. 135, pp 171-220, 1994
5. C. Baier, M.E. Majster-Cederbaum: About the Consistency of Denotational Semantics in the CPO and Metric Approach, Techn. Report 8/94, Universität Mannheim, Reihe Informatik, 1994
6. C. Baier, M.E. Majster-Cederbaum: The Connection between Initial and Unique Solutions of Domain Equations in the Partial Order and Metric Approach, submitted for publication
7. J.W. de Bakker, J.I. Zucker: Processes and the Denotational Semantics of Concurrency, Information and Control, Vol.54, No. 1/2, pp 70-120, 1982
8. J.W. de Bakker, J.H.A. Warmerdam: Metric Pomset Semantics for a Concurrent Language with Recursion, Report CS-R9033, Centre for Mathematics and Computer Science. Amsterdam, July 1990
9. M. Bonsangue, F. Breugel, J.J.M.M. Rutten: Generalized Ultrametric Spaces: Completion, Topology, and Powerdomains via the Yoneda Embedding, Techn Report CS-R9560, CWI, Amsterdam, 1995
10. M. Broy: Operational and Denotational Semantics with Explicit Concurrency, Fundamenta Informaticae, Vol. 16, pp 201-229, 1992
11. K. Bruce, J.C. Mitchell: PER Models of Subtyping, Recursive Terms and Higher-order Polymorphism, Proc. 19th ACM Symp. on Principles of Programming Languages, pp 316-327, 1992
12. G. Comyn, M. Dauchet: Metric Approximations in Ordered Domains, Algebraic Methods in Semantics, Cambridge University Press, pp 251-275, 1985
13. H. Ehrig, F. Parisi-Presicce, P. Boehm, C. Rieckhoff, C. Dimitrovici, M. Große-Rohde: Combining Data Type Specifications using Projection Algebras, Theoretical Computer Science, Vol. 71, pp 347-380, 1990
14. R. Engelking: General Topology, Sigma Series in Pure Mathematics, Vol. 6, Heldermann Verlag, Berlin, 1989
15. G. Gierz, H. Hofmann, K. Keimel, J. Lawson, M. Mislove, D. Scott: A Compendium of Continuous Lattices, Springer-Verlag, 1980
16. U. Goltz, R. Loogen: Modelling Nondeterministic Concurrent Processes with Event Structures, Fundamenta Informaticae, Vol. 14, No.1, pp 39-73, 1991
17. C. Gunter: Profinite Solutions for Recursive Domain Equations, Report CMU-CS-85-107, Carnegie-Mellon University, 1985
18. H. Hahn: Reelle Funktionen, Chelsea, New York, 1948
19. C.A.R. Hoare: Communicating Sequential Processes, Prentice Hall, 1985
20. M.Z. Kwiatkowska: On three Constructions of Infinte Traces, Techn. Report No. CSD-48, University of Leicester, 1991
21. M. Majster-Cederbaum, C. Baier: Metric Completion versus Ideal Completion, to appear in Theoretical Computer Science, Vol. 170, (extended abstract in Proc. STRICT 95, J. Desel (ed.), Springer-Verlag)
22. M. Majster-Cederbaum, F. Zetzsche: Towards a Foundation for Semantics in Complete Metric Spaces, Information and Computation, Vol. 90, No. 2, pp 217-243, 1992
23. S. Matthews: The Cycle Contracting Mapping Theorem, Research Report 228, Department of Computer Science, University of Warwick, 1992
24. A. Mazurkiewicz: Basic notions of trace theory, in Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, Lecture Notes in Computer Science 354, pp 285-363, 1989
25. R. Milner: Communication and Concurrency, Prentice Hall, 1989
26. G.D. Plotkin: A Powerdomain Construction, SIAM Journal of Computation, Vol. 5, No. 3, pp 452-487, 1976
27. V. Pratt: The Pomset Model of Parallel Processes: Unifying the Temporal and the Spatial, Seminar on Concurrency, Lecture Notes in Computer Science 197, Springer-Verlag, 1984
28. J.J.M.M. Rutten: Elements of Generalized Ultrametric Spaces, Techn. Report CS-R9507, CWI, Amsterdam, 1995
29. J.J.M.M. Rutten, D. Turi: On the Foundations of Final Semantics: Non-Standard Sets, Metric Spaces, Partial Orders, in J.W. de Bakker, W.P. de Roever and G. Rozenberg, ed., Proc. REX Workshop on Semantics: Foundations and Applications, Lecture Notes in Computer Science, Vol. 666, pp 477-530, 1993
30. D. Scott, Strachey: Towards a Mathematical Semantics for Computer Languages, In J. Fox, editor, Computers and Automata, Polytechnic Institute of Brooklyn Press, 1971
31. M.B. Smyth: Power Domains, Journal of Computer and System Science, Vol. 16, pp 23-36, 1978
32. M.B. Smyth: Quasi-uniformities: Reconciling Domains with Metric Spaces, Proc. of the Third Workshop on the Mathematical Foundations of Pragramming Language Semantics, Lecture Notes in Computer Science 298, pp 236-253, 1987
33. M.B. Smyth: Totally Bounded Spaces and Compact Ordered Spaces as Domains of Computations, in G. Reed, A. Roscoe, R. Wachter (ed.), Topology and Category Theory in Computer Science, Oxford University Press, pp 207-229, 1991
34. M.B. Smyth, G.D. Plotkin: The Category-Theoretic Solution of Recursive Equations, SIAM J. Comput., Vol. 11, pp 761-783, 1982
35. K. R. Wagner: Solving Recursive Domain Equations with Enriched Categories, Ph.D. Thesis, Carnegie University, Techn. Report CMU-94-159, 1994
36. K. Weihrauch, U. Schreiber: Metric Spaces defined by Weighted Algebraic CPO's, Fundamentals of Computation Theory, FCT '79, Proceedings of the Conference on Algebraic, Arithmetric, and Categorial Methods in Computation Theory, Akademie-Verlag, 1979
37. G Winskel: Event Structure Semantics for CCS and Related Languages, Proc. ICALP 82, Lecture Notes in Computer Science 140, Springer-Verlag, pp 561-576, 1982
38. G. Winskel: Synchronisation Trees, Theoretical Computer Science, Vol. 34, pp 33-82, 1984