作者: Rajeev Alur , Sampath Kannan , Mihalis Yannakakis
关键词:
摘要: Hierarchical state machines are finite whose states themselves can be other machines. In spite of their popularity in many modeling tools for software design, very little is known concerning complexity and expressiveness. this paper, we study these questions hierarchical as well communicating machines, that is, extended with both hierarchy concurrency. We present a comprehensive set results characterizing (1) the reachability, emptiness universality problems, (2) language inclusion equivalence (3) succinctness relationships between different types