Model checking for database theoreticians
ICDT'05 Proceedings of the 10th international conference on Database Theory
| Hi-index | 0.00 |
We define the class of micro-macro stack graphs, a newclass of graphs modeling infinite-state sequential systemswith a decidable model-checking problem. Micro-macrostack graphs are the configuration graphs of stack automatawhose states are partitioned into micro and macro states.Nodes of the graph are configurations of the stack automatonwhere the state is a macro state. Edges of the graphcorrespond to the sequence of micro steps that the automatonmakes between macro states. We prove that this classstrictly contains the class of prefix-recognizable graphs. Wegive a direct automata-theoretic algorithm for model checkingµ-calculus formulas over micro-macro stack graphs.