Generalized finiteness conditions
Franck van Breugel · Birkhäuser Boston eBooks · 1998
In Chapter 3, we studied operational semantic models defined by means of labelled transition systems. We focussed on finitely branching and image finite labelled transition systems. For these systems we developed some theory to prove the induced operational semantic models equal to other semantic models by uniqueness of fixed point. In Chapter 4 and 5, we illustrated how labelled transition systems can be used to define operational semantics for programming languages and how the theory developed in Chapter 3 can be exploited in relating the operational semantic models to denotational ones. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.