Time-Triggered Conversion of Guards for Reachability Analysis of Hybrid Automata

被引:6
|
作者
Bak, Stanley [1 ]
Bogomolov, Sergiy [2 ]
Althoff, Matthias [3 ]
机构
[1] Air Force Res Lab, Dayton, OH 45433 USA
[2] Australian Natl Univ, Canberra, ACT, Australia
[3] Tech Univ Munich, Munich, Germany
关键词
SYSTEMS; VERIFICATION;
D O I
10.1007/978-3-319-65765-3_8
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
A promising technique for the formal verification of embedded and cyber-physical systems is flow-pipe construction, which creates a sequence of regions covering all reachable states over time. Flow-pipe construction methods can check whether specifications are met for all states, rather than just testing using a finite and incomplete set of simulation traces. A fundamental challenge when using flow-pipe construction on high-dimensional systems is the cost of geometric operations, such as intersection and convex hull. We address this challenge by showing that it is often possible to remove the need to perform high-dimensional geometric operations by combining two model transformations, direct time-triggered conversion and dynamics scaling. Further, we prove the overapproximation error in the conversion can be made arbitrarily small. Finally, we show that our transformation-based approach enables the analysis of a drivetrain system with up to 51 dimensions.
引用
收藏
页码:133 / 150
页数:18
相关论文
共 50 条
  • [1] Efficient reachability analysis of parametric linear hybrid systems with time-triggered transitions
    Forets, Marcelo
    Freire, Daniel
    Schilling, Christian
    2020 18TH ACM-IEEE INTERNATIONAL CONFERENCE ON FORMAL METHODS AND MODELS FOR SYSTEM DESIGN (MEMOCODE), 2020, : 137 - 142
  • [2] Timed vs. time-triggered automata
    Krcál, P
    Mokrushin, L
    Thiagarajan, PS
    Yi, W
    CONCUR 2004 - CONCURRENCY THEORY, PROCEEDINGS, 2004, 3170 : 340 - 354
  • [3] Splitting reachability analysis in hybrid automata
    Boisieau, P
    Roux, O
    PROCEEDINGS OF THE 11TH EUROMICRO CONFERENCE ON REAL-TIME SYSTEMS, 1999, : 98 - 105
  • [4] On Reachability for Hybrid Automata over Bounded Time
    Brihaye, Thomas
    Doyen, Laurent
    Geeraerts, Gilles
    Ouaknine, Joel
    Raskin, Jean-Francois
    Worrell, James
    AUTOMATA, LANGUAGES AND PROGRAMMING, ICALP, PT II, 2011, 6756 : 416 - 427
  • [5] The time-triggered architecture
    Kopetz, H
    Bauer, G
    PROCEEDINGS OF THE IEEE, 2003, 91 (01) : 112 - 126
  • [6] Symbolic reachability analysis of probabilistic linear hybrid automata
    Mutsuda, Y
    Kato, T
    Yamane, S
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2005, E88A (11) : 2972 - 2981
  • [7] Reachability verification for hybrid automata
    Henzinger, TA
    Rusu, V
    HYBRID SYSTEMS: COMPUTATION AND CONTROL, 1998, 1386 : 190 - 204
  • [8] Reachability Problems for Hybrid Automata
    Raskin, Jean-Francois
    REACHABILITY PROBLEMS, 2011, 6945 : 28 - 30
  • [9] Symbolic reachability analysis of lazy linear hybrid automata
    Jha, Susmit
    Brady, Bryan A.
    Seshia, Sanjit A.
    FORMAL MODELING AND ANALYSIS OF TIMED SYSTEMS, 2007, 4763 : 241 - +
  • [10] Improving reachability analysis of hybrid automata for engine control
    Casagrande, A
    Balluchi, A
    Benvenuti, L
    Policriti, A
    Villa, T
    Sangiovanni-Vincentelli, A
    2004 43RD IEEE CONFERENCE ON DECISION AND CONTROL (CDC), VOLS 1-5, 2004, : 2322 - 2327