II. Partial Orders

Computer-Aided Verification

Volume 531 of the series Lecture Notes in Computer Science pp 156-165


A stubborn attack on state explosion

  • Antti ValmariAffiliated withComputer Technology Laboratory, Technical Research Centre of Finland

* Final gross prices may vary according to local VAT.

Get Access


The paper 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 of reduced state spaces such that the truth values of a collection of linear temporal logic formulas are the same in the ordinary and reduced state spaces. The only restrictions posed by the method are that the collection of formulas must be known before the reduced state space generation is commenced, the use of the temporal operator “next” is prohibited, and the (reduced) state space of the system must be finite. The method cuts down the number of states by utilising the fact that in concurrent systems the nett result of the occurrence of two events is often independent of the order of occurrence.