Skip to main content
SpringerLink
Log in

Checking Temporal Duration Properties of timed automata

  • Regular Papers
  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

In this paper, the problem of checking a timed automaton for a Duration Calculus formula of the form Temporal Duration Property is addressed. It is shown that Temporal Duration Properties are in the class of discretisable real-time properties of Timed Automata, and an algorithm is given to solve the problem based on linear programming techniques and the depth-first search method in the integral region graph of the automaton. The complexity of the algorithm is in the same class as that of the solution of the reachability problem of timed automata.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Henzinger T A, Ho P-H, Wong-Toi H. A users guide to HyTech. Technical Report, Department of Computer Science, Cornell University, 1995.

  2. Larsen K G, Huttel H. UPPAAL-An automatic tool for verification of real time and hybrid systems. InProc. of the 16th IEEE Real-Time Systems Symposium, Dec., 1997, pp.76–87.

  3. Zhou Chaochen, Hoare C A R, Anders P. Ravn. A calculus of durations.Information Processing Letters, 1991, 40(5): 269–276.

    Article  MATH  MathSciNet  Google Scholar 

  4. Zhou Chaochen, Zhang Jingzhong, Yang Lu, Li Xiaoshan. Linear duration invariants. Research Report 11, UNU/IIST, P.O. Box 3058, Macau, July, 1993. Published in: Formal Techniques in Real-Time and Fault-Tolerant systems,LNCS 863, 1994.

    Google Scholar 

  5. Pham Hong Thai, Dang Van Hung. Checking a regular class of duration calculus models for linear duration invariants. Technical Report 118, UNU/IIST, P.O.Box 3058, Macau, July, 1997. In Proc. of theInternational Symposium on Software Engineering for Parallel and Distributed Systems (PDSE’98), April 20–21, 1998, Kyoto, Japan, Bernd Kramer, Naoshi Uchihira, Peter Croll and Stefano Russo (eds.), IEEE Computer Society Press, 1998, pp.61–71.

    Google Scholar 

  6. Zhao Jianhua, Dang Van Hung. On checking real-time parallel systems for linear duration properties. Technical Report 130, UNU/IIST, P.O.Box 3058, Macau, January, 1998. InProc. of Formal Techniques in Real-Time and Fault-Tolerant Systems 5-th International Symposium, Lyngby, Denmark, September 1998, (FTRTFT’98), Anders P. Ravn, Hans Rischel (eds.),LNCS 1486, pp.241–250, Springer-Verlag, 1998.

    Google Scholar 

  7. Zhao Jianhua, Dang Van Hung. Checking timed automata for some discretisable duration properties. Technical Report 145, UNU/IIST, P.O.Box 3058, Macau, August, 1998,Journal of Computer Science and Technology, September, 2000, 15(5): 423–429.

    Google Scholar 

  8. Li Yong, Dang Van Hung. Checking history properties of real-time systems. Technical Report 214, UNU/IIST, P.O.Box 3058, Macau, October, 2000.

    Google Scholar 

  9. Alur R, Dill D L. A theory of timed automata.Theoretical Computer Science, 1994, pp.183–235.

  10. Kesten Y, Pnueli A, Sifakis J, Yovine S. Integration Graphs: A Class of Decidable Hybrid Systems. InHybrid Systems, Lecture Notes in Computer Science 736, pp.179–208. Springer Verlag, 1994.

  11. Li Xuandong, Dang Van Hung. Checking linear duration invariants by linear programming. Research Report 70, UNU/IIST, P.O.Box 3058, Macau, May 1996. Published in Joxan Jaflar, Roland H. C. Yap (eds.), (Concurrency and Parallelism, Programming, Networking, and Security),LNCS 1179, Springer-Verlag, Dec., 1996, pp.321–332.

    Google Scholar 

  12. Li Xuan Dong, Dang Van Hung, Zheng Tao. Checking hybrid automata for linear duration invariants. Research Report 109, UNU/IIST, P.O.Box 3058, Macau, June, 1997. Published in Shamasunder R K, Ueda K (eds.), (Advances in Computing Science),Lecture Notes in Computer Science 1345, Springer-Verlag, 1997, pp.166–180.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. State Key Laboratory of Novel Software Technology Department of Computer Science and Technology, Nanjing University, 210093, Nanjing, P.R. China

    Li Yong

  2. International Institute for Software Technology, The United Nations University, P. O. Box 3058, Macau SAR, P.R. China

    Dang Hung Van

Authors
  1. Li Yong
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dang Hung Van
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Li Yong.

Additional information

Supported by the National Natural Science Foundation of China (Grant Nos.60073031 and 69703009) and the National ‘863’ High-Tech Programme of China (Grant No.2001AA113203).

LI Yong received his Ph.D. from the Department of Computer Science and Technology, Naning University in 2002. His research interests include: Formal support for design and analysis of reactive, real-time, and hybrid systems, object-oriented technology, and Software engineering.

Dang Van Hung has a Ph.D. (equivalent) in Computer science from the Computer and Automation Research Institute (SZTAKI), Hungarian Academy of Sciences, Budapest, Hungary in 1998. He has been a Research Feliow for the research project “Theories and Design Methods for Real-time Systems” at UNU/IIST since 1995. His research interests include: concurrent and distributed computing, formal design Mechniques for real-time systems.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Li, Y., Van Dang, H. Checking Temporal Duration Properties of timed automata. J. Compt. Sci. & Technol. 17, 689–698 (2002). https://doi.org/10.1007/BF02960759

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02960759

Keywords

Search

Navigation