Correctness and full abstraction of metric semantics for concurrency

Rütten, Jan

doi:10.1007/bfb0013038

Cited by 10 publications

(4 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…They prove that their semantics is fully abstract with respect to the operational semantics. If we take the same observation criteria, we can adapt our semantic model (restricted to the subset considered by [ 17]) in such a way that it is fully abstract along the lines of the methods described in [32]. A point of further research is whether or not non-flat guards influence these results.…”

Section: Introductionmentioning

confidence: 99%

Comparative metric semantics for concurrent prolog

Bakker

Kok

1990

Theoretical Computer Science

View full text Add to dashboard Cite

This paper shows the equivalence of two semantics for a version of Concurrent Prolog with non-flat guards: an operational semantics based on a transition system and a denotational semantics which is a metric semantics (the domains are metric spaces). We do this in the following manner. First a uniform language :I" is considered, that is a language where the atomic actions have arbitrary interpretation>. For this language we define an operational and a denotational semantics, and we prove that the denotational semantics is correct with respect to the operational semantics. This result relies on Banach's fixed point theorem. Techniques stemming from imperative languages are used. Then we show how to translate a Concurrent Prolog program to a program in :.! by selecting certain basic sets for :f" and then instantiating the interpretation function for the atomic actions. In this way we induce the two semantics for Concurrent Prolog and the equivalence between the two semantics.

show abstract

Section: Introductionmentioning

confidence: 99%

Comparative metric semantics for concurrent prolog

Bakker

Kok

1990

Theoretical Computer Science

View full text Add to dashboard Cite

show abstract

“…[BBKM84,BMOZ88]) or bisimulation, interleaving or noninterleaving ([BW90]), failure set semantics (cf. [Rut89])) is a. separate decision, in most cases independent of the design of T. Maybe the most important advantage of this way of defining 0 as fiz(il!) is that is suggests a quite natural method to establish (*) 0 = V, viz.…”

mentioning

confidence: 99%

“…also [BM88]). Elsewhere ( [Rut89,HBR90]) it is discussed how (*) may be strengthened to certain full abstractness results. Recently, investigations have begun concerning the possibility of obtaining V 'automatically' from a given transition system T. In restricted cases this is indeed possible ([Rut90a]), and it is an interesting problem how this idea may be generalized.…”

mentioning

confidence: 99%

Rendez-vous with metric semantics

Bakker

Vink

1993

New Gener Comput

View full text Add to dashboard Cite

A comparative semantic study is made of an element of the family of concurrent object-oriented programming languages. Particular attention is paid to two notions: (i) dynamically evolving process structures, including a mechanism to name and refer to processes and a means to create new processes, and (ii) reudez-vous between processes involving the sending and answering of messages and the induced execution of method calls. The methodology of metric semantics is applied in the design of operational and denotational semantics, as well as in the proof of their equivalence. Both semantics employ domains which are determined as fixed points of a contracting functor in the category of complete metric spaces. Moreover, fruitful use is made of the technique of defining semantic meaning functions as fixed points of contracting higher-order mappings. Finally, syntactic and semantics continuations play a pervasive role.

show abstract

“…We study two classes of these domains: the so-called linear and branching domains. (Other domains have been studied by, e.g., De Bakker and Warmerdam ( BW91]) and Rutten ( Rut88]). ) The elements of a linear domain can be regarded as sets of sequences of labels.…”

Section: Introductionmentioning

confidence: 99%

Generalizing finiteness conditions of labelled transition systems

Breugel

1994

Automata, Languages and Programming

View full text Add to dashboard Cite

A labelled transition system is provided with some additional structure by endowing the con gurations and the labels with a complete metric. In this way, a so-called metric labelled transition system is obtained. The additional structure on a metric labelled transition system makes it possible to generalize the niteness conditions nitely branching and image nite to compactly branching and image compact, respectively. Some topological properties of the operational semantic models and the so-called higher order transformations induced by labelled transition systems satisfying one of the niteness conditions are discussed. These results are generalized for metric labelled transition systems satisfying one of the generalized niteness conditions. The generalized results are shown to be useful for studying semantics of programming languages. For example, a proof principle for relating di erent semantic models for a given language based on the results is presented.

show abstract

Correctness and full abstraction of metric semantics for concurrency

Cited by 10 publications

References 14 publications

Comparative metric semantics for concurrent prolog

Comparative metric semantics for concurrent prolog

Rendez-vous with metric semantics

Generalizing finiteness conditions of labelled transition systems

Contact Info

Product

Resources

About