Transition Systems and Automata

Julian Brunner 🌐

October 19, 2017

Abstract

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.

License

BSD License

Topics

Session Transition_Systems_and_Automata

Depends on

Used by

Cite

× 
@article{Transition_Systems_and_Automata-AFP,
  author  = {Julian Brunner},
  title   = {Transition Systems and Automata},
  journal = {Archive of Formal Proofs},
  month   = {October},
  year    = {2017},
  note    = {\url{https://isa-afp.org/entries/Transition_Systems_and_Automata.html},
             Formal proof development},
  ISSN    = {2150-914x},
}
Download

Download

× Download latest

Older releases: