Minimizing the Number of Successor States in the Stubborn Set Method
暂无分享,去创建一个
[1] Doron A. Peled,et al. All from One, One for All: on Model Checking Using Representatives , 1993, CAV.
[2] Wojciech Penczek,et al. Improving Partial Order Reductions for Universal Branching Time Properties , 2000, Fundam. Informaticae.
[3] Karsten Schmidt. Stubborn sets for model checking the EF/AG fragment of CTL , 2000 .
[4] Kimmo Varpaaniemi,et al. Stable Models for Stubborn Sets , 2000, Fundam. Informaticae.
[5] Robin Milner,et al. A Calculus of Communicating Systems , 1980, Lecture Notes in Computer Science.
[6] Timo Soininen,et al. Extending and implementing the stable model semantics , 2000, Artif. Intell..
[7] Patrice Godefroid,et al. Partial-Order Methods for the Verification of Concurrent Systems , 1996, Lecture Notes in Computer Science.
[8] Antti Valmari,et al. Stubborn set methods for process algebras , 1997, Partial Order Methods in Verification.
[9] C. A. R. Hoare,et al. Communicating Sequential Processes (Reprint) , 1983, Commun. ACM.
[10] Gerard J. Holzmann,et al. Partial Order Methods in Verification , 1997 .