2010-08-01
Non-deterministic Kleene coalgebras
Publication
Publication
In this paper, we present a systematic way of deriving (1) languages of (generalised)
regular expressions, and (2) sound and complete axiomatizations thereof, for a wide
variety of systems. This generalizes both the results of Kleene (on regular languages and deterministic
finite automata) and Milner (on regular behaviours and finite labelled transition
systems), and includes many other systems such as Mealy and Moore machines.
| Additional Metadata | |
|---|---|
| , , | |
| Int. Fed. of Computational Logic | |
| Logical Methods in Computer Science | |
| Organisation | Computer Security |
|
Silva, A., Bonsangue, M., & Rutten, J. (2010). Non-deterministic Kleene coalgebras. Logical Methods in Computer Science. |
|
