Ntyft/ntyxt Rules Reduce to Ntree Rules

Groote and Vaandrager introduced thetyft/tyxt formatfor Transition System Specifications (TSSs), and established that for each TSS in this format that iswell-founded, the bisimulation equivalence it induces is a congruence. In this paper, we construct for each TSS in tyft/tyxt format an equivalent TSS that consists oftree rulesonly. As a corollary we can give an affirmative answer to an open question, namely whether the well-foundedness condition in the congruence theorem for tyft/tyxt can be dropped. These results extend to tyft/tyxt with negative premises and predicates.

Authors

• Wan Fokkink
• Rob van Glabbeek

Keywords

No keywords are indexed for this paper.