A Characterization of Finitary Bisimulation

Luca Aceto
Anna Ingólfsdóttir

October 1997


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.


Last modified: 2003-06-08 by webmaster.