research-article

Symbolic Parametric Safety Analysis of Linear Hybrid Systems with BDD-Like Data-Structures

Author:

Farn WangAuthors Info & Claims

IEEE Transactions on Software Engineering, Volume 31, Issue 1

Pages 38 - 51

https://doi.org/10.1109/TSE.2005.13

Published: 01 January 2005 Publication History

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.

References

[1]

A. Annichini E. Asarin and A. Bouajjani, “Symbolic Techniques for Parametric Reasoning about Counter and Clock Systems,” Proc. Int'l Conf. Computer Aided Verification, 2000.]]

Digital Library

[2]

E. Asarin M. Bozga A. Kerbrat O. Maler A. Pnueli and A. Rasse, “Data-Structures for the Verification of Timed Automata,” Proc. Hybrid and Real-Time Systems Int'l Workshop, pp. 346-360, 1997.]]

Digital Library

[3]

A. Annichini A. Bouajjani and M. Sighireanu, “TReX: A Tool for Reachability Analysis of Complex Systems,” Proc. 13th Int'l Conf. Computer Aided Verification, pp. 368-372, 2001.]]

Digital Library

[4]

R. Alur C. Courcoubetis T.A. Henzinger and P.-H. Ho, “Hybrid Automata: An Algorithmic Approach to the Specification and Verification of Hybrid Systems,” Proc. Hybrid Systems Workshop, pp. 209-229, 1993.]]

Digital Library

[5]

R. Alur C. Courcoubetis N. Halbwachs T.A. Henzinger P.-H. Ho X. Nicollin A. Olivero J. Sifakis and S. Yovine, “The Algorithmic Analysis of Hybrid Systems,” Theoretical Computer Science, vol. 138,no. 1, pp. 3-34, 1995.]]

Digital Library

[6]

R. Alur and D.L. Dill, “Automata for Modelling Real-Time Systems,” Proc. Int'l Colloquium on Automata, Languages and Programming, pp. 322-335, 1990.]]

Digital Library

[7]

R. Alur T.A. Henzinger and P.-H. Ho, “Automatic Symbolic Verification of Embedded Systems,” Proc. IEEE Real-Time System Symp., pp. 2-11, 1993.]]

[8]

R. Alur T.A. Henzinger and M.Y. Vardi, “Parametric Real-Time Reasoning,” Proc. 25th ACM Symp. Theory of Computing, pp. 592-601, 1993.]]

Digital Library

[9]

F. Balarin, “Approximate Reachability Analysis of Timed Automata,” Proc. 17th IEEE Real-Time Systems Symp., p. 52, 1996.]]

Digital Library

[10]

J.R. Burch E.M. Clarke K.L. McMillan D.L. Dill and L.J. Hwang, “Symbolic Model Checking: 10<sup>20</sup> States and Beyond,” Proc. IEEE Symp. Logic in Computer Science, 1990.]]

[11]

G. Behrmann K.G. Larsen J. Pearson C. Weise and Wang Yi, “Efficient Timed Reachability Analysis Using Clock Difference Diagrams,” Proc. Int'l Conf. Computer Aided Verification, 1999.]]

Digital Library

[12]

R.E. Bryant, “Graph-Based Algorithms for Boolean Function Manipulation,” IEEE Trans. Computers, vol. C-35, no. 8, pp. 677-691, Aug. 1986.]]

Digital Library

[13]

D.L. Dill, “Timing Assumptions and Verification of Finite-State Concurrent Systems,” Proc. Int'l Conf. Computer Aided Verification, 1989.]]

[14]

M. Fujita H. Fujisawa and Y. Matsunaga, “Variable Ordering Algorithms for Ordered Binary Decision Diagrams and Their Evaluation,” IEEE Trans. Computer-Aided Design, vol. 12, pp. 6-12, Jan. 1993.]]

Digital Library

[15]

T.A. Henzinger P.-H. Ho and H. Wong-Toi, “HyTech: The Next Generation,” Proc. IEEE Real-Time Systems Symp., pp. 56-65, 1995.]]

Digital Library

[16]

T.A. Henzinger X. Nicollin J. Sifakis and S. Yovine, “Symbolic Model Checking for Real-Time Systems,” Proc. Seventh Symp. Logics in Computer Science, pp. 394-406, 1992.]]

[17]

S. Minato N. Ishiura and S. Yajima, “Shared Binary Decision Diagram with Attributed Edges for Efficient Boolean Function Manipulation,” Proc. ACM/IEEE 27th Design Automation Conf., pp.nbsp52-57, 1990.]]

Digital Library

[18]

J. Moller J. Lichtenberg H.R. Andersen and H. Hulgaard, “Difference Decision Diagrams,” Proc. Ann. Conf. European Assoc. for Computer Science Logic, Sept. 1999.]]

Digital Library

[19]

S. Malik A.R. Wang R.K. Brayton and A. Sangiovanni-Vincentelli, “Logic Verification Using Binary Decision Diagrams in a Logic Synthesis Environment,” Proc. Int'l Conf. Computer-Aided Design, pp. 6-8, 1988.]]

[20]

P. Pettersson and K.G. Larsen, “UPPAAL2k,” Bull. European Assoc. Theoretical Computer Science, vol. 70, pp. 40-44, 2000.]]

[21]

F. Wang, “Efficient Data-Structure for Fully Symbolic Verification of Real-Time Software Systems,” Proc. Int'l Conf. Tools and Algorithms for the Construction and Analysis of Systems, 2000.]]

Digital Library

[22]

F. Wang, “Region Encoding Diagram for Fully Symbolic Verification of Real-Time Systems,” Proc. 24th Int'l Computer Software and Applications Conf., Oct. 2000.]]

Digital Library

[23]

F. Wang, “RED: Model-Checker for Timed Automata with Clock-Restriction Diagram,” Proc. Workshop Real-Time Tools, Technical Report 2001-014, ISSN 1404-3203, Dept. of Information Technology, Uppsala Univ., Aug. 2001.]]

[24]

F. Wang, “Symbolic Verification of Complex Real-Time Systems with Clock-Restriction Diagram,” Proc. Int'l Conf. Formal Techniques for Networked and Distributed Systems, Aug. 2001.]]

Digital Library

[25]

F. Wang, “Efficient Verification of Timed Automata with BDD-Like Data-Structures,” Proc. Int'l Conf. Verification, Model Checking and Abstract Interpretation, 2003.]]

Digital Library

[26]

F. Wang, “Model-Checking Distributed Real-Time Systems with States, Events, and Multiple Fairness Assumptions,” Proc. 10th Int'l Conf. Algebraic Methodology and Software Technology, July 2004.]]

[27]

F. Wang G.-D. Hwang and F. Yu, “TCTL Inevitability Analysis of Dense-Time Systems,” Proc. Eighth Conf. Implementation and Application of Automata, July 2003.]]

Digital Library

[28]

F. Wang G.-D. Hwang and F. Yu, “Numerical Coverage Estimation for the Symbolic Simulation of Real-Time Systems,” Proc. Int'l Conf. Formal Techniques for Networked and Distributed Systems, Sept.-Oct. 2003.]]

[29]

F. Wang A. Mok and E.A. Emerson, “Symbolic Model-Checking for Distributed Real-Time Systems,” Proc. First Int'l Symp. Formal Methods Europe, Apr. 1993.]]

Digital Library

[30]

H. Wong-Toi, “Symbolic Approximations for Verifying Real-Time Systems,” PhD thesis, Stanford Univ., 1995.]]

Digital Library

[31]

S. Yovine, “Kronos: A Verification Tool for Real-Time Systems,” Int'l J. Software Tools for Technology Transfer, vol. 1, nos. 1-2, Oct. 1997.]]

Digital Library

Cited By

Wu YBu LWang JRen XXiong WLi X(2022)Mixed Semantics Guided Layered Bounded Reachability Analysis of Compositional Linear Hybrid AutomataVerification, Model Checking, and Abstract Interpretation10.1007/978-3-030-94583-1_23(473-495)Online publication date: 16-Jan-2022
https://dl.acm.org/doi/10.1007/978-3-030-94583-1_23
Zivkovic CGrimm COlbrich MScharf OBarke E(2019)Hierarchical Verification of AMS Systems With Affine Arithmetic Decision DiagramsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems10.1109/TCAD.2018.286423838:10(1785-1798)Online publication date: 17-Sep-2019
https://dl.acm.org/doi/10.1109/TCAD.2018.2864238
Cimatti AGriggio AMover STonetta S(2015)HyCompProceedings of the 21st International Conference on Tools and Algorithms for the Construction and Analysis of Systems - Volume 903510.1007/978-3-662-46681-0_4(52-67)Online publication date: 11-Apr-2015
https://dl.acm.org/doi/10.1007/978-3-662-46681-0_4
Show More Cited By

Index Terms

Symbolic Parametric Safety Analysis of Linear Hybrid Systems with BDD-Like Data-Structures

Recommendations

Decidability and complexity for the verification of safety properties of reasonable linear hybrid automata
HSCC '11: Proceedings of the 14th international conference on Hybrid systems: computation and control

This paper identifies an industrially relevant class of linear hybrid automata (LHA) called reasonable LHA for which parametric verification of safety properties with exhaustive entry conditions can be done in polynomial time and time-bounded ...
Efficient Verification of Timed Automata with BDD-Like Data-Structures
VMCAI 2003: Proceedings of the 4th International Conference on Verification, Model Checking, and Abstract Interpretation

We investigate the efficiency of BDD-like data-structures for timed automata verification. We find that the efficiency is highly sensitive to the variable designs and canonical form definitions. We explore the two issues in details and propose to use ...
Efficient verification of timed automata with BDD-like data structures

We investigate the effect on efficiency of various design issues for BDD-like data structures of TA state space representation and manipulation. We find that the efficiency is highly sensitive to decision atom design and canonical form definition. We ...

Comments

Information & Contributors

Information

Published In

cover image IEEE Transactions on Software Engineering

IEEE Transactions on Software Engineering Volume 31, Issue 1

January 2005

93 pages

ISSN:0098-5589

Issue’s Table of Contents

Copyright © 2005.

Publisher

IEEE Press

Publication History

Published: 01 January 2005

Author Tags

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

23
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 11 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

Wu YBu LWang JRen XXiong WLi X(2022)Mixed Semantics Guided Layered Bounded Reachability Analysis of Compositional Linear Hybrid AutomataVerification, Model Checking, and Abstract Interpretation10.1007/978-3-030-94583-1_23(473-495)Online publication date: 16-Jan-2022
https://dl.acm.org/doi/10.1007/978-3-030-94583-1_23
Zivkovic CGrimm COlbrich MScharf OBarke E(2019)Hierarchical Verification of AMS Systems With Affine Arithmetic Decision DiagramsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems10.1109/TCAD.2018.286423838:10(1785-1798)Online publication date: 17-Sep-2019
https://dl.acm.org/doi/10.1109/TCAD.2018.2864238
Cimatti AGriggio AMover STonetta S(2015)HyCompProceedings of the 21st International Conference on Tools and Algorithms for the Construction and Analysis of Systems - Volume 903510.1007/978-3-662-46681-0_4(52-67)Online publication date: 11-Apr-2015
https://dl.acm.org/doi/10.1007/978-3-662-46681-0_4
Bittner BBozzano MCimatti AGario MGriggio AJobstmann B(2014)Towards Pareto-Optimal Parameter Synthesis for Monotonic Cost FunctionsProceedings of the 14th Conference on Formal Methods in Computer-Aided Design10.5555/2682923.2682935(23-30)Online publication date: 21-Oct-2014
https://dl.acm.org/doi/10.5555/2682923.2682935
Cimatti AGriggio AMover STonetta S(2014)Verifying LTL Properties of Hybrid Systems with K-LivenessProceedings of the 16th International Conference on Computer Aided Verification - Volume 855910.1007/978-3-319-08867-9_28(424-440)Online publication date: 18-Jul-2014
https://dl.acm.org/doi/10.1007/978-3-319-08867-9_28
Karthik ARoychowdhury J(2013)ABCD-LProceedings of the 50th Annual Design Automation Conference10.1145/2463209.2488811(1-9)Online publication date: 29-May-2013
https://dl.acm.org/doi/10.1145/2463209.2488811
Cimatti AMover STonetta S(2013)SMT-based scenario verification for hybrid systemsFormal Methods in System Design10.1007/s10703-012-0158-042:1(46-66)Online publication date: 1-Feb-2013
https://dl.acm.org/doi/10.1007/s10703-012-0158-0
Sofronie-Stokkermans V(2013)Hierarchical reasoning and model generation for the verification of parametric hybrid systemsProceedings of the 24th international conference on Automated Deduction10.1007/978-3-642-38574-2_25(360-376)Online publication date: 9-Jun-2013
https://dl.acm.org/doi/10.1007/978-3-642-38574-2_25
Bu LLi X(2011)Path-oriented bounded reachability analysis of composed linear hybrid systemsInternational Journal on Software Tools for Technology Transfer (STTT)10.5555/3220914.322119813:4(307-317)Online publication date: 1-Aug-2011
https://dl.acm.org/doi/10.5555/3220914.3221198
Cimatti AMover STonetta SBjesse PSlobodová A(2011)Proving and explaining the unfeasibility of message sequence charts for hybrid systemsProceedings of the International Conference on Formal Methods in Computer-Aided Design10.5555/2157654.2157666(54-62)Online publication date: 30-Oct-2011
https://dl.acm.org/doi/10.5555/2157654.2157666
Show More Cited By

View Options

View options

Media

Figures

Other

Tables

View Issue’s Table of Contents