Compositional Branching-Time Measurements

被引:0
|
作者
Grosu, Radu [1 ]
Peled, Doron [2 ]
Ramakrishnan, C. R. [3 ]
Smolka, Scott A. [3 ]
Stoller, Scott D. [3 ]
Yang, Junxing [3 ]
机构
[1] Vienna Univ Technol, Vienna, Austria
[2] Bar Ilan Univ, Ramat Gan, Israel
[3] SUNY Stony Brook, Stony Brook, NY USA
关键词
VERIFICATION;
D O I
暂无
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Formal methods are used to increase the reliability of software and hardware systems. Methods such as model checking, verification and testing are used to search for design and coding errors, integrated in the process of system design. Beyond checking whether a system satisfies a particular specification, we may want to measure some of its quantitative properties. Earlier works on system measurements suggest extending model checking techniques to measure quantitative artifacts, based on weights associated with the transitions of a transition system. Other works allow counting while performing model checking or runtime verification. This paper presents a simple and efficient compositional measuring framework based on quantitative state testers. The framework allows combining multiple measures, such as distance and power consumption, using a variety of functions, such as min, max, and average. This supports calculation of interesting compound measures that quantitatively characterize a system's behavior.
引用
收藏
页码:118 / +
页数:2
相关论文
共 50 条
  • [21] Stochastic games with branching-time winning objectives
    Brazdil, Tomas
    Brozek, Vaclav
    Forejt, Vojtech
    Kucera, Antonin
    21ST ANNUAL IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE, PROCEEDINGS, 2006, : 349 - +
  • [22] Comparative branching-time semantics for Markov chains
    Baier, C
    Katoen, JP
    Hermanns, H
    Wolf, V
    INFORMATION AND COMPUTATION, 2005, 200 (02) : 149 - 214
  • [23] Undivided and indistinguishable histories in branching-time logics
    Zanardo A.
    Journal of Logic, Language and Information, 1998, 7 (3) : 297 - 315
  • [24] Model checking for hybrid branching-time logics
    Kernberger, Daniel
    Lange, Martin
    JOURNAL OF LOGICAL AND ALGEBRAIC METHODS IN PROGRAMMING, 2020, 110
  • [25] ON THE WEAK ADEQUACY OF BRANCHING-TIME TEMPORAL LOGIC
    SCHNOEBELEN, P
    PINCHINAT, S
    LECTURE NOTES IN COMPUTER SCIENCE, 1990, 432 : 377 - 388
  • [26] EXPRESSIBILITY RESULTS FOR LINEAR-TIME AND BRANCHING-TIME LOGICS
    CLARKE, EM
    DRAGHICESCU, IA
    LECTURE NOTES IN COMPUTER SCIENCE, 1989, 354 : 428 - 437
  • [27] A linear-time branching-time perspective on interface automata
    Walter Vogler
    Gerald Lüttgen
    Acta Informatica, 2020, 57 : 513 - 550
  • [28] A linear-time branching-time perspective on interface automata
    Vogler, Walter
    Luettgen, Gerald
    ACTA INFORMATICA, 2020, 57 (3-5) : 513 - 550
  • [29] Strategies, model checking and branching-time properties in Maude
    Rubio, Ruben
    Marti-Oliet, Narciso
    Pita, Isabel
    Verdejo, Alberto
    JOURNAL OF LOGICAL AND ALGEBRAIC METHODS IN PROGRAMMING, 2021, 123
  • [30] Incremental Witness Generation for Branching-Time Logic CTL*
    Luo, Xiangyu
    Liang, Sen
    Zheng, Lixiao
    Chen, Zuxi
    Yang, Fan
    IEEE TRANSACTIONS ON RELIABILITY, 2022, 71 (02) : 933 - 950