Skip to main content

Checking Interval Based Properties for Reactive Systems

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2937))

Abstract

A reactive system does not terminate and its behaviors are typically defined as a set of infinite sequences of states. In formal verification, a requirement is usually expressed in a logic, and when the models of the logic are also defined as infinite sequences, such as the case for LTL, the satisfaction relation is simply defined by the containment between the set of system behaviors and that of logic models. However, this satisfaction relation does not work for interval temporal logics, where the models can be considered as a set of finite sequences. In this paper, we observe that for different interval based properties, different satisfaction relations are sensible. Two classes of properties are discussed, and accordingly two satisfaction relations are defined, and they are subsequently unified by a more general definition. A tool is developed based on the Spin model checking system to verify the proposed general satisfaction relation for a decidable subset of Discrete Time Duration Calculus.

This research is partly supported by University Macau Research Grant No. RG039/02-038/XQW/FST.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Buchi, J.R.: On a Decision Method in Restricted Second Order Arithmetic. In: Nagel, et al. (eds.) Logic, Methodology and Philosophy of Science, Stanford Univ. Press, Stanford (1960)

    Google Scholar 

  2. Alpern, B., Schneider, F.B.: Recognizing Safety and Liveness. TR 86–727 (1986)

    Google Scholar 

  3. Alpern, B., Schneider, F.B.: Defining Liveness. Information Processing Letters 21, 181–185 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  4. Clarke, E.M., Grumberg, O., Peled, D.A.: Model Checking. The MIT Press, Cambridge (1999)

    Google Scholar 

  5. Hansen, M.R., Chaochen, Z.: Duration Calculus: Logical Foundations. Formal Aspects of Computing 9, 283–330 (1997)

    Article  MATH  Google Scholar 

  6. Henriksen, J.G., Jensen, J., Jorgensen, M., Klarlund, N., Paige, B., Rauhe, T., Sandholm, A.: Mona: Monadic Second-order Logic in practice. In: Brinksma, E., Steffen, B., Cleaveland, W.R., Larsen, K.G., Margaria, T. (eds.) TACAS 1995. LNCS, vol. 1019, Springer, Heidelberg (1996)

    Google Scholar 

  7. Holzmann, G.: The SPIN Model Checker. IEEE Trans. on Software Engineering 23, 279–295 (1997)

    Article  Google Scholar 

  8. The Grail+ Project. Department of Computer Science, University of Western Ontario, Canada, http://www.csd.uwo.ca/research/grail/

  9. Lamport, L.: Proving the correctness of multiprocess programs. IEEE Transactions on Software Engineering SE-3(2), 125–143 (1977)

    Article  MathSciNet  Google Scholar 

  10. Moszkowski, B.: A Temporal Logic for Multilevel Reasoning about Hardware. IEEE Computer 18(2), 10–19 (1985)

    Google Scholar 

  11. Moszkowski, B.: Compositional reasoning about projected and infinite time. In: Proc. of the First IEEE International Conference on Engineering of Complex Computer Systems (ICECCS 1995), pp. 238–245. IEEE Computer Society Press, Los Alamitos (1995)

    Chapter  Google Scholar 

  12. Pandya, P.K.: Specifying and Deciding Quantified Discrete-Time Duration Calculus Formulae using DCVALID. In: Proc. of Workshop on Real-time Tools, Aalborg, Denmark (2001), TCS00-PKP-1, Tata Institute of Fundamental Research, Mumbai, India (2000)

    Google Scholar 

  13. Pandya, P.K.: Model checking CTL[DC]. In: Margaria, T., Yi, W. (eds.) TACAS 2001. LNCS, vol. 2031, p. 559. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  14. Ramakrishna, Y.S., Melliar-Smith, P.M., Moser, L.E., Dillon, L.K., Kuttys, G.: Interval Logics and Their Decision Procedures, Part I: An Interval Logic. Theoretical Computer Science 166(1&2), 1–47 (1996)

    MATH  MathSciNet  Google Scholar 

  15. Skakkebæk, J.U.: A Verification Assistant for Real-time Logic. PhD. Thesis, Department of Computer Science, Technical University of Denmark (1994)

    Google Scholar 

  16. Hanpin, W., Qiwen, X.: Completeness of temporal logics over infinite intervals. Technical Report 158, UNU/IIST, Macau, Accepted by Applied Discrete Mathematics, Elsevier (1999)

    Google Scholar 

  17. Wolper, P.: Constructing automata from temporal logic formula: a tutorial. In: Brinksma, E., Hermanns, H., Katoen, J.-P. (eds.) EEF School 2000 and FMPA 2000. LNCS, vol. 2090, pp. 261–277. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  18. Yu, P., Qiwen, X.: Checking Interval Based Properties for Reactive Systems. Technical Report 283, UNU/IIST, Macau. (2003)

    Google Scholar 

  19. Chaochen, Z., Van Hung, D., Xiaoshan, L.: A Duration Calculus with Infinite Intervals. In: Reichel, H. (ed.) FCT 1995. LNCS, vol. 965, pp. 16–41. Springer, Heidelberg (1995)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yu, P., Qiwen, X. (2004). Checking Interval Based Properties for Reactive Systems. In: Steffen, B., Levi, G. (eds) Verification, Model Checking, and Abstract Interpretation. VMCAI 2004. Lecture Notes in Computer Science, vol 2937. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24622-0_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24622-0_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20803-7

  • Online ISBN: 978-3-540-24622-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics