A stubborn attack on state explosion

Antti Valmari

Research output: Contribution to journalArticleScientificpeer-review

119 Citations (Scopus)

Abstract

This article presents the LTL-preserving stubborn set method for reducing the amount of work needed in the automatic verification of concurrent systems with respect to linear-time temporal logic specifications. The method facilitates the generation ofreduced state spaces such that the truth values of linear temporal logic formulas are the same in the ordinary and reduced state spaces. The only restrictions posed by the method are 1) the formulas must be known before the reduced state-space generation is commenced; 2) the use of the temporal operator “next state” is prohibited; and 3) the (reduced) state space of the system must be finite. The method cuts down the number of states by utilizing the fact that in concurrent systems the net result of the occurrence of two events is often independent of the order of occurrence.
Original languageEnglish
Pages (from-to)297-322
Number of pages26
JournalFormal Methods in System Design
Volume1
Issue number4
DOIs
Publication statusPublished - 1992
MoE publication typeA1 Journal article-refereed

Fingerprint

Temporal logic
Explosion
Explosions
State Space
Attack
Concurrent Systems
Specifications
Automatic Verification
Linear Temporal Logic
Temporal Logic
Linear Time
Specification
Restriction
Operator

Cite this

Valmari, Antti. / A stubborn attack on state explosion. In: Formal Methods in System Design. 1992 ; Vol. 1, No. 4. pp. 297-322.
@article{9e21b827670744b88d326f5c96dd2ea1,
title = "A stubborn attack on state explosion",
abstract = "This article presents the LTL-preserving stubborn set method for reducing the amount of work needed in the automatic verification of concurrent systems with respect to linear-time temporal logic specifications. The method facilitates the generation ofreduced state spaces such that the truth values of linear temporal logic formulas are the same in the ordinary and reduced state spaces. The only restrictions posed by the method are 1) the formulas must be known before the reduced state-space generation is commenced; 2) the use of the temporal operator “next state” is prohibited; and 3) the (reduced) state space of the system must be finite. The method cuts down the number of states by utilizing the fact that in concurrent systems the net result of the occurrence of two events is often independent of the order of occurrence.",
author = "Antti Valmari",
note = "Project code: TKO0018",
year = "1992",
doi = "10.1007/BF00709154",
language = "English",
volume = "1",
pages = "297--322",
journal = "Formal Methods in System Design",
issn = "0925-9856",
publisher = "Springer",
number = "4",

}

A stubborn attack on state explosion. / Valmari, Antti.

In: Formal Methods in System Design, Vol. 1, No. 4, 1992, p. 297-322.

Research output: Contribution to journalArticleScientificpeer-review

TY - JOUR

T1 - A stubborn attack on state explosion

AU - Valmari, Antti

N1 - Project code: TKO0018

PY - 1992

Y1 - 1992

N2 - This article presents the LTL-preserving stubborn set method for reducing the amount of work needed in the automatic verification of concurrent systems with respect to linear-time temporal logic specifications. The method facilitates the generation ofreduced state spaces such that the truth values of linear temporal logic formulas are the same in the ordinary and reduced state spaces. The only restrictions posed by the method are 1) the formulas must be known before the reduced state-space generation is commenced; 2) the use of the temporal operator “next state” is prohibited; and 3) the (reduced) state space of the system must be finite. The method cuts down the number of states by utilizing the fact that in concurrent systems the net result of the occurrence of two events is often independent of the order of occurrence.

AB - This article presents the LTL-preserving stubborn set method for reducing the amount of work needed in the automatic verification of concurrent systems with respect to linear-time temporal logic specifications. The method facilitates the generation ofreduced state spaces such that the truth values of linear temporal logic formulas are the same in the ordinary and reduced state spaces. The only restrictions posed by the method are 1) the formulas must be known before the reduced state-space generation is commenced; 2) the use of the temporal operator “next state” is prohibited; and 3) the (reduced) state space of the system must be finite. The method cuts down the number of states by utilizing the fact that in concurrent systems the net result of the occurrence of two events is often independent of the order of occurrence.

U2 - 10.1007/BF00709154

DO - 10.1007/BF00709154

M3 - Article

VL - 1

SP - 297

EP - 322

JO - Formal Methods in System Design

JF - Formal Methods in System Design

SN - 0925-9856

IS - 4

ER -