Bisimulation of automata

https://doi.org/10.1016/0890-5401(88)90017-XGet rights and content
Under an Elsevier user license
open archive

Abstract

We view CCS terms as defining nondeterministic automata. An algebraic representation of automata is given, and categories of automata and simulations between them are defined. The crucial feature is the consideration of only the pure simulations which carry the pure (actual, determined) states of the domain automation to the pure states of the codomain automaton. The pure epimorphisms between the automata partition the category into bisimulation equivalence classes. There is a unique canonical representative for each bisimulation equivalence class. These results hold for weak bisimulation and hence for strong bisimulation. Essentially the same results are obtained with regard to rooted bisimulation equivalence classes of automata with start states.

Cited by (0)

A preliminary version of this work was presented at the IEEE Symposium on Logic in Computer Science, June 16–18, 1986. Research supported in part by National Science Foundation grant DCR-8402305.