1. Model checking and boolean graphs;Andersen;Theoretical Computer Science,1994
2. Delayed logic and finite state machines;Arden,1960
3. Finite transition systems;Arnold,1994
4. A selection property of the boolean μ-calculus and some of its applications;Arnold;RAIRO-Theoretical Informatics and Applications,1997
5. The μ-calculus alternation-depth hierarchy is strict on binary trees;Arnold;RAIRO-Theoretical Informatics and Applications,1999