From LIDL(m) to Timed Automata

Gomez, Rodolfo (2009) From LIDL(m) to Timed Automata. Technical report. UKC (Full text available)

Download (279kB) Preview


LIDL(m) is a decidable fragment of Interval Duration Logic with Located Constraints, an expressive subset of dense-time Duration Calculus. It has been claimed that, for any LIDL(m) formula D, a timed automaton can be constructed which accepts the models of D. However, the proposed construction is incomplete and has not been proved effective. In this paper, we prove the effective construction of equivalent timed automata from LIDL(m) formulae.

Item Type: Monograph (Technical report)
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions: Faculties > Sciences > School of Computing > Theoretical Computing Group
Depositing User: Mark Wheadon
Date Deposited: 29 Mar 2010 12:13 UTC
Last Modified: 16 Jun 2014 15:28 UTC
Resource URI: (The current URI for this page, for reference purposes)
  • Depositors only (login required):


Downloads per month over past year