Statecharts: A visual formalism for complex systems
Science of Computer Programming
Real-time object-oriented modeling
Real-time object-oriented modeling
On the power of bounded concurrency I: finite automata
Journal of the ACM (JACM)
IEEE Spectrum
IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
Model checking of hierarchical state machines
SIGSOFT '98/FSE-6 Proceedings of the 6th ACM SIGSOFT international symposium on Foundations of software engineering
The Unified Modeling Language user guide
The Unified Modeling Language user guide
On the Complexity of Verifying Concurrent Transition Systems
CONCUR '97 Proceedings of the 8th International Conference on Concurrency Theory
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic
Logic of Programs, Workshop
Fully-Abstract Statecharts Semantics via Intuitionistic Kripke Models
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Model Checking of Unrestricted Hierarchical State Machines
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Pattern Matching and Membership for Hierarchical Message Sequence Charts
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Exploiting Hierarchical Structure for Efficient Formal Verification
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
The State Explosion Problem from Trace to Bisimulation Equivalence
FOSSACS '00 Proceedings of the Third International Conference on Foundations of Software Science and Computation Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software,ETAPS 2000
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
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
Verification of well-formed communicating recursive state machines
VMCAI'06 Proceedings of the 7th international conference on Verification, Model Checking, and Abstract Interpretation
Modeling long–running transactions with communicating hierarchical timed automata
FMOODS'06 Proceedings of the 8th IFIP WG 6.1 international conference on Formal Methods for Open Object-Based Distributed Systems
Communities of Interacting Automata for Modelling Distributed Systems with Dynamic Structure
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2003)
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P'2002), Part 1
TACAS'13 Proceedings of the 19th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Recovery within long-running transactions
ACM Computing Surveys (CSUR)
An Algorithm for the Identification of Components in Biochemical Pathways
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
Hierarchical state machines are finite state machines whose states themselves can be other machines. In spite of their popularity in many modeling tools for software design, very little is known concerning their complexity and expressiveness. In this paper, we study these questions for hierarchical state machines as well as for communicating hierarchical state machines, that is, finite state machines extended with both hierarchy and concurrency. We present a comprehensive set of results characterizing (1) the complexity of the reachability, emptiness and universality problems, (2) the complexity of the language inclusion and equivalence problems, and (3) the succinctness relationships between different types of machines.