( en | de | ru )

 

Disambiguation of "Valmari, Antti"

Author of the publication

copydeleteadd this publication to your clipboard
Relaxed Visibility Enhances Partial Order Reduction.

, , and . Formal Methods Syst. Des., 19 (3): 275-289 (2001)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Antti Punkka

Harry Anttila

Antti Ojala

Antti Marjanen

Antti Tölli

 

Other publications of authors with the same name

Question-guided stubborn set methods for state properties., , and . Formal Methods Syst. Des., 29 (3): 215-251 (2006)A Stubborn Attack on State Explosion.. Formal Methods Syst. Des., 1 (4): 297-322 (1992)Stubborn Set Intuition Explained., and . Trans. Petri Nets Other Model. Concurr., (2017)Fair testing and stubborn sets., and . Int. J. Softw. Tools Technol. Transf., 20 (5): 589-610 (2018)Liveness and Fairness in Process-Algebraic Verification., and . CONCUR, volume 2154 of Lecture Notes in Computer Science, page 202-217. Springer, (2001)The Weakest Compositional Semantic Equivalence Preserving Nexttime-less Linear temporal Logic., and . CONCUR, volume 630 of Lecture Notes in Computer Science, page 207-221. Springer, (1992)Relaxed Visibility Enhances Partial Order Reduction., , and . CAV, volume 1254 of Lecture Notes in Computer Science, page 328-339. Springer, (1997)On-the-Fly Verification with Stubborn Sets.. CAV, volume 697 of Lecture Notes in Computer Science, page 397-408. Springer, (1993)Exploring the Scope for Partial Order Reduction., , and . ATVA, volume 5799 of Lecture Notes in Computer Science, page 39-53. Springer, (2009)Can Stubborn Sets Be Optimal?, and . Fundam. Informaticae, 113 (3-4): 377-397 (2011)