Partial order reduction: linear and branching temporal logics and process algebras

An Efficient Partial Order Reduction Algorithm with an Alternative Proviso Implementation

Formal Methods in System Design

Bounded model checking for the universal fragment of CTL

Fundamenta Informaticae

Reducing Model Checking from Multi-valued {\rm CTL}^{\ast} to {\rm CTL}^{\ast}

CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory

Towards Bounded Model Checking for the Universal Fragment of TCTL

FTRTFT '02 Proceedings of the 7th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems: Co-sponsored by IFIP WG 2.2

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

Model checking for multi-valued computation tree logics

Beyond two

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

Symmetry in temporal logic model checking

ACM Computing Surveys (CSUR)

Feature interaction detection by pairwise analysis of LTL properties: a case study

Formal Methods in System Design

ACTLS properties and Bounded Model Checking

Fundamenta Informaticae

Compositional State Space Reduction Using Untangled Actions

Electronic Notes in Theoretical Computer Science (ENTCS)

Bounded Model Checking for the Existential Fragment of TCTL_{-G} and Diagonal Timed Automata

Fundamenta Informaticae

Quantitative Analysis under Fairness Constraints

ATVA '09 Proceedings of the 7th International Symposium on Automated Technology for Verification and Analysis

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

Transparent partial order reduction

Formal Methods in System Design

Exp.Open 2.0: a flexible tool integrating partial order, compositional, and on-the-fly verification methods

IFM'05 Proceedings of the 5th international conference on Integrated Formal Methods

Bounded Model Checking for the Existential Fragment of TCTL$_{-G}$ and Diagonal Timed Automata

Fundamenta Informaticae

ACTLS properties and Bounded Model Checking

Fundamenta Informaticae

Bounded Model Checking for the Universal Fragment of CTL

Fundamenta Informaticae - Concurrency Specification and Programming Workshop (CS&P'2001)

Improving Partial Order Reductions for Universal Branching Time Properties

Fundamenta Informaticae