Location of Repository

From LIDL(m) to Timed Automata

By Rodolfo Gomez

Abstract

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

Topics: QA76
Publisher: UKC
Year: 2009
OAI identifier: oai:kar.kent.ac.uk:24080

Suggested articles

Preview

Citations

  1. (1991). A calculus of durations.
  2. (1986). A choppy logic.
  3. (1994). A determinizable class of timed automata.
  4. (1990). A temporal calculus of communicating systems.
  5. (1985). A temporal logic for multilevel reasoning about hardware.
  6. (1994). A theory of timed automata.
  7. (2002). Checking temporal duration properties of timed automata.
  8. (1961). Decision problems of finite automata design and related arithmetics.
  9. (1994). Design of Embedded Real-Time Computing Systems.
  10. (2004). Duration Calculus: A Formal Approach to Real-Time Systems.
  11. (1999). Event-clock automata: a determinizable class of timed automata.
  12. (1966). Finite automata and the logic of one-place predicates.
  13. (2002). Interval Duration Logic: Expressiveness and decidability.
  14. (1991). Logics and models of real time: A survey.
  15. (2001). Model checking CTL∗[DC].
  16. (2008). Model checking Duration Calculus: a practical approach.
  17. (2002). MONA implementation secrets.
  18. (1995). Mona: Monadic second-order logic in practice.
  19. (2001). Notes Series NS-01-1. Available from http://www.brics.dk/mona/.
  20. (1960). On a decision method in restricted second-order arithmetic.
  21. (1998). On checking timed automata for linear duration invariants.
  22. (2005). On the completeness and decidability of Duration Calculus with iteration.
  23. (2006). On the expressiveness of MTL with past operators.
  24. (1983). Real-time programming and asynchronous message passing.
  25. (2000). Specifying and deciding Quantified Discrete Duration Calculus formulae using DCVALID.
  26. (1990). Specifying real-time properties with Metric Temporal Logic.
  27. (1974). The complexity of decision problems in automata and logic.
  28. (1985). The glory of the past.
  29. (1977). The temporal logic of programs.
  30. (2002). Timed regular expressions.
  31. (2004). Verifying linear duration constraints of timed automata.
  32. (1973). Word problems requiring exponential time (preliminary report).

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.