A Nonarchimedian Discretization for Timed Languages

  • Cătălin Dima
Conference paper

DOI: 10.1007/978-3-540-40903-8_14

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2791)
Cite this paper as:
Dima C. (2004) A Nonarchimedian Discretization for Timed Languages. In: Larsen K.G., Niebert P. (eds) Formal Modeling and Analysis of Timed Systems. FORMATS 2003. Lecture Notes in Computer Science, vol 2791. Springer, Berlin, Heidelberg


We give a new discretization of behaviors of timed automata. In this discretization, timed languages are represented as sets of words containing action symbols, a clock tick symbol 1, and two delay symbols δ (negative delay) and δ +  (positive delay). Unlike the region construction, our discretization commutes with intersection. We show that discretizations of timed automata are, in general, context-sensitive languages over Σ ∪ {1,δ + ,δ, and give a class of automata that equals the class of languages that are discretizations of timed automata, and show that their emptiness problem is decidable.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Cătălin Dima
    • 1
  1. 1.ENSEIRBTalence CedexFrance

Personalised recommendations