Chapter

CONCUR 2004 - Concurrency Theory

Volume 3170 of the series Lecture Notes in Computer Science pp 432-447

Model Checking Restricted Sets of Timed Paths

  • Nicolas MarkeyAffiliated withDépartement d’Informatique, Université Libre de Bruxelles Bld du Triomphe
  • , Jean-François RaskinAffiliated withDépartement d’Informatique, Université Libre de Bruxelles Bld du Triomphe

* Final gross prices may vary according to local VAT.

Get Access

Abstract

In this paper, we study the complexity of model-checking formulas of three important real-time logics (MTL, MITL, and TCTL) over restricted sets of timed paths. The classes of restricted sets of timed paths that we consider are (i) a single finite (or ultimately periodic) timed path, (ii) a infinite set of finite (or infinite) timed paths defined by a finite (or ultimately periodic) path in a region graph, (iii) a infinite set of finite (or infinite) timed paths defined by a finite (or ultimately periodic) path in a zone graph.