Metric completion versus ideal completion

DOI10.1016/0304-3975(95)00262-6zbMath0874.68191OpenAlexW2033537467MaRDI QIDQ672047

Christel Baier, Mila E. Majster-Cederbaum

Publication date: 27 February 1997

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

Full work available at URL: https://doi.org/10.1016/0304-3975(95)00262-6

zbMATH Keywords

recursionconcurrencymetric completionideal completionsemantics of programming languagesinfinite behavioursemantic domainsemantic operators

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55)

Related Items (3)

Unnamed Item ⋮ The topology of Mazurkiewicz traces. ⋮ Uniform Completion versus Ideal Completion of Posets with Projections

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Metric semantics for concurrency
• The comparison of a cpo-based semantics with a cms-based semantics for \(CSP\)
• Denotational semantics in the cpo and metric approach
• Synchronization trees
• The connection between initial and unique solutions of domain equations in the partial order and metric approach
• Processes and the denotational semantics of concurrency

This page was built for publication: Metric completion versus ideal completion