Concurrent Symbolic Verification of Liveness Properties for Interleaved Models
Felice Balarin · Electronic Notes in Theoretical Computer Science · 2001
Interleaved models of computations limit the number of system components that can change states simultaneously. This interleaving constraint often decreases efficiency of symbolic verification methods. It was shown previously that the constraint can be (possibly partially) removed while still preserving safety properties of systems. We propose two extensions of this approach to liveness properties. The first one does not require changes to existing verification algorithms, while the second (which is usually more efficient) does. Our experiments indicate that both approaches can drastically reduce verification time.