A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Efficient ω-regular language containment
[chapter]
1993
Lecture Notes in Computer Science
One method for proving properties about a design is by using L-automata [Kur90]. The main computation involves building the product machine of the system and specification, and then checking for cycles not contained in any of the cycle sets (these are sets of states specified by the user). In [Tou91] two methods were introduced for performing the above task; one involves computing the transitive closure of the product machine, and the other is an application of a method due to ). We have
doi:10.1007/3-540-56496-9_31
fatcat:cxc5tkcmofejvpr75us6x2pt7i