Kofola 1.0 implements a modular SCC-based complementation framework for Büchi automata with tailored per-component algorithms, a new on-the-fly emptiness checker, and modular inclusion heuristics, showing strong empirical performance.
Modalities for model checking: branching time logic strikes back
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
Provides complexity results for the constrained existence problem of five equilibrium notions in multiplayer graph games.
citing papers explorer
-
Kofola 1.0: A Modular Approach to {\omega}-Regular Complementation and Inclusion Checking (Technical Report)
Kofola 1.0 implements a modular SCC-based complementation framework for Büchi automata with tailored per-component algorithms, a new on-the-fly emptiness checker, and modular inclusion heuristics, showing strong empirical performance.
-
Equilibria in Multiplayer Graph Games: An Algorithmic Study
Provides complexity results for the constrained existence problem of five equilibrium notions in multiplayer graph games.