2001
DOI: 10.1007/3-540-45510-8_1
|View full text |Cite
|
Sign up to set email alerts
|

Model Checking: A Tutorial Overview

Abstract: Abstract.We survey principles of model checking techniques for the automatic analysis of reactive systems. The use of model checking is exemplified by an analysis of the Needham-Schroeder public key protocol. We then formally define transition systems, temporal logic, ω-automata, and their relationship. Basic model checking algorithms for linear-and branching-time temporal logics are defined, followed by an introduction to symbolic model checking and partial-order reduction techniques. The paper ends with a li… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
39
0

Year Published

2002
2002
2017
2017

Publication Types

Select...
3
2
2

Relationship

0
7

Authors

Journals

citations
Cited by 59 publications
(39 citation statements)
references
References 127 publications
(125 reference statements)
0
39
0
Order By: Relevance
“…The finiteness of the transition system is essential and allows to decide property satisfaction in pspace using an automata-theoretic approach (see e.g. [10,29]). In contrast, artifacts are infinite-state systems because of the presence of unbounded data.…”
Section: Examplementioning
confidence: 99%
“…The finiteness of the transition system is essential and allows to decide property satisfaction in pspace using an automata-theoretic approach (see e.g. [10,29]). In contrast, artifacts are infinite-state systems because of the presence of unbounded data.…”
Section: Examplementioning
confidence: 99%
“…It has been used in several works. In [Merz01,Merz00], SPIN has been used to model check state machines and collaborations together, and more particularly concurrent state machines using concurrent regions of a superstate. Their approach consists of verifying that the collective behavior of the objects specified by the collaboration diagram can be satisfied by a set of state-transition diagrams.…”
Section: Related Workmentioning
confidence: 99%
“…A model checker is an automatic tool that compares two descriptions of the behavior of a system, one being considered as the requirement and the other the actual design [Gallardo02]. The main usefulness of such a technique is the fact that the automatic tool, upon encountering an error state, returns a counterexample illustrating the path taken to reach that state [Gallardo02,Merz00,Merz01,Lam04]. However, Model Checking suffers from a major problem, known as the state space explosion problem [Gallardo02].…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…This environment could be the controlled system or other components of a communication network. Therefore, they are called reactive systems [Mer01]. Traditional models that describe computer programs as result of a computational function from given input parameters are virtually inadequate for the description of reactive systems.…”
Section: Interoperabilitymentioning
confidence: 99%