Skip to main content
SpringerLink
Log in

Checking linear duration invariants by linear programming

  • Conference paper
  • First Online:
Concurrency and Parallelism, Programming, Networking, and Security (ASIAN 1996)

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

Included in the following conference series:

Abstract

In this paper, the problem of verifying a timed automaton for a Duration Calculus formula in the form of linear duration invariants

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Rajeev Alur, David L. Dill. A theory of timed automata. In Theoretical Computer Science, 126(1994), pp.183–235.

    Article  Google Scholar 

  2. Zhou Chaochen, Zhang Jingzhong, Yang Lu and Li Xiaoshan. Linear Duration Invariants. In Formal Techniques in Real-Time and Fault-Tolerant Systems, LNCS 863, pp.88–109.

    Google Scholar 

  3. Zhou Chaochen, C.A.R. Hoare, A.P. Ravn. A Calculus of Durations. In Information Processing Letter, 40, 5, 1991, pp.269–276.

    Article  Google Scholar 

  4. Michael R. Hansen. Model-Checking Discrete Duration Calculus. In Formal Aspects of Computing (1994) 6A, pp.826–845.

    Article  Google Scholar 

  5. Y. Kesten, A. Pnueli, J. Sifakis, S. Yovine. Integration Graphs: A Class of Decidable Hybrid Systems. In Hybrid System, LNCS 736, pp.179–208.

    Google Scholar 

  6. S.C. Kleene. Representation of Events in Nerve Nets and Finite Automata. In Automata Studies, C.Shannon and J. McCarthy (eds.), Princeton Univ. Press, Princeton, NJ, 1956, pp.3–41.

    Google Scholar 

  7. J.U. Skakkebæk and N. Shankar. Towards a Duration Calculus proof assistant in PVS. In Formal Techniques in Real-Time and Fault-Tolerant Systems, LNCS 863, pp.660–697.

    Google Scholar 

  8. Li Xuandong, Dang Van Hung. Checking Linear Duration Invariants by Linear Programming. Research report 70, UNU/IIST, P.O.Box 3058, Macau, May 1996.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. International Institute for Software Technology, The United Nations University, P.O.Box 3058, Macau

    Li Xuandong & Dang Van Hung

Authors
  1. Li Xuandong
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dang Van Hung
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Joxan Jaffar Roland H. C. Yap

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Xuandong, L., Van Hung, D. (1996). Checking linear duration invariants by linear programming. In: Jaffar, J., Yap, R.H.C. (eds) Concurrency and Parallelism, Programming, Networking, and Security. ASIAN 1996. Lecture Notes in Computer Science, vol 1179. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0027804

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-62031-0

  • Online ISBN: 978-3-540-49626-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation