Towards a foundation for semantics in complete metric spaces
From MaRDI portal
Publication:1173767
DOI10.1016/0890-5401(91)90005-MzbMath0773.68050MaRDI QIDQ1173767
F. Zetzsche, Mila E. Majster-Cederbaum
Publication date: 25 June 1992
Published in: Information and Computation (Search for Journal in Brave)
Complete metric spaces (54E50) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Semantics in the theory of computing (68Q55)
Related Items
De Bakker-Zucker processes revisited ⋮ Recursively defined metric spaces without contraction ⋮ The connection between initial and unique solutions of domain equations in the partial order and metric approach ⋮ A characterization of distance between 1-bounded compact ultrametric spaces through a universal space ⋮ Equational properties of iteration in algebraically complete categories ⋮ The equational logic of fixed points ⋮ Trees and semantics ⋮ A fixed-point theorem in a category of compact metric spaces ⋮ Underspecification for a simple process algebra of recursive processes. ⋮ Denotational models for programming languages: Applications of Banach's fixed point theorem ⋮ The comparison of a cpo-based semantics with a cms-based semantics for \(CSP\)
Cites Work
- ``A la Burstall intermittent assertions induction principles for proving inevitability properties of programs
- Specification-oriented semantics for communicating processes
- Transition systems, metric spaces and ready sets in the semantics of uniform concurrency
- On the uniqueness of fixed points of endofunctors in a category of complete metric spaces
- Semantics of nondeterminism, concurrency, and communication
- Recursive assertions and parallel programs
- Verifying concurrent processes using temporal logic
- Fixed-point constructions in order-enriched categories
- The comparison of a cpo-based semantics with a cms-based semantics for \(CSP\)
- Connections between two theories of concurrency: Metric spaces and synchronization trees
- A Proof System for Communicating Sequential Processes
- The Category-Theoretic Solution of Recursive Domain Equations
- Verifying properties of parallel programs
- Data Types as Lattices
- Communicating sequential processes
- Processes and the denotational semantics of concurrency
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
