Tutorial I ndash; An Introduction to Model Checking课件.pptVIP

Tutorial I – An Introduction to Model Checking Peng WU INRIA Futurs LIX, école Polytechnique Outline Model Checking Temporal Logic Model Checking Algorithms Symbolic Model Checking Advanced Topics Symmetry Reduction Partial-Order Reduction Infinite Model Checking Principles Increase our confidence in the correctness of the model: The model satisfied enough system properties Study counterexamples, pinpoint the source of the error, correct the model, and try again Kripke Model Kripke Structure + Labeling Function Let AP be a non-empty set of atomic propositions. Kripke Model: M = (S, s0, R, L) S finite set of states s0?S initial state R?S ? S transition relation L: S→2AP labeling function Temporal Logics Express properties of event orderings in time Linear Temporal Logic (Path) Formulas p – atomic proposition ?p, p?q, p?q Op, ?p, ??p, pUq, pRq Semantics M, ? |= p if p?L(?0) M, ? |= ?p if not M, ? |= p M, ? |= p?q if M, ? |= p and M, ? |= q M, ? |= p?q if M, ? |= p or M, ? |= q LTL Semantics M, ? |= Op if M, ?1 |= p M, ? |= ??p if ?i≥0: M, ?i |= p M, ? |= ?p if ?i≥0: M, ?i |= p M, ? |= pUq if ?i≥0: M, ?i |= q and ?ji: M, ?j |= p M, ? |= pRq if ?i≥0: M, ?i |= q or ?i≥0: M, ?i |= p and ?j≤i: M, ?j |= q LTL ??p ?p pUq pRq LTL Satisfiability The satisfiability problem of LTL is PSPACE-complete. If a LTL formula is satisfiable, then the formula is satisfiable by a finite kripke model. LTL Model Checking: PSAPCE-complete LTL Model Checking ω-Regular Languages ω-Automata Finite states Representing infinite executions Büchi Automata Σ, S, Δ, I, L, F AP, S, R , {s0}, L - Kripke Model LTL Model Checking We can build a Büchi automaton which accepts all and only the infinite traces represented by an LTL formula. The Büchi automaton is exponential in the size of the formula. The complexity of model checking is proportional to the size of the automaton. Computation Tree Logic (State) Formulas p - atomic proposition ?p