Metric Completion versus Ideal Completion

Mila E. Majster-CederbaumMila E. Majster-Cederbaum, Christel BaierChristel Baier

DOI Link

Mila E. Majster-Cederbaum, Christel Baier
Metric Completion versus Ideal Completion
Theoretical Computer Science, 170(1-2):145--171, 1996

Details
Bibtex

KurzfassungAbstract
Complete partial orders have been used for a long time for defining semantics of programming languages. In the context of concurrency de Bakker and Zucker (1982) proposed a metric setting for handling concurrency, recursion and nontermination, which has proved to be very successful in many applications. Starting with a semantic domain D for ‘finite behaviour’ we investigate the relation between the ideal completion Idl(D) and the metric completion which are both suitable to model recursion and infinite behaviour. We also consider the properties of semantic operators.
Forschungsgruppe:Research Group: Verifikation und formale quantitative Analyse„Verifikation und formale quantitative Analyse“ befindet sich nicht in der Liste (Computational Logic, Automatentheorie, Wissensverarbeitung, Knowledge-Based Systems, Knowledge Systems, Wissensbasierte Systeme, Logische Programmierung und Argumentation, Algebra und Diskrete Strukturen, Knowledge-aware Artificial Intelligence, Algebraische und logische Grundlagen der Informatik) zulässiger Werte für das Attribut „Forschungsgruppe“.Algebraic and Logical Foundations of Computer Science

@article{MB1996,
  author  = {Mila E. Majster-Cederbaum and Christel Baier},
  title   = {Metric Completion versus Ideal Completion},
  journal = {Theoretical Computer Science},
  volume  = {170},
  number  = {1-2},
  year    = {1996},
  pages   = {145--171},
  doi     = {10.1016/S0304-3975(96)80705-5}
}