Improving partial order reductions for universal branching time properties

Bounded model checking for the universal fragment of CTL

Fundamenta Informaticae

Minimizing the number of successor states in the stubborn set method

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

Model checking for multi-valued computation tree logics

Beyond two

On Stubborn Sets in the Verification of Linear Time Temporal Properties

Formal Methods in System Design

ACTLS properties and Bounded Model Checking

Fundamenta Informaticae

Towards Partial Order Reduction for Model Checking Temporal Epistemic Logic

Model Checking and Artificial Intelligence

Partial order reductions for model checking temporal epistemic logics over interleaved multi-agent systems

Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1

Partial Order Reductions for Model Checking Temporal-epistemic Logics over Interleaved Multi-agent Systems

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