Too Long; Didn't Read

CGAAL is our model checker of alternating-time temporal logic properties in concurrent games. CGAAL checks such properties by encoding the problem as an extended dependency graph. It then computes the satisfaction relation using the distributed local on-the-fly CERTAINZERO algorithm by Dalsgaard et al. We provide multiple novel search strategies for the algorithm and allow concurrent games to be expressed in our language LCGS.

Efficiently exploring and navigating large solution spaces at HeuristicsSearch.Tech