Transition systems \not= finite automata
Transition systems \not= finite automata
- there are no accept states
- set of states and actions may be countably infinite
- may have infinite branches
- actions may be subject to synchronization (concurrency)
Transition systems \not= finite automata