|
A Characterization of Finitary Bisimulation
Luca Aceto October 1997 |
Abstract:In this study, we offer a behavioural characterization of the finitary bisimulation for arbitrary transition systems. This result may be seen as the behavioural counterpart of Abramsky's logical characterization theorem. Moreover, for the important class of sort-finite transition systems we present a sharpened version of a behavioural characterization result first proven by Abramsky Available as PostScript, PDF, DVI. |