LTLModelChecking.pptVIP

* * * * * * * * * Emptiness of ?-Automata On the Fly Partial Order Reduction Questions? * * * * * * * * * * * * * * * * * * * * * * * * * * * * Union Theorem L(A1?A2 ) = L(A1 ) ? L(A2) Intersection Given two automaton A1=?,S1,?1,I1,F1, A2=?,S2,?2,I2,F2. Define A1?A2= ?,S,?,I,F where S = S1 x S2 ? = { ((s1,s2),a,((s1’,s2’))| (s1,a,s1’)??1, (s2,a,s2’)??2 } I = I1 x I2 F = { f x S2 | f ?F1} ? { S1 x f| f ?F2} Intersection Theorem L(A1 ? A2 ) = L(A1 ) ? L(A2) Complementation The set of GBAs is closed under complemen