The Logic WT_mu
Résumé
The power of Model-checking depends on the expressive power of models of systems and models of specifications. The paper introduces WT$\mu$, a real-time logic with the least and the greatest fixpoint operators. WT$_\mu$ is a weak timed extension of the $\mu$-calculus; it is closed to L$_\nu$. As Event-recording logic, WT$_\mu$ describes properties on Event-recording automata. We show that WT$_\mu$ is more expressive than Event-recording logic. In particular, with WT$\mu$ formulas, one can require occurrences of an event at all the time instants that satisfies a timing constraint. We provide an exponential-time decision procedure for the model-checking of WT$_\mu$.
Origine : Fichiers produits par l'(les) auteur(s)