A partial order approach to branching time logic model checking

Gerth, Rob; Kuiper, Ruurd; Peled, Doron; Penczek, Wojciech

doi:10.1109/istcs.1995.377038

Cited by 58 publications

(53 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…If a large proportion of events change the value of the predicate, then little to no reduction may be achieved in the size of the constructed state space. Experimental results [10] show that the effectiveness of p.o. techniques diminishes rapidly with an increase in the number of visible events.…”

Section: Introductionmentioning

confidence: 93%

See 1 more Smart Citation

Exploiting predicate structure for efficient reachability detection

Kashyap

Garg

2005

Proceedings of the 20th IEEE/ACM International Conference on Automated Software Engineering

View full text Add to dashboard Cite

Partial order (p.o.) reduction techniques are a popular and effective approach for tackling state space explosion in the verification of concurrent systems. These techniques generate a reduced search space that could be exponentially smaller than the complete state space. Their major drawback is that the amount of reduction achieved is highly sensitive to the properties being verified. For the same program, different properties could result in very different amounts of reduction achieved.We present a new approach which combines the benefits of p.o. reduction with the added advantage that the size of the constructed state space is completely independent of the properties being verified. As in p.o. reduction, we use the notion of persistent sets to construct a representative interleaving for each maximal trace of the program. However, we retain concurrency information by assigning vector timestamps to the events in each interleaving. Our approach hinges upon the use of efficient algorithms that parse the encoded concurrency information in the representative interleaving to determine whether a safety violation exists in any interleaving of the corresponding trace. We show that, for some types of predicates, reachability detection can be performed in time that is polynomial in the length of the interleaving. Typically, these predicates exhibit certain characteristics that can be exploited by the detection algorithm.We implemented our algorithms in the popular model checker SPIN, and present experimental results that demonstrate the effectiveness of our techniques. For example, we verified a distributed dining philosophers protocol in 0.03 seconds, using 1.253 MB of memory. SPIN, using traditional p.o. reduction techniques, took 759.71 seconds and 439.116 MB of memory.

show abstract

Section: Introductionmentioning

confidence: 93%

“…This makes p.o. reduction very sensitive to the predicates being checked [10]. If a large proportion of events change the value of the predicate, then little to no reduction may be achieved in the size of the constructed state space.…”

Section: Introductionmentioning

confidence: 99%

Exploiting predicate structure for efficient reachability detection

Kashyap

Garg

2005

Proceedings of the 20th IEEE/ACM International Conference on Automated Software Engineering

View full text Add to dashboard Cite

show abstract

“…Moreover, after finishing the first two tasks and before starting the last two, we can quit or choose to continue. Finally, after all tasks have been completed, it is allowed to repeat either task 5 or task 6 . We assume that the effect of the even-numbered tasks is visible to the environment (indicated by a change of atomic proposition due to such a transition), while the odd-numbered tasks are invisible.…”

Section: Definition 2 (Mdps) a Markov Decision Process (Mdp) Is Tuplmentioning

confidence: 99%

A comparison of confluence and ample sets in probabilistic and non-probabilistic branching time

Hansen

Timmer

2014

Theoretical Computer Science

View full text Add to dashboard Cite

Confluence reduction and partial order reduction by means of ample sets are two different techniques for state space reduction in both traditional and probabilistic model checking. This paper provides an extensive comparison between these two methods, and answers the question how they relate in terms of reduction power when preserving branching time properties. We prove that, while both preserve the same properties, confluence reduction is strictly more powerful than partial order reduction: every reduction that can be obtained with partial order reduction can also be obtained with confluence reduction, but the converse is not true.The main challenge for the comparison is that confluence reduction was defined in an action-based setting, whereas ample set reduction is often defined in a state-based setting. We therefore redefine confluence reduction in the state-based setting of Markov decision processes, and provide a nontrivial proof of its correctness. Additionally, we pinpoint precisely in what way confluence reduction is more general, and provide conditions under which the two notions coincide. The results we present also hold for non-probabilistic models, as they can just as well be applied in a context where all transitions are non-probabilistic.To discuss the practical applicability of our results, we adapt a state space generation technique based on representative states, already known in combination with confluence reduction, so that it can also be applied to ample sets.

show abstract

“…a termination condition that ensures a proper handling of the distinction between successful and unsuccessful termination as it is present in χ; and 2. a divergence condition similar to one that appears in [10] to ensure the preservation of deadlock and the preservation of CTL * −X . Remark 1.…”

Section: Stuttering Bisimilaritymentioning

confidence: 99%

Stuttering Congruence for χ

Luttik

Trčka

2005

Model Checking Software

View full text Add to dashboard Cite

Abstract. The language χ is a modeling and simulation language which is currently mainly used to analyse and optimize the performance of industrial systems. To be able to also verify functional properties of a system using a χ model, part of the language has been given a formal semantics. Rather than implementing a new model checker for χ, the philosophy is to provide automatic translations from χ into the specification languages of existing state-of-the-art model checkers such as, e.g., Spin and UPPAAL. In this paper, we propose for χ a notion of stuttering congruence, which is an adaptation of the notion of stuttering equivalence. We prove that our notion preserves the validity of CTL * −X formulas, that it preserves deadlock, and that it is indeed a congruence with respect to the constructs of χ. We also indicate how our notion is to be used to establish confidence in the correctness of a translation from χ into Promela.

show abstract

A partial order approach to branching time logic model checking

Cited by 58 publications

References 13 publications

Exploiting predicate structure for efficient reachability detection

Exploiting predicate structure for efficient reachability detection

A comparison of confluence and ample sets in probabilistic and non-probabilistic branching time

Stuttering Congruence for χ

Contact Info

Product

Resources

About