Abstract

A labelled transition system is provided with some additional structure by endowing the configurations 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 finiteness conditions finitely branching and image finite 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 finiteness conditions are discussed. These results are generalized for metric labelled transition systems satisfying one of the generalized finiteness conditions. The generalized results are shown to be useful for studying semantics of programming languages. For example, a proof principle for relating different semantic models for a given language based on the results is presented. AMS Subject Cla...

Citations