The comparison of a cpo-based semantics with a cms-based semantics for \(CSP\)

DOI10.1016/0304-3975(94)90052-3zbMath0795.68125OpenAlexW2086532405WikidataQ126839039 ScholiaQ126839039MaRDI QIDQ1318721

F. Zetzsche, Mila E. Majster-Cederbaum

Publication date: 5 April 1994

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(94)90052-3

zbMATH Keywords

interleaving semanticscomplete metric spacescompositional semanticssemantic domainscomplete partial orderscms-semanticsrepetitive constructssemantics for CSP

Mathematics Subject Classification ID

Complete metric spaces (54E50) Semantics in the theory of computing (68Q55) Continuous lattices and posets, applications (06B35)

Related Items

Denotational semantics in the cpo and metric approach, On the uniqueness of fixed points of endofunctors in a category of complete metric spaces, The contraction property is sufficient to guarantee the uniqueness of fixed points of endofunctors in a category of complete metric spaces, Towards a foundation for semantics in complete metric spaces, Metric completion versus ideal completion, An introduction to metric semantics: Operational and denotational models for programming and specification languages, The comparison of a cpo-based semantics with a cms-based semantics for \(CSP\)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Solving reflexive domain equations in a category of complete metric spaces
• Denotational semantics of a parallel object-oriented language
• Metric semantics for concurrency
• On the uniqueness of fixed points of endofunctors in a category of complete metric spaces
• The contraction property is sufficient to guarantee the uniqueness of fixed points of endofunctors in a category of complete metric spaces
• Semantics of nondeterminism, concurrency, and communication
• Fixed point theorems and semantics: A folk tale
• Towards a foundation for semantics in complete metric spaces
• Four domains for concurrency
• Power domains
• The comparison of a cpo-based semantics with a cms-based semantics for \(CSP\)
• A lattice-theoretical fixpoint theorem and its applications
• The Category-Theoretic Solution of Recursive Domain Equations
• Data Types as Lattices
• Communicating sequential processes
• Processes as terms: non-well-founded models for bisimulation
• Processes and the denotational semantics of concurrency