Is your Model Checker on Time?
On the Complexity of Model Checking for Timed Modal Logics Luca Aceto
October 1999 |
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
![]() Available as PostScript, PDF. |