Model Checking Restricted Sets of Timed Paths

  • Nicolas Markey
  • Jean-François Raskin
Conference paper

DOI: 10.1007/978-3-540-28644-8_28

Part of the Lecture Notes in Computer Science book series (LNCS, volume 3170)
Cite this paper as:
Markey N., Raskin JF. (2004) Model Checking Restricted Sets of Timed Paths. In: Gardner P., Yoshida N. (eds) CONCUR 2004 - Concurrency Theory. CONCUR 2004. Lecture Notes in Computer Science, vol 3170. Springer, Berlin, Heidelberg

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Nicolas Markey
    • 1
  • Jean-François Raskin
    • 1
  1. 1.Département d’InformatiqueUniversité Libre de Bruxelles Bld du TriompheBrusselsBelgium

Personalised recommendations