Reachability in discrete event systems modeled as hierarchical state machines

Abstract

Discrete event systems (DESs) are systems in which state changes take place in response to events that occur discretely, asynchronously and often nondeterministically. This paper considers a class of DESs modeled as hierarchical state machines (HSMs), a special case of the statecharts formalism. The authors provide an efficient algorithm for solving reachability problems in the HSM framework that utilizes the hierarchical structure of HSMs. This efficient solution is used extensively in control applications, where controllers achieving a desired behaviour are synthesized on-line.<>