Titlebook: Verification of Digital and Hybrid Systems; M. Kemal Inan,Robert P. Kurshan Book 2000 Springer-Verlag Berlin Heidelberg 2000 algorithms.au

Mundane

Model Checking Using Automata TheoryIn this chapter, we describe the theory of LTL model checking using w- automata theory. The relation between model checking algorithms and automata theory allows applying various known results about automata to the automatic verification of programs.

hypertension

Symbolic Model CheckingBecause of the state explosion problem, “explicit state” model checkers are limited in their application. One Solution to this problem is to use an implicit “symbolic” representation of State transitions and state labelings. This technique is called symbolic model checking [1,2]

殘酷的地方

Symmetry and Model Checking— Some Systems exhibit significant symmetry, for example — a network of many indistinguisahble processes — a ring symmetric under rotations — Example: mutual exclusion protocol — the two processes P. and P. are Symmetric, e.g., consider the states {xxx151_008}

HUMP

forbid