Reducing Model Checking from Multi-valued {\rm CTL}^{\ast} to {\rm CTL}^{\ast}
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
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
On Stubborn Sets in the Verification of Linear Time Temporal Properties
Formal Methods in System Design
Slicing of Timed Automata with Discrete Data
Fundamenta Informaticae - SPECIAL ISSUE ON CONCURRENCY SPECIFICATION AND PROGRAMMING (CS&P 2005) Ruciane-Nide, Poland, 28-30 September 2005
Symbolic model checking for temporal-epistemic logics
ACM SIGACT News
Towards Partial Order Reduction for Model Checking Temporal Epistemic Logic
Model Checking and Artificial Intelligence
Branching Bisimilarity with Explicit Divergence
Fundamenta Informaticae
Graded-CTL: Satisfiability and Symbolic Model Checking
ICFEM '09 Proceedings of the 11th International Conference on Formal Engineering Methods: Formal Methods and Software Engineering
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Model-checking games for fixpoint logics with partial order models
Information and Computation
Combining partial-order reduction and symbolic model checking to verify LTL properties
NFM'11 Proceedings of the Third international conference on NASA Formal methods
Improving spin's partial-order reduction for breadth-first search
SPIN'05 Proceedings of the 12th international conference on Model Checking Software
SPIN'05 Proceedings of the 12th international conference on Model Checking Software
IFM'05 Proceedings of the 5th international conference on Integrated Formal Methods
Partial-Order reduction for general state exploring algorithms
SPIN'06 Proceedings of the 13th international conference on Model Checking Software
Symbolic model checking for temporal-epistemic logic
Logic Programs, Norms and Action
Branching Bisimilarity with Explicit Divergence
Fundamenta Informaticae
Slicing of Timed Automata with Discrete Data
Fundamenta Informaticae - SPECIAL ISSUE ON CONCURRENCY SPECIFICATION AND PROGRAMMING (CS&P 2005) Ruciane-Nide, Poland, 28-30 September 2005
Improving Partial Order Reductions for Universal Branching Time Properties
Fundamenta Informaticae
Stable Models for Stubborn Sets
Fundamenta Informaticae
A survey on temporal logics for specifying and verifying real-time systems
Frontiers of Computer Science: Selected Publications from Chinese Universities
| Hi-index | 0.00 |