Skip to main content

Advertisement

Springer Nature Link
Log in

Symbolic Algorithmic Analysis of Rectangular Hybrid Systems

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

Abstract

This paper investigates symbolic algorithmic analysis of rectangular hybrid systems. To deal with the symbolic reachability problem, a restricted constraint system called hybrid zone is formalized for the representation and manipulation of rectangular automata state-spaces. Hybrid zones are proved to be closed over symbolic reachability operations of rectangular hybrid systems. They are also applied to model-checking procedures for verifying some important classes of timed computation tree logic formulas. To represent hybrid zones, a data structure called difference constraint matrix is defined. These enable us to deal with the symbolic algorithmic analysis of rectangular hybrid systems in an e±cient way.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. Alur R, Courcoubetis C, Halbwachs N, Henzinger T A, Ho P-H, Nicollin X, Olivero A, Sifakis J, Yovine S. The algorithmic analysis of hybrid systems. In Proc. ICAOS’94, LNCS 199, Berlin: Springer-Verlag, June 15–17, 1994, pp.331–351.

  2. Henzinger T A, Majumdar R. Symbolic model checking for rectangular hybrid systems (Abstract). In Proc. TACAS’2000, LNCS 1785, Berlin: Springer-Verlag, March 25–April 1, 2000, pp.142–156.

  3. Henzinger T A, Kopke P W, Puri A, Varaiya P. What’s decidable about hybrid automata?. In Proc. STOC’95, ACM Press, May 29–June 1, 1995, pp.373–382.

  4. Zhang H, Duan Z. Symbolic algorithm analysis of hybrid systems. In Proc. TAMC’08, LNCS 4978, Berlin: Springer-Verlag, April 25–29, 2008, pp.294–305.

  5. Zhang H, Duan Z. Symbolic reachability analysis of hybrid systems. Journal of Software, 2008, 19(12): 3111–3121.

    Article  MathSciNet  Google Scholar 

  6. Annichini A, Asarin E, Bouajjani A. Symbolic techniques for parametric reasoning about counter and clock systems. In Proc. CAV’2000, LNCS 1855, Berlin: Springer-Verlag, July 15–19, 2000, pp.419–434.

  7. Alur R, Henzinger T A, Ho P-H. Automatic symbolic verification of embedded systems. IEEE Transactions on Software Engineering, 1996, 22(3): 181–201.

    Article  Google Scholar 

  8. Dill D L. Timing assumptions and verification of finite-state concurrent systems. In Proc. CAV’89, LNCS 407, Berlin: Springer-Verlag, June 12–17, 1989, pp.197–212.

  9. Wang F. Symbolic parametric safety analysis of linear hybrid systems with BDD-like data-structures. In Proc. CAV’04, LNCS 3114, July 13–17, 2004, pp.295–307.

  10. Anai H, Weispfnening V. Reach set computation using real quantifier elimination. In Proc. HSCC’01, LNCS 2034, Berlin: Springer-Verlag, March 28–30, 2001, pp.63–76.

  11. Alur R, Henzinger T A, Lafferriere G, Pappas G J. Discrete abstractions of hybrid systems. Proc. the IEEE, 2000, 88(7): 971–984.

    Article  Google Scholar 

  12. Henzinger T A, Ho P H, Wong-Toi H. Algorithmatic analysis of nonlinear hybrid systems. IEEE-AC Transitions, 1999, 43(4): 540–554.

    MathSciNet  Google Scholar 

  13. Clarke E M, Grumberg O, Peled D A. Model Checking. Cambridge: The MIT Press, Massachusetts, London, 1999, pp.284–287.

    Google Scholar 

  14. Alur R, Courcoubetis C, Dill D L. Model-checking in dense real-time. Inform. Computat, 1993, 104(1): 2–34.

    Article  MATH  MathSciNet  Google Scholar 

  15. Karmarkar N. A new polynomial-time algorithm for linear programming. Combinatorica, 1984, 4(4): 373–395.

    Article  MATH  MathSciNet  Google Scholar 

  16. Henzinger T A, Ho P H, Wong-Toi H. A user guide to HYTECH. In Proc. TACAS'95, LNCS 1019, Berlin: Springer-Verlag, May 19–20, 1995, pp.41–71.

Download references

Author information

Authors and Affiliations

  1. Institute of Computing Theory and Technology, Xidian University, Xi’an, 710071, China

    Hai-Bin Zhang & Zhen-Hua Duan (Senior Member, CCF, IEEE)

Authors
  1. Hai-Bin Zhang
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Zhen-Hua Duan
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Zhen-Hua Duan.

Additional information

This research is supported by the National Natural Science Foundation of China under Grant Nos. 60433010 and 60873018, the Specialized Research Foundation for the Doctoral Program of Chinese Higher Education under Grant No. 200807010012, and the Defense Pre-Research Project of China under Grant No. 51315050105.

Electronic supplementary material

Below is the link to the electronic supplementary material.

(PDF 84.8 kb).

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zhang, HB., Duan, ZH. Symbolic Algorithmic Analysis of Rectangular Hybrid Systems. J. Comput. Sci. Technol. 24, 534–543 (2009). https://doi.org/10.1007/s11390-009-9243-2

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11390-009-9243-2

Keywords