Generic Techniques for the verification of infinite-state systems
Within the context of the verification of infinite-state systems, 'Regular model checking' is the name of a family of techniques in which states are represented by words or trees, sets of states by finite automata on these objects, and transitions by finite automata operating on pairs of s...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Published: |
Universite de Liege
2007
|
| Subjects: | |
| Online Access: | http://bictel.ulg.ac.be/ETD-db/collection/available/ULgetd-11242007-175646/ |