# Verifying Interacting Finite State Machines

### A. Aziz and Robert K. Brayton

###
EECS Department

University of California, Berkeley

Technical Report No. UCB/ERL M93/52

1993

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.

BibTeX citation:

@techreport{Aziz:M93/52, Author = {Aziz, A. and Brayton, Robert K.}, Title = {Verifying Interacting Finite State Machines}, Institution = {EECS Department, University of California, Berkeley}, Year = {1993}, URL = {http://www.eecs.berkeley.edu/Pubs/TechRpts/1993/2383.html}, Number = {UCB/ERL M93/52}, Abstract = {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.} }

EndNote citation:

%0 Report %A Aziz, A. %A Brayton, Robert K. %T Verifying Interacting Finite State Machines %I EECS Department, University of California, Berkeley %D 1993 %@ UCB/ERL M93/52 %U http://www.eecs.berkeley.edu/Pubs/TechRpts/1993/2383.html %F Aziz:M93/52