3 search results - page 1 / 1 » FASTer Acceleration of Counter Automata in Practice |
TACAS
2004
Springer
13 years 10 months ago
2004
Springer
ATVA
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. This paper argues that flatness appears as a central notion in the verification of counter automata. A counter automaton is called flat when its control graph can be ...
CAV
2006
Springer
13 years 8 months ago
2006
Springer
Fast is a tool designed for the analysis of counter systems, i.e. automata extended with unbounded integer variables. Despite the reachability set is not recursive in general, Fast...