| L. Aceto, B. Bloom, F. Vaandrager: Turning SOS Rules into Equations, Information and Computation, 111:1-52, 1994. |
....of De Simone [12] and Groote and Vaandrager [15] various other formats have been studied each with their respective merits, including the property of bisimulation being a congruence. Here, we mention: ntyft ntyxt [14] panth [26] tree rules [13] the work in [25] and the tagh format of [5] In [1], Aceto, Bloom and Vaandrager provide a method of generating a sound and complete axiomatization of strong bisimulation for transition system speci cation in the GSOS format. Recently, in [5] this result has been slightly generalized in the setting of the tagh format in order to deal with ....
....a signature and rules con rming to the GSOS or tagh format, determine whether two ground terms in T( are bisimilar without constructing a bisimulation itself. For rules in GSOS format and tagh format the resulting transition system is nitely branching and computable. Moreover, as shown in [1, 5], a head normalization property allows one to trade an arbitrary operation in favour of the basic operations of nondeterministic choice and action pre xing. Together with well foundedness of the underlying transition relation this induces an elimination theorem, stating that any term can be ....
[Article contains additional citation context not shown here]
L. Aceto, B. Bloom, F. Vaandrager: Turning SOS Rules into Equations, Information and Computation, 111:1-52, 1994.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC