Transition Systems and Automata

Julian Brunner 🌐

October 19, 2017

This is a development version of this entry. It might change over time and is not stable. Please refer to release versions for citations.


This entry provides a very abstract theory of transition systems that can be instantiated to express various types of automata. A transition system is typically instantiated by providing a set of initial states, a predicate for enabled transitions, and a transition execution function. From this, it defines the concepts of finite and infinite paths as well as the set of reachable states, among other things. Many useful theorems, from basic path manipulation rules to coinduction and run construction rules, are proven in this abstract transition system context. The library comes with instantiations for DFAs, NFAs, and Büchi automata.


BSD License


Session Transition_Systems_and_Automata