An Efficient Partial Order Reduction Algorithm with an Alternative Proviso Implementation
Formal Methods in System Design
Minimizing the number of successor states in the stubborn set method
Fundamenta Informaticae
MOVEP '00 Proceedings of the 4th Summer School on Modeling and Verification of Parallel Processes
Stubborn Sets for Standard Properties
Proceedings of the 20th International Conference on Application and Theory of Petri Nets
Abstractions and Partial Order Reductions for Checking Branching Properties of Time Petri Nets
ICATPN '01 Proceedings of the 22nd International Conference on Application and Theory of Petri Nets
State Space Reduction by Proving Confluence
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Modeling and verification of parallel processes
Towards ambitious approximation algorithms in stubborn set optimization
Fundamenta Informaticae - Concurrency specification and programming
On Stubborn Sets in the Verification of Linear Time Temporal Properties
Formal Methods in System Design
ProbMela and verification of Markov decision processes
ACM SIGMETRICS Performance Evaluation Review
Quantitative analysis of distributed randomized protocols
Proceedings of the 10th international workshop on Formal methods for industrial critical systems
Optimistic synchronization-based state-space reduction
Formal Methods in System Design
Question-guided stubborn set methods for state properties
Formal Methods in System Design
Compositional State Space Reduction Using Untangled Actions
Electronic Notes in Theoretical Computer Science (ENTCS)
Shared Hash Tables in Parallel Model Checking
Electronic Notes in Theoretical Computer Science (ENTCS)
Partial Order Reductions Using Compositional Confluence Detection
FM '09 Proceedings of the 2nd World Congress on Formal Methods
Model Checking Linearizability via Refinement
FM '09 Proceedings of the 2nd World Congress on Formal Methods
Optimistic synchronization-based state-space reduction
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
On the origin of events: branching cells as stubborn sets
PETRI NETS'11 Proceedings of the 32nd international conference on Applications and theory of Petri Nets
Differencing labeled transition systems
ICFEM'11 Proceedings of the 13th international conference on Formal methods and software engineering
Partial order reduction for markov decision processes: a survey
FMCO'05 Proceedings of the 4th international conference on Formal Methods for Components and Objects
On reduction criteria for probabilistic reward models
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
IFM'05 Proceedings of the 5th international conference on Integrated Formal Methods
Stubborn sets for simple linear time properties
PETRI NETS'12 Proceedings of the 33rd international conference on Application and Theory of Petri Nets
Towards Ambitious Approximation Algorithms in Stubborn Set Optimization
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P'2002), Part 1
Minimizing the Number of Successor States in the Stubborn Set Method
Fundamenta Informaticae - Concurrency Specification and Programming Workshop (CS&P'2001)
Improving Partial Order Reductions for Universal Branching Time Properties
Fundamenta Informaticae
Analyzing and Reducing Simultaneous Firing in Signal-Event Nets
Fundamenta Informaticae
| Hi-index | 0.01 |