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 条
  • [31] The branching-time transformation technique for chain datalog programs
    Rondogiannis, P
    Gergatsoulis, M
    JOURNAL OF INTELLIGENT INFORMATION SYSTEMS, 2001, 17 (01) : 71 - 94
  • [32] Strategies, Model Checking and Branching-Time Properties in Maude
    Rubio, Ruben
    Marti-Oliet, Narciso
    Pita, Isabel
    Verdejo, Alberto
    REWRITING LOGIC AND ITS APPLICATIONS, WRLA 2020, 2020, 12328 : 156 - 175
  • [33] A Resolution Calculus for the Branching-Time Temporal Logic CTL
    Zhang, Lan
    Hustadt, Ullrich
    Dixon, Clare
    ACM TRANSACTIONS ON COMPUTATIONAL LOGIC, 2014, 15 (01)
  • [34] A resolution method for CTL branching-time temporal logic
    Bolotov, A
    Fisher, M
    FOURTH INTERNATIONAL WORKSHOP ON TEMPORAL REPRESENTATION AND REASONING, PROCEEDINGS, 1997, : 20 - 27
  • [35] Complexity results on branching-time pushdown model checking
    Bozzelli, L
    VERIFICATION, MODEL CHECKING , AND ABSTRACT INTERPRETATION, PROCEEDINGS, 2006, 3855 : 65 - 79
  • [36] On the expressivity and complexity of quantitative branching-time temporal logics
    Laroussinie, F
    Schnoebelen, P
    Turuani, M
    LATIN 2000: THEORETICAL INFORMATICS, 2000, 1776 : 437 - 446
  • [37] Bounded model checking for branching-time temporal logic
    Zhou Conghua
    Tao Zhihong
    Ding Decheng
    Wang Lifu
    CHINESE JOURNAL OF ELECTRONICS, 2006, 15 (04): : 675 - 678
  • [38] Branching-Time Temporal Logics with Minimal Model Quantifiers
    Mogavero, Fabio
    Murano, Aniello
    DEVELOPMENTS IN LANGUAGE THEORY, PROCEEDINGS, 2009, 5583 : 396 - 409
  • [39] A Synthesis Tool for Optimal Monitors in a Branching-Time Setting
    Achilleos, Antonis
    Exibard, Leo
    Francalanza, Adrian
    Lehtinen, Karoliina
    Xuereb, Jasmine
    COORDINATION MODELS AND LANGUAGES, 2022, 13271 : 181 - 199
  • [40] Complexity results on branching-time pushdown model checking
    Bozzelli, Laura
    THEORETICAL COMPUTER SCIENCE, 2007, 379 (1-2) : 286 - 297