re-optimization < reachability < reachability analysis verification across abstraction and refinement steps is a central and important issue in formal system validation | Facettes : |
List of bibliographic references
Number of relevant bibliographic references: 5.Ident. | Authors (with country if any) | Title |
---|---|---|
000F99 (2013-08) | Olivier Bournez [France] ; Daniel Graça [Portugal] ; Emmanuel Hainry [France] | Computation with perturbed dynamical systems |
002F71 (2009) | Emmanuel Hainry [France] | Decidability and Undecidability in Dynamical Systems |
004697 (2005-04) | Jean-Raymond Abrial [Suisse] ; Dominique Cansell [France] ; Dominique Méry [France] | Refinement and Reachability in Event_B |
006880 (1998) | Denis Lugiez [France] ; Philippe Schnoebelen | The Regular Viewpoint on PA-Processes |
006B26 (1997) | Thomas Genet [France] | Decidable Approximations of Sets of Descendants and Sets of Normal Forms - extended version - |
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Hal/Checkpoint
HfdIndexSelect -h $EXPLOR_AREA/Data/Hal/Checkpoint/KwdEn.i -k "reachability"
HfdIndexSelect -h $EXPLOR_AREA/Data/Hal/Checkpoint/KwdEn.i \ -Sk "reachability" \ | HfdSelect -Kh $EXPLOR_AREA/Data/Hal/Checkpoint/biblio.hfd
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien |wiki= Wicri/Lorraine |area= InforLorV4 |flux= Hal |étape= Checkpoint |type= indexItem |index= KwdEn.i |clé= reachability }}
![]() | This area was generated with Dilib version V0.6.33. | ![]() |