Symbolic CTL Model Checking of Asynchronous Systems Using Constrained Saturation

@inproceedings{Zhao2009SymbolicCM,
  title={Symbolic CTL Model Checking of Asynchronous Systems Using Constrained Saturation},
  author={Yang Zhao and Gianfranco Ciardo},
  booktitle={ATVA},
  year={2009}
}
The saturation state-space generation algorithm has demonstrated clear improvements over state-of-the-art symbolic methods for asynchronous systems. This work is motivated by efficiently applying saturation to CTL model checking. First, we introduce a new “constrained saturation” algorithm which constrains state exploration to a set of states satisfying given properties. This algorithm avoids the expensive afterthe-fact intersection operations and retains the advantages of saturation, namely… CONTINUE READING
Highly Cited
This paper has 29 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 15 extracted citations

Property-Preserving Generation of Tailored Benchmark Petri Nets

2017 17th International Conference on Application of Concurrency to System Design (ACSD) • 2017
View 1 Excerpt

Symbolic Termination and Confluence Checking for ECA Rules

Trans. Petri Nets and Other Models of Concurrency • 2014
View 3 Excerpts

References

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

Graph-Based Algorithms for Boolean Function Manipulation

IEEE Transactions on Computers • 1986
View 5 Excerpts
Highly Influenced

The saturation algorithm for symbolic state-space exploration

International Journal on Software Tools for Technology Transfer • 2005
View 3 Excerpts

Logical and Stochastic Modeling with SMART

Computer Performance Evaluation / TOOLS • 2003
View 8 Excerpts

Similar Papers

Loading similar papers…