Metric completion versus ideal completion

DOI10.1016/0304-3975(95)00262-6zbMATH Open0874.68191OpenAlexW2033537467MaRDI QIDQ672047FDOQ672047

Authors: Mila Majster-Cederbaum, Christel Baier 

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

Recommendations

• Metric semantics from partial order semantics
• scientific article; zbMATH DE number 3883639
• scientific article; zbMATH DE number 1531366
• Towards a foundation for semantics in complete metric spaces
• On the relationships between Scott domains, synchronization trees, and metric spaces

zbMATH Keywords

concurrencyrecursionmetric completionideal completioninfinite behavioursemantic domainsemantic operatorssemantics of programming languages

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55)

Cites Work

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

Cited In (5)

• The essence of ideal completion in quantitative form
• Strict ideal completions of the lambda calculus
• Title not available (Why is that?)
• Uniform completion versus ideal completion of posets with projections
• The topology of Mazurkiewicz traces.

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q672047)