### Abstract

*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 language | English |
---|---|

Pages (from-to) | 297-322 |

Number of pages | 26 |

Journal | Formal Methods in System Design |

Volume | 1 |

Issue number | 4 |

DOIs | |

Publication status | Published - 1992 |

MoE publication type | A1 Journal article-refereed |

### Fingerprint

### Cite this

*Formal Methods in System Design*,

*1*(4), 297-322. https://doi.org/10.1007/BF00709154

}

*Formal Methods in System Design*, vol. 1, no. 4, pp. 297-322. https://doi.org/10.1007/BF00709154

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

Research output: Contribution to journal › Article › Scientific › peer-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 -