Statistical Model Checking for Priced Timed Automata

被引:25
|
作者
Bulychev, Peter [1 ]
David, Alexandre [1 ]
Larsen, Kim Guldstrand [1 ]
Legay, Axel [2 ,3 ]
Mikucionis, Marius [1 ]
Poulsen, Danny Bogsted [1 ]
Wang, Zheng [4 ]
机构
[1] Aalborg Univ, Dept Comp Sci, Aalborg, Denmark
[2] INRIA, Rennes, France
[3] Aalborg Univ, Dept Comp Sci, Aalborg, Denmark
[4] East China Normal Univ, Software Engn Inst, Shanghai Key Lab Trustworthy Comp, Shanghai, Peoples R China
来源
ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE | 2012年 / 85期
关键词
D O I
10.4204/EPTCS.85.1
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
This paper offers a survey of UPPAAL-SMC, a major extension of the real-time verification tool UPPAAL. UPPAAL-SMC allows for the efficient analysis of performance properties of networks of priced timed automata under a natural stochastic semantics. In particular, UPPAAL-SMC relies on a series of extensions of the statistical model checking approach generalized to handle real-time systems and estimate undecidable problems. UPPAAL-SMC comes together with a friendly user interface that allows a user to specify complex problems in an efficient manner as well as to get feedback in the form of probability distributions and compare probabilities to analyze performance aspects of systems. The focus of the survey is on the evolution of the tool - including modeling and specification formalisms as well as techniques applied - together with applications of the tool to case studies.
引用
收藏
页码:1 / 16
页数:16
相关论文
共 50 条
  • [41] 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
  • [42] Checking MTL Properties of Discrete Timed Automata via Bounded Model Checking
    Wozna-Szczesniak, Bozena
    Zbrzezny, Andrzej
    FUNDAMENTA INFORMATICAE, 2014, 135 (04) : 553 - 568
  • [43] Checking ACTL* properties of discrete timed automata via bounded model checking
    Wozna, B
    Zbrzezny, A
    FORMAL MODELING AND ANALYSIS OF TIMED SYSTEMS, 2003, 2791 : 18 - 33
  • [44] Deep random search for efficient model checking of timed automata
    Grosu, R.
    Huang, X.
    Smolka, S. A.
    Tan, W.
    Tripakis, S.
    COMPOSITION OF EMBEDDED SYSTEMS: SCIENTIFIC AND INDUSTRIAL ISSUES, 2007, 4888 : 111 - +
  • [45] Parameterized model checking of networks of timed automata with Boolean guards
    Spalazzi, Luca
    Spegni, Francesco
    THEORETICAL COMPUTER SCIENCE, 2020, 813 : 248 - 269
  • [46] MODEL CHECKING PROBABILISTIC TIMED AUTOMATA WITH ONE OR TWO CLOCKS
    Jurdzinski, Marcin
    Laroussinie, Francois
    Sproston, Jeremy
    LOGICAL METHODS IN COMPUTER SCIENCE, 2008, 4 (03)
  • [47] On using priced timed automata to achieve optimal scheduling
    Rasmussen, J. I.
    Larsen, K. G.
    Subramani, K.
    FORMAL METHODS IN SYSTEM DESIGN, 2006, 29 (01) : 97 - 114
  • [48] On using priced timed automata to achieve optimal scheduling
    J. I. Rasmussen
    K. G. Larsen
    K. Subramani
    Formal Methods in System Design, 2006, 29 : 97 - 114
  • [49] Dealing with practical limitations of distributed model checking for timed automata
    Braberman, V.
    Olivero, A.
    Schapachnik, F.
    FORMAL METHODS IN SYSTEM DESIGN, 2006, 29 (02) : 197 - 214
  • [50] Monte Carlo Tree Search for Priced Timed Automata
    Jensen, Peter Gjol
    Kiviriga, Andrej
    Larsen, Kim Guldstrand
    Nyman, Ulrik
    Mijacika, Adriana
    Mortensen, Jeppe Hoiriis
    QUANTITATIVE EVALUATION OF SYSTEMS (QEST 2022), 2022, 13479 : 381 - 398