The Model Checker SPIN课件.pptVIP

The model checker SPIN The Model Checker SPIN SPIN Promela SPIN(=Simple Promela Interpreter) tool for analyzing the logical consistency of concurrent systems concurrent systems are described in the modeling language called Promela Promela(=Protocol/Process Meta Language) dynamic creation of concurrent processes communication via message channels specification language to model finite-state model C like What is SPIN? (1) “Press on the button” model-checker, based on automata theory A popular open-source software tool that can be used for the formal verification of asynchronous and distributed asynchronous and distributed software systems. Developed in Bell Laboratories. What is SPIN? (2) Spin can be used in 2 basic modes : as a simulator to get a quick impression of the types of the behaviour captured by the system model: guided simulation random and interactive simulation as a verifier generator: when a counterexample is generated, it uses simulation to step through the trace Promela Non-deterministic , guarded command language for specifying the possible system behaviours in a distributed system design Systems of interacting, asynchronous threads of execution It brings ideas from: CSP process algebra by Hoare for input/output C language in some of the syntax and notational conventions a non-deterministic guarded command language (without msg passing primitives) by Dijkstra Promela Model Promela model consists of type declaration channel declarations variable declarations process declarations [init process] A Promela model corresponds with a FSM, so: no unbounded data no unbounded channels no unbounded processes no unbounded process creation Processes A process type consists of a name a list of formal parameters local variable declarations body A process executes concurrently with all other processes, independent of speed of behaviour There may be several processes of the same type Each process has its own local state (process counter, local variables) Process ins