Abstract

. Groote and Vaandrager [5] introduced the tyft/tyxt format for transition system specifications (TSSs), and established that for each TSS in this format that is well-founded, the strong bisimulation it induces is a congruence. In this paper, we construct for each TSS in tyft/tyxt format an equivalent TSS that consists of tree rules only. As a corollary we can give an affirmative answer to an open question, namely whether the well-foundedness condition in the Congruence Theorem of [5] can be dropped. These results extend to tyft/tyxt with negative premises and predicates. 1 Introduction A current method to provide programming and specification languages with an operational semantics is based on the use of transition systems, advocated by Plotkin [7]. Given a set of states, the transitions between these states are obtained inductively from a transition system specification (TSS), containing transition rules. Such a rule, together with a number of transitions, may imply the validity of...

Citations