Is your Model Checker on Time? On the Complexity of Model Checking for Timed Modal Logics

Abstract

This paper studies the structural complexity of model checking
for (variations on) the specification formalisms used in the tools CMC
and Uppaal, and fragments of a timed alternation-free mu-calculus. For
each of the logics we study, we characterize the computational complexity
of model checking, as well as its specification and program complexity,
using timed automata as our system model.