Hierarchical State Machines

  • Authors:
  • Mihalis Yannakakis

  • Affiliations:
  • -

  • Venue:
  • TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
  • Year:
  • 2000

Quantified Score

Hi-index 0.00

Visualization

Abstract

Hierarchical state machines are finite state machines whose states themselves can be other state machines. Hierarchy is a useful construct in many modeling formalisms and tools for software design, requirements and testing. We summarize recent work on hierarchical state machines with or without concurrency. We discuss issues of expressiveness and succinctness, the complexity of basic operations (such as emptiness, equivalence etc.), and algorithmic problems in the analysis of hierarchical machines to check for their properties.