1 Department of Computer Science, Faculty of Science, Aarhus University, Aarhus University2 unknown
An abstract coalgebraic approach to well-structured relations on processes is presented, based on notions of tests and test suites. Preorders and equivalences on processes are modelled as coalgebras for behaviour endofunctors lifted to a category of test suites. The general framework is specialized to the case of finitely branching labelled transition systems. It turns out that most equivalences from the so-called van Glabbeek spectrum can be described by well-structured test suites. As an immediate application, coinductive proof principles are described for these equivalences, in particular for trace equivalence.
Proceedings of the Workshop on Coalgebraic Methods in Computer Science (cmcs) , 2004, p. 201-218
Main Research Area:
7th International Workshop on Coalgebraic Methods in Computer Science, 2004