Interval Duration Logic: Expressiveness and Decidability

@article{Pandya2002IntervalDL,
  title={Interval Duration Logic: Expressiveness and Decidability},
  author={Paritosh K. Pandya},
  journal={Electr. Notes Theor. Comput. Sci.},
  year={2002},
  volume={65},
  pages={254-272}
}
We investigate a variant of dense-time Duration Calculus which permits model checking using timed/hybrid automata. We define a variant of the Duration Calculus, called Interval Duration Logic, (IDL), whose models are timed state sequences [1]. A subset LIDL of IDL consisting only of located time constraints is presented. As our main result, we show that the models of an LIDL formula can be captured as timed state sequences accepted by an event-recording integrator automaton. A tool called… CONTINUE READING

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 32 references

Design of Real-time Embedded Computing Systems, Department of Computer Science

  • A. P. Ravn
  • Technical University of Denmark,
  • 1994
Highly Influential
4 Excerpts

Dill: Automata for modeling real-time systems

  • R. Alur, D.L
  • in Proc. of 17th ICALP,
  • 1990
Highly Influential
4 Excerpts

Specifying and Deciding Quantified Discrete-time Duration Calculus Formulae using DCVALID: An Automata Theoretic Approach

  • P. K. Pandya
  • In Proc. Workshop on Real-time Tools (RTTOOLS…
  • 2001
Highly Influential
8 Excerpts

DCVALID User Manual, Tata Institute of Fundamental Research, Bombay, 1997. (Available in revised version at http://www.tcs.tifr.res.in/∼pandya/dcvalid.html)

  • P. K. Pandya
  • 1997
Highly Influential
6 Excerpts

Similar Papers

Loading similar papers…