Article thumbnail

Metric completion versus ideal completion

By Mila E. Majster-Cederbaum and Christel Baier


AbstractComplete 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

Publisher: Published by Elsevier B.V.
Year: 1996
DOI identifier: 10.1016/S0304-3975(96)80705-5
OAI identifier:

Suggested articles

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.