On Combining the Persistent Sets Method with the Covering Steps Graph Method

@inproceedings{Ribet2002OnCT,
  title={On Combining the Persistent Sets Method with the Covering Steps Graph Method},
  author={Pierre-Olivier Ribet and François Vernadat and Bernard Berthomieu},
  booktitle={FORTE},
  year={2002}
}
Concurrent systems are commonly veriied after computing a state graph describing all possible behaviors. Unfortunately, this state graph is often too large to be eeectively built. Partial-order techniques have been developed to avoid combinatorial explosion while preserving the properties of interest. This paper investigates the combination of two such approaches, persistent sets and covering steps, and proposes partial enumeration algorithms that cumulate their respective beneets. 
Highly Cited
This paper has 26 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 14 references

Petri Nets : an Introduction

W. Reisig
Springer-Verlag,EATCS • 1985
View 3 Excerpts
Highly Influenced

Ten years of partial order reduction

D. Freestone.
Proceedings of CAV ' 98 , pages 17 { 28 • 1998

Partial - order methods for temporal veri cation

P. Godefroid.
Proceedings of CONCUR ' 93 • 1997

Re ning dependencies improves partialorderveri cation methods

D. Pirottin.
Proceedings of CAV ' 93 . Springer Verlag • 1996

Using partial orders for the e  cient veri cationof deadlock freedom and safety properties

P. Wolper
Formal Methods in System Design • 1993

Communication and Concurrency

R. Milner
Prentice Hall • 1989
View 1 Excerpt