Automata-Theoretic techniques for modal logics of programs
Journal of Computer and System Sciences
Handbook of theoretical computer science (vol. B)
Object-oriented modeling and design
Object-oriented modeling and design
Real-time object-oriented modeling
Real-time object-oriented modeling
IEEE Spectrum
The Unified Modeling Language user guide
The Unified Modeling Language user guide
Model checking of hierarchical state machines
ACM Transactions on Programming Languages and Systems (TOPLAS)
Bebop: A Symbolic Model Checker for Boolean Programs
Proceedings of the 7th International SPIN Workshop on SPIN Model Checking and Software Verification
Efficient Reachability Analysis of Hierarchical Reactive Machines
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Exploiting Behavioral Hierarchy for Efficient Model Checking
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic
Logic of Programs, Workshop
Analysis of recursive state machines
ACM Transactions on Programming Languages and Systems (TOPLAS)
The temporal logic of programs
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
Verification of well-formed communicating recursive state machines
VMCAI'06 Proceedings of the 7th international conference on Verification, Model Checking, and Abstract Interpretation
Program Complexity in Hierarchical Module Checking
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Fundamenta Informaticae - Advances in Computational Logic (CIL C08)
Graded CTL model checking for test generation
Proceedings of the 2011 Symposium on Theory of Modeling & Simulation: DEVS Integrative M&S Symposium
Improved model checking of hierarchical systems
Information and Computation
Improved model checking of hierarchical systems
VMCAI'10 Proceedings of the 11th international conference on Verification, Model Checking, and Abstract Interpretation
Fundamenta Informaticae - Advances in Computational Logic (CIL C08)
| Hi-index | 0.00 |
A hierarchical state machine (Hsm) is a finite state machine where a vertex can either expand to another hierarchical state machine (box) or be a basic vertex (node). Each node is labeled with atomic propositions. We study an extension of such model which allows atomic propositions to label also boxes (Shsm). We show that Shsms can be exponentially more succinct than Shsms and verification is in general harder by an exponential factor. We carefully establish the computational complexity of reachability, cycle detection, and model checking against general Ltl and Ctl specifications. We also discuss some natural and interesting restrictions of the considered problems for which we can prove that Shsms can be verified as much efficiently as Hsms, still preserving an exponential gap of succinctness.