Number of the records: 1  

Incremental Computation of Succinct Abstractions for Hybrid Systems

  1. SYS0365291
    LBL
      
    01832^^^^^2200241^^^450
    005
      
    20240103195634.5
    014
      
    $a 000306348600019 $2 WOS
    014
      
    $a 80053303387 $2 SCOPUS
    017
    7-
    $a 10.1007/978-3-642-24310-3_19 $2 DOI
    100
      
    $a 20111017d m y slo 03 ba
    101
    0-
    $a eng
    102
      
    $a DE
    200
    1-
    $a Incremental Computation of Succinct Abstractions for Hybrid Systems
    215
      
    $a 15 s.
    463
    -1
    $1 001 cav_un_epca*0365290 $1 010 $a 978-3-642-24309-7 $1 011 $a 0302-9743 $1 200 1 $a Formal Modeling and Analysis of Timed Systems $v S. 271-285 $1 210 $a Berlin $c Springer $d 2011 $1 225 $a Lecture Notes in Computer Science $v 6919 $1 702 1 $a Fahrenberg $b U. $4 340 $1 702 1 $a Tripakis $b s. $4 340
    610
    0-
    $a abstraction
    610
    0-
    $a incremental refinement
    610
    0-
    $a hybrid system
    610
    0-
    $a safety property
    700
    -1
    $3 cav_un_auth*0242279 $a Dzetkulič $b Tomáš $i Oddělení výpočetních metod $j Department of Computational Methods $p UIVT-O $4 070 $T Ústav informatiky AV ČR, v. v. i.
    701
    -1
    $3 cav_un_auth*0218448 $a Ratschan $b Stefan $i Oddělení výpočetních metod $j Department of Computational Methods $p UIVT-O $w Department of Computational Mathematics $4 070 $T Ústav informatiky AV ČR, v. v. i.
Number of the records: 1  

  This site uses cookies to make them easier to browse. Learn more about how we use cookies.