Article1098323211: Unterschied zwischen den Versionen
Aus International Center for Computational Logic
Johannes Lehmann (Diskussion | Beiträge) (Die Seite wurde neu angelegt: „{{Publikation Erster Autor |ErsterAutorVorname=Mila E. |ErsterAutorNachname=Majster-Cederbaum |FurtherAuthors=Christel Baier}} {{Article |Journal=Theoretical Computer Science |Number=1-2 |Pages=145--171 |Title=Metric Completion versus Ideal Completion |Volume=170 |Year=1996 }} {{Publikation Details |DOI Name=10.1016/S0304-3975(96)80705-5 |Abstract=Complete partial orders have been used for a long time for defining semantics of programming la…“) |
Johannes Lehmann (Diskussion | Beiträge) K (Textersetzung - „Verifikation und formale quantitative Analyse“ durch „Algebraische und logische Grundlagen der Informatik“) |
||
| Zeile 14: | Zeile 14: | ||
|DOI Name=10.1016/S0304-3975(96)80705-5 | |DOI Name=10.1016/S0304-3975(96)80705-5 | ||
|Abstract=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. | |Abstract=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= | |Forschungsgruppe=Algebraische und logische Grundlagen der Informatik | ||
}} | }} | ||
Aktuelle Version vom 5. März 2025, 15:41 Uhr
Metric Completion versus Ideal Completion
Mila E. Majster-CederbaumMila E. Majster-Cederbaum, Christel BaierChristel Baier
Mila E. Majster-Cederbaum, Christel Baier
Metric Completion versus Ideal Completion
Theoretical Computer Science, 170(1-2):145--171, 1996
Metric Completion versus Ideal Completion
Theoretical Computer Science, 170(1-2):145--171, 1996
- 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: Algebraische und logische Grundlagen der InformatikAlgebraic 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}
}
