2 search results - page 1 / 1 » Fast Mu-Calculus Model Checking when Tree-Width Is Bounded |
CAV
2003
Springer
13 years 10 months ago
2003
Springer
We show that the model checking problem for µ-calculus on graphs of bounded tree-width can be solved in time linear in the size of the system. The result is presented by first sh...
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 ...