BDD variable ordering for interacting finite state machines
DAC '94 Proceedings of the 31st annual Design Automation Conference
Formula-Dependent Equivalence for Compositional CTL Model Checking
Formal Methods in System Design
Enhanced Diameter Bounding via Structural
Proceedings of the conference on Design, automation and test in Europe - Volume 1
| Hi-index | 0.01 |
In this report a model of interacting finite state machines is defined. Complexity-theoretic lower bounds on one-step reachability, generalized reachability, language containment, CTL model checking, trace equivalence, and bisimulation equivalence on such structures are established. State minimization is proposed as a mechanism for hierarchical verification. Generalized notions of state equivalence are introduced and minimality of the resulting quotient machines is discussed. Computing complete state equivalence is shown to be intractable and heuristics for computing a weaker equivalences are outlined.