Abstract
We introduce a new BDD-like data structure called Hybrid-Restriction Diagrams (HRDs), for the representation and manipulation of linear hybrid automata (LHA) state-spaces, and present algorithms for weakest precondition calculations. This permits us to reason about the valuations of parameters that make safety properties satisfied. Advantages of our approach include the ability to represent discrete state information and concave polyhedra in a unified scheme as well as to save both memory consumptions and manipulation times, when processing the same substructures in state-space representations. Our experimental results document its efficiency in practice.
The work is partially supported by NSC, Taiwan, ROC under grants NSC 92-2213-E-002-103 and NSC 92-2213-E-002-104. We would like to thank the TReX team, especially Mihaela Sighireanu and Aurore Collomb-Annichini, for kindly implementing a TReX version without the reduce package for us.
Chapter PDF
Similar content being viewed by others
References
Annichini, A., Asarin, E., Bouajjani, A.: Symbolic Techniques for Parametric Reasoning about Counter and Clock Systems. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol. 1855, Springer, Heidelberg (2000)
Asarin, E., Bozga, M., Kerbrat, A., Maler, O., Pnueli, A., Rasse, A.: Data-Structures for the Verification of Timed Automatas. In: Maler, O. (ed.) HART 1997. LNCS, vol. 1201, Springer, Heidelberg (1997)
Annichini, A., Bouajjani, A., Sighireanu, M.: TReX: A Tool for Reachability Analysis of Complex Systems. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol. 2102, Springer, Heidelberg (2001)
Alur, R., Courcoubetis, C., Henzinger, T.A., Ho, P.-H.: Hybrid Automata: an Algorithmic Approach to the Specification and Verification of Hybrid Systems. In: Grossman, R.L., Ravn, A.P., Rischel, H., Nerode, A. (eds.) HS 1991 and HS 1992. LNCS, vol. 736, Springer, Heidelberg (1993)
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: Theoretical Computer Science, vol. 138, pp. 3–34. Elsevier Science B.V (1995)
Alur, R., Henzinger, T.A., Ho, P.-H.: Automatic Symbolic Verification of Embedded Systems. In: Proceedings of, IEEE Real-Time System Symposium (1993)
Alur, R., Henzinger, T.A., Vardi, M.Y.: Parametric Real-Time Reasoning, in Proceedings, 25th ACM STOC, pp. 592–601
Balarin, F.: Approximate Reachability Analysis of Timed Automata. IEEE RTSS (1996)
Burch, J.R., Clarke, E.M., McMillan, K.L., Dill, D.L., Hwang, L.J.: Symbolic Model Checking: 1020 States and Beyond. IEEE LICS (1990)
Behrmann, G., Larsen, K.G., Pearson, J., Weise, C., Yi, W.: Efficient Timed Reachability Analysis Using Clock Difference Diagrams. In: Halbwachs, N., Peled, D.A. (eds.) CAV 1999. LNCS, vol. 1633, pp. 341–353. Springer, Heidelberg (1999)
Bryant, R.E.: Graph-based Algorithms for Boolean Function Manipulation . IEEE Trans. Comput. C-35(8) (1986)
Dill, D.L.: Timing Assumptions and Verification of Finite-state Concurrent Systems. In: CAV 1989. LNCS, vol. 407, Springer, Heidelberg (1990)
Henzinger, T.A., Ho, P.-H., Wong-Toi, H.: HyTech: The Next Generation. In: Proceedings of IEEE Real-Time System Symposium (1995)
Moller, J., Lichtenberg, J., Andersen, H.R., Hulgaard, H.: Difference Decision Diagrams. In: proceedings of Annual Conference of the European Association for Computer Science Logic (CSL), Madreid, Spain (September 1999)
Wang, F.: Efficient Data-Structure for Fully Symbolic Verification of Real-Time Software Systems. In: Schwartzbach, M.I., Graf, S. (eds.) TACAS 2000. LNCS, vol. 1785, p. 157. Springer, Heidelberg (2000)
Wang, F.: Region Encoding Diagram for Fully Symbolic Verification of Real-Time Systems. In: Wang, F. (ed.) The 24th COMPSAC, October 2000, IEEE Computer Society Press, Taiwan (2000)
F. Wang. RED: Model-checker for Timed Automata with Clock-Restriction Diagram. Workshop on Real-Time Tools, Aug. 2001, Technical Report 2001-014, ISSN 1404-3203, Dept. of Information Technology, Uppsala University.
Wang, F.: Symbolic Verification of Complex Real-Time Systems with Clock- Restriction Diagram. In: FORTE 2001, Cheju Island, Korea, August 2001, Kluwer, Dordrecht (2001)
Wang, F., Wang., F.: Efficient Verification of Timed Automata with BDD-like Data-Structures. In: Zuck, L.D., Attie, P.C., Cortesi, A., Mukhopadhyay, S. (eds.) VMCAI 2003. LNCS, vol. 2575, pp. 189–205. Springer, Heidelberg (2002)
Wang, F.: Model-Checking Distributed Real-Time Systems with States, Events, and Multiple Fairness Assumptions. In: Rattray, C., Maharaj, S., Shankland, C. (eds.) AMAST 2004. LNCS, vol. 3116, pp. 553–567. Springer, Heidelberg (2004)
Wang, F., Hwang, G.-D., Yu, F.: TCTL Inevitability Analysis of Dense-Time Systems. In: Ibarra, O.H., Dang, Z. (eds.) CIAA 2003. LNCS, vol. 2759, pp. 176–187. Springer, Heidelberg (2003)
Wang, F., Mok, A., Emerson, E.A.: Symbolic Model-Checking for Distributed Real- Time Systems. In: Larsen, P.G., Woodcock, J.C.P. (eds.) FME 1993. LNCS, vol. 670, Springer, Heidelberg (1993)
Wong-Toi, H.: Symbolic Approximations for Verifying Real-Time Systems. Ph.D. thesis, Stanford University (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wang, F. (2004). Symbolic Parametric Safety Analysis of Linear Hybrid Systems with BDD-Like Data-Structures. In: Alur, R., Peled, D.A. (eds) Computer Aided Verification. CAV 2004. Lecture Notes in Computer Science, vol 3114. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27813-9_23
Download citation
DOI: https://doi.org/10.1007/978-3-540-27813-9_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22342-9
Online ISBN: 978-3-540-27813-9
eBook Packages: Springer Book Archive