A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
Automata-theoretic verification is based upon the language containment test L(P0 | P1 | | Pk) c Z(T) where the P,'s are automata which together model a system with its fairness constraints, | is a parallel composition for automata and T defines a specification. The complexity of that test typically grows exponentially with k. This growth, often called "state explosion", has been a major impediment to computer-aided verification, and many heuristics which are successful in special cases, havedoi:10.1007/3-540-58179-0_57 fatcat:w5agnsorobggzhmv2xrpkbx5mu