Automatic verification of finite-state concurrent systems using temporal logic specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
Alternating automata on infinite trees
Theoretical Computer Science
In transition from global to modular temporal reasoning about programs
Logics and models of concurrent systems
Tree automata, Mu-Calculus and determinacy
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
A linear-time model-checking algorithm for the alternation-free modal mu-calculus
Formal Methods in System Design - Special issue on computer-aided verification: special methods II
On the power of bounded concurrency I: finite automata
Journal of the ACM (JACM)
Abstract interpretation of reactive systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
Complexity of equivalence problems for concurrent systems of finite agents
Information and Computation
Model checking
An automata-theoretic approach to branching-time model checking
Journal of the ACM (JACM)
Pushdown processes: games and model-checking
Information and Computation - Special issue on FLOC '96
Model checking of hierarchical state machines
ACM Transactions on Programming Languages and Systems (TOPLAS)
On the complexity of verifying concurrent transition systems
Information and Computation
Automata for the Modal mu-Calculus and related Results
MFCS '95 Proceedings of the 20th International Symposium on Mathematical Foundations of Computer Science
Communicating Hierarchical State Machines
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Reachability Analysis of Pushdown Automata: Application to Model-Checking
CONCUR '97 Proceedings of the 8th International Conference on Concurrency Theory
CTL+ is Exponentially more Succinct than CTL
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
Model Checking CTL Properties of Pushdown Systems
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
Analysis of Recursive State Machines
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
Automatic Abstraction Using Generalized Model Checking
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Pushdown Processes: Games and Model Checking
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
Analysis of recursive state machines
ACM Transactions on Programming Languages and Systems (TOPLAS)
Complexity results on branching-time pushdown model checking
Theoretical Computer Science
When not losing is better than winning: Abstraction and refinement for the full μ-calculus
Information and Computation
A game-based framework for CTL counterexamples and 3-valued abstraction-refinement
ACM Transactions on Computational Logic (TOCL)
Verification of scope-dependent hierarchical state machines
Information and Computation
Taming Concurrency: A Program Verification Perspective
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
Program Complexity in Hierarchical Module Checking
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Fixpoint logics on hierarchical structures
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
On-the-Fly reachability and cycle detection for recursive state machines
TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Pushdown module checking with imperfect information
Information and Computation
Synthesis of hierarchical systems
Science of Computer Programming
Hi-index | 0.00 |
We present a unified game-based approach for branching-time model checking of hierarchical systems. Such systems are exponentially more succinct than standard state-transition graphs, as repeated sub-systems are described only once. Early work on model checking of hierarchical systems shows that one can do better than a naive algorithm that ''flattens'' the system and removes the hierarchy. Given a hierarchical system S and a branching-time specification @j for it, we reduce the model-checking problem (does S satisfy @j?) to the problem of solving a hierarchical game obtained by taking the product of S with an alternating tree automaton A"@j for @j. Our approach leads to clean, uniform, and improved model-checking algorithms for a variety of branching-time temporal logics. In particular, by improving the algorithm for solving hierarchical parity games, we are able to solve the model-checking problem for the @m-calculus in Pspace and time complexity that is only polynomial in the depth of the hierarchy. Our approach also leads to an abstraction-refinement paradigm for hierarchical systems. The abstraction maintains the hierarchy, and is obtained by merging both states and sub-systems into abstract states.