Advertisement

Digitizing Interval Duration Logic

  • Gaurav Chakravorty
  • Paritosh K. Pandya
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2725)

Abstract

In this paper, we study the verification of dense time properties by discrete time analysis. Interval Duration Logic, (IDL), is a highly expressive dense time logic for specifying properties of real-time systems. Validity checking of IDL formulae is in general undecidable. A corresponding discrete-time logic QDDC has decidable validity.

In this paper, we consider a reduction of IDL validity question to QDDC validity using notions of digitization. A new notion of Strong Closure under Inverse Digitization, SCID, is proposed. For all SCID formulae, the dense and the discrete-time validity coincide. Moreover, SCID has good algebraic properties which can be used to conveniently prove that many IDL formulae are SCID. We also give some approximation techniques to strengthen/weaken formulae to SCID form. For SCID formulae, the validity of dense-time IDL formulae can be checked using the validity checker for discrete-time logic QDDC.

Keywords

Model Check Time Stamp State Sequence Propositional Variable Validity Checker 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 1.
    Alur, R., Dill, D.L.: Automata for modeling Real-time systems. In: Paterson, M. (ed.) ICALP 1990. LNCS, vol. 443. Springer, Heidelberg (1990)CrossRefGoogle Scholar
  2. 2.
    Beyer, D.: Rabiit: Verification of Real-Time Systems. In: Workshop on Real-time Tools (RT-TOOLS 2001), Aalborg, Denmark (2001)Google Scholar
  3. 3.
    Franzle, M.: Decidability of Duration Calculi on Restricted Model Classes. ProCoS Technical Report Kiel MF/1. Christian-Albrechts Universitat Kiel, Germany (1996)Google Scholar
  4. 4.
    Henzinger, T.A., Manna, Z., Pnueli, A.: What good are digital clocks? In: Kuich, W. (ed.) ICALP 1992. LNCS, vol. 623, pp. 545–558. Springer, Heidelberg (1992)Google Scholar
  5. 5.
    Hung, D.V., Giang, P.H.: Sampling Semantics of Duration Calculus. In: Jonsson, B., Parrow, J. (eds.) FTRTFT 1996. LNCS, vol. 1135, pp. 188–207. Springer, Heidelberg (1996)Google Scholar
  6. 6.
    Pandya, P.K., Hung, D.V.: A Duration Calculus of Weakly Monotonic Time. In: Ravn, A.P., Rischel, H. (eds.) FTRTFT 1998. LNCS, vol. 1486, p. 55. Springer, Heidelberg (1998)CrossRefGoogle Scholar
  7. 7.
    Pandya, P.K.: Specifying and Deciding Quantified Discrete-time Duration Calculus Formulae using DCVALID: An Automata Theoretic Approach. In: Workshop on Real-time Tools (RTTOOLS 2001), Aalborg, Denmark (2001)Google Scholar
  8. 8.
    Pandya, P.K.: Interval Duration Logic: Expressiveness and Decidability. In: Workshop on Theory and Practice of Timed Systems (TPTS 2002), Electronic Notes in Theoretical Computer Science, ENTCS 65.6. Elsevier Science B.V (2002)Google Scholar
  9. 9.
    Ravn, A.P.: Design of Real-time Embedded Computing Systems. Department of Computer Science, Technical University of Denmark (1994)Google Scholar
  10. 10.
    Chaochen, Z., Hoare, C.A.R., Ravn, A.P.: A Calculus of Durations. Information Processing Letters 40(5), 269–276 (1991)zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Gaurav Chakravorty
    • 1
  • Paritosh K. Pandya
    • 2
  1. 1.Indian Institute of TechnologyKanpurIndia
  2. 2.Tata Institute of Fundamental ResearchColaba, MumbaiIndia

Personalised recommendations