Ntyft/Ntyxt Rules Reduce to Ntree Rules

Abstract

Groote and Vaandrager introduced the tyft/tyxt format for Transition System Speci cations (TSSs), and established that for each TSS in this format that is well-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 of tree rules only. As a corollary we can give an a rmative 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.

DOI: 10.1006/inco.1996.0030

Extracted Key Phrases

Statistics

051015'95'97'99'01'03'05'07'09'11'13'15'17
Citations per Year

107 Citations

Semantic Scholar estimates that this publication has 107 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@article{Fokkink1996NtyftNtyxtRR, title={Ntyft/Ntyxt Rules Reduce to Ntree Rules}, author={Wan Fokkink and Rob J. van Glabbeek}, journal={Inf. Comput.}, year={1996}, volume={126}, pages={1-10} }