Certifying Emptiness of Timed Buchi Automata

被引:7
作者
Wimmer, Simon [1 ]
Herbreteau, Frederic [2 ]
de Pol, Jaco van [3 ]
机构
[1] Tech Univ Munich, Fak Informat, Munich, Germany
[2] Univ Bordeaux, CNRS, Bordeaux INP, LaBRI,UMR 5800, F-33400 Bordeaux, France
[3] Aarhus Univ, Dept Comp Sci, Aarhus, Denmark
来源
FORMAL MODELING AND ANALYSIS OF TIMED SYSTEMS, FORMATS 2020 | 2020年 / 12288卷
关键词
Timed automata; Certification; Model checking; CHECKING;
D O I
10.1007/978-3-030-57628-8_4
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Model checkers for timed automata are widely used to verify safety-critical, real-time systems. State-of-the-art tools achieve scalability by intricate abstractions. We aim at further increasing the trust in their verification results, in particular for checking liveness properties. To this end, we develop an approach for extracting certificates for the emptiness of timed Buchi automata from model checking runs. These certificates can be double checked by a certifier that we formally verify in Isabelle/HOL. We study liveness certificates in an abstract setting and show that our approach is sound and complete. To also demonstrate its feasibility, we extract certificates for several models checked by TChecker and Imitator, and validate them with our verified certifier.
引用
收藏
页码:58 / 75
页数:18
相关论文
共 37 条
[1]   A THEORY OF TIMED AUTOMATA [J].
ALUR, R ;
DILL, DL .
THEORETICAL COMPUTER SCIENCE, 1994, 126 (02) :183-235
[2]  
Andre Etienne, 2012, FM 2012: Formal Methods. Proceedings of the 18th International Symposium, P33, DOI 10.1007/978-3-642-32759-9_6
[3]  
André É, 2011, LECT NOTES COMPUT SC, V6945, P31, DOI 10.1007/978-3-642-24288-5_5
[4]   Lower and upper bounds in zone-based abstractions of timed automata [J].
Gerd Behrmann ;
Patricia Bouyer ;
Kim G. Larsen ;
Radek Pelánek .
International Journal on Software Tools for Technology Transfer, 2006, 8 (3) :204-215
[5]  
Behrmann G, 2003, LECT NOTES COMPUT SC, V2619, P254
[6]   Timed automata: Semantics, algorithms and tools [J].
Bengtsson, J ;
Yi, W .
LECTURES ON CONCURRENCY AND PETRI NETS: ADVANCES IN PETRI NETS, 2004, 3098 :87-124
[7]   A Verified SAT Solver Framework with Learn, Forget, Restart, and Incrementality [J].
Blanchette, Jasmin Christian ;
Fleury, Mathias ;
Lammich, Peter ;
Weidenbach, Christoph .
JOURNAL OF AUTOMATED REASONING, 2018, 61 (1-4) :333-365
[8]  
Blom Stefan, 2017, Integrated Formal Methods. 13th International Conference, IFM 2017. Proceedings: LNCS 10510, P102, DOI 10.1007/978-3-319-66845-1_7
[9]  
Brunner J., 2019, LIPICS, V141
[10]   Formal Verification of an Executable LTL Model Checker with Partial Order Reduction [J].
Brunner, Julian ;
Lammich, Peter .
JOURNAL OF AUTOMATED REASONING, 2018, 60 (01) :3-21