Automata-Driven Partial Order Reduction and Guided Search for LTL Model Checking

2022 ◽  
pp. 151-173
Author(s):  
Peter Gjøl Jensen ◽  
Jiří Srba ◽  
Nikolaj Jensen Ulrik ◽  
Simon Mejlby Virenfeldt
Keyword(s):  
Model Checking ◽  
Partial Order ◽  
Order Reduction ◽  
Partial Order Reduction ◽  
Guided Search ◽  
Ltl Model Checking

scholarly journals Partial-Order Reduction for Parity Games with an Application on Parameterised Boolean Equation Systems

2020 ◽  
pp. 307-324 ◽  
Author(s):  
Thomas Neele ◽  
Tim A. C. Willemse ◽  
Wieger Wesselink
Keyword(s):  
Fixed Point ◽  
Model Checking ◽  
Partial Order ◽  
Order Reduction ◽  
Partial Order Reduction ◽  
State Space Explosion ◽  
Boolean Equation ◽  
Parity Games ◽  
High Level ◽  
Established Technique

Abstract Partial-order reduction (POR) is a well-established technique to combat the problem of state-space explosion. We propose POR techniques that are sound for parity games, a well-established formalism for solving a variety of decision problems. As a consequence, we obtain the first POR method that is sound for model checking for the full modal $$\mu $$-calculus. Our technique is applied to, and implemented for the fixed point logic called parameterised Boolean equation systems, which provides a high-level representation of parity games. Experiments indicate that substantial reductions can be achieved.

scholarly journals Dynamic partial-order reduction for model checking software

2005 ◽  
Vol 40 (1) ◽  
pp. 110-121 ◽  
Author(s):  
Cormac Flanagan ◽  
Patrice Godefroid
Keyword(s):  
Model Checking ◽  
Partial Order ◽  
Order Reduction ◽  
Partial Order Reduction
Sign in / Sign up

Export Citation Format

Share Document