In this paper we show that the notion of bisimulation for a class of labelled transition systems (the class of nondeterministic processes) may be restated as one of “reducibility to a same system” via a simple reduction relation. The reduction relation is proven to enjoy some desirable properties, notably a Church-Rosser property. We also show that, when restricted to finite nondeterministic processes, the relation yields unique minimal forms for processes and can be characterised algebraically by a set of reduction rules.
CITATION STYLE
Castellani, I. (1985). Bisimulations and abstraction homomorphisms. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 185 LNCS, pp. 223–238). Springer Verlag. https://doi.org/10.1007/3-540-15198-2_14
Mendeley helps you to discover research relevant for your work.