On-the-fly verification with stubborn sets [chapter]

Antti Valmari
1993 Lecture Notes in Computer Science  
A new on-the-fly verification method is presented. The method uses a generalization of Bilchi automata called "tester processes" for representing and detecting illegal behaviour. To reduce the number of states that are constructed the method applies the stubborn set theory in a new way. The method can be used in connection with the "Supertrace" memory-saving technique. A simple algorithm is Suggested for efficient detection of violations of an important subclass of liveness properties during the construction of the reduced state space.
doi:10.1007/3-540-56922-7_33 fatcat:7u6p3cplnrc3zerzcgid2bohai