Share This Author
Solving Parity Games in Practice
A generic solver is presented that intertwines optimisations with any of the existing parity game algorithms which is only called on parts of a game that cannot be solved faster by simpler methods, showing that using this approach vastly speeds up the solving process.
Analyzing Context-Free Grammars Using an Incremental SAT Solver
B bounded versions of undecidable problems about context-free languages which restrict the domain of words to some finite length are considered and fully utilizing the power of incrementat SAT solvers prove correctness and validate this approach with benchmarks.
Model checking propositional dynamic logic with all extras
- M. Lange
- Computer ScienceJ. Appl. Log.
- 1 March 2006
Temporal Logics in Computer Science: Finite-State Systems
- Stephane Demri, V. Goranko, M. Lange
- Computer ScienceCambridge Tracts in Theoretical Computer Science
- 6 December 2016
The basics of discrete transition systems, including constructions and behavioural equivalences, and the most important temporal logics for transition systems are examined, which can be used for self-study as well as for teaching courses.
The PGSolver Collection of Parity Game Solvers Version 3
Cut-free sequent systems for temporal logic
Focus games for satisfiability and completeness of temporal logic
Introduce a simple game-theoretic approach to satisfiability checking of temporal logic, for LTL (linear time logic) and CTL (computation tree logic), which has the same complexity as using automata.…
Model Checking Fixed Point Logic with Chop
FLC, which is the modal µ-calculus enriched with a sequential composition operator, is examined and it is proved to be PSPACE-hard, and an upper EXPTIME bound is derived from it.
A Proof System for the Linear Time µ-Calculus
This paper presents a simple sound and complete infinitary proof system for the linear time μ-calculus and then presents two decision procedures for provability in the system, hence validity of formulas.