Model checking timed systems with priorities

被引:0
|
作者
Hsiung, PA [1 ]
Lin, SW [1 ]
机构
[1] Natl Chung Cheng Univ, Dept Comp Sci & Informat Engn, Chiayi 621, Taiwan
关键词
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Priorities are used to resolve conflicts such as in resource sharing and in safety designs. The use of priorities has become indispensable in real-time system design such as in scheduling, synchronization, arbitration, and fairness guaranteeing. There are several modeling frameworks that show how timed systems with priorities are to be designed and how priority schedulers can be automatically synthesized. However the verification of timed systems with priorities using model checking is still a relatively untouched area. We show what the issues are in model checking timed systems with priorities and how the issues are solved in this work. In the process, we propose an optimal zone subtraction algorithm. The method has been implemented into the SGM model checker and successfully applied to real-time embedded systems and safety-critical systems, which illustrate the feasibility and advantages of the proposed verification method
引用
收藏
页码:539 / 544
页数:6
相关论文
共 50 条
  • [41] Model checking restricted sets of timed paths
    Markey, Nicolas
    Raskin, Jean-Francois
    THEORETICAL COMPUTER SCIENCE, 2006, 358 (2-3) : 273 - 292
  • [42] Improved Bounded Model Checking of Timed Automata
    Smith, Robert L.
    Bersani, Marcello M.
    Rossi, Matteo
    San Pietro, Pierluigi
    2021 IEEE/ACM 9TH INTERNATIONAL CONFERENCE ON FORMAL METHODS IN SOFTWARE ENGINEERING (FORMALISE 2021), 2021, : 97 - 110
  • [43] Statistical model checking of Timed Rebeca models
    Jafari, Ali
    Khamespanah, Ehsan
    Kristinsson, Haukur
    Sirjani, Marjan
    Magnusson, Brynjar
    COMPUTER LANGUAGES SYSTEMS & STRUCTURES, 2016, 45 : 53 - 79
  • [44] Symbolic model checking for probabilistic timed automata
    Kwiatkowska, M
    Norman, G
    Sproston, J
    Wang, FZ
    FORMAL TECHNIQUES, MODELLING AND ANALYSIS OF TIMED AND FAULT-TOLERANT SYSTEMS, PROCEEDINGS, 2004, 3253 : 293 - 308
  • [45] Model checking for extended timed temporal logics
    Bouajjani, A
    Lakhnech, Y
    Yovine, S
    FORMAL TECHNIQUES IN REAL-TIME AND FAULT-TOLERANT SYSTEMS, 1996, 1135 : 306 - 326
  • [46] Symbolic model checking for probabilistic timed automata
    Kwiatkowska, Marta
    Norman, Gethin
    Sproston, Jeremy
    Wang, Fuzhi
    INFORMATION AND COMPUTATION, 2007, 205 (07) : 1027 - 1077
  • [47] Linear parametric model checking of timed automata
    Hune, T
    Romijn, J
    Stoelinga, M
    Vaandrager, F
    JOURNAL OF LOGIC AND ALGEBRAIC PROGRAMMING, 2002, 52-3 : 183 - 220
  • [48] Model checking on timed-event structures
    Dasgupta, P
    Deka, JK
    Chakrabarti, PP
    IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 2000, 19 (05) : 601 - 611
  • [49] Statistical Model Checking for Priced Timed Automata
    Bulychev, Peter
    David, Alexandre
    Larsen, Kim Guldstrand
    Legay, Axel
    Mikucionis, Marius
    Poulsen, Danny Bogsted
    Wang, Zheng
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2012, (85): : 1 - 16
  • [50] Bounded Model Checking for Parametric Timed Automata
    Knapik, Michal
    Penczek, Wojciech
    TRANSACTIONS ON PETRI NETS AND OTHER MODELS OF CONCURRENCY V, 2012, 6900 : 141 - 159