Approximate Safety Properties in Metric Transition Systems

被引:3
作者
Qian, Junyan [1 ]
Shi, Fan [2 ]
Cai, Yong [3 ]
Pan, Haiyu [4 ]
机构
[1] Guangxi Normal Univ, Guangxi Key Lab Multisource Informat Min & Secur, Guilin 541004, Peoples R China
[2] Nanjing Univ Aeronaut & Astronaut, Nanjing 211106, Peoples R China
[3] Guangxi Rd & Bridge Engn Grp Co Ltd, Nanning 530200, Peoples R China
[4] Guilin Univ Elect Technol, Guangxi Key Lab Trusted Software, Guilin 541004, Peoples R China
基金
中国国家自然科学基金;
关键词
Safety; Extraterrestrial measurements; Approximation algorithms; Cost accounting; Probabilistic logic; Model checking; Automata; Bisimulation; linear-time (LT) property; metric transition system (MTS); pseudometric; safety property; LINEAR-TIME PROPERTIES; MODEL CHECKING; BISIMULATION; SIMULATION; DISCRETE; DISTANCE;
D O I
10.1109/TR.2021.3139616
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Metric transition systems (MTSs) are proposed for quantitative verification of reactive systems. There are already a number of papers on quantitatively analyzing behaviors of systems based on MTSs. In this article, we make further progress along this research line by lifting safety properties, which assert that nothing "bad" happens during execution of systems, to MTSs. First, we introduce a distance threshold $\alpha \ \text{taken from [0,1],}$ which is used to analyze to what extent a system satisfies its specification. Then, we present a quantitative extension of safety properties, called $\alpha$-safety properties. Furthermore, we give an alternative characterization of $\alpha$-safety properties by means of their closure. In addition, an algorithm for verifying whether a system satisfies a subclass of $\alpha$-safety properties is developed, assuming that the method to convert a regular $\alpha$-safety property to an equivalent metric finite automaton has been given. Finally, we present an example to illustrate our approaches.
引用
收藏
页码:221 / 234
页数:14
相关论文
共 50 条
  • [1] DEFINING LIVENESS
    ALPERN, B
    SCHNEIDER, FB
    [J]. INFORMATION PROCESSING LETTERS, 1985, 21 (04) : 181 - 185
  • [2] RECOGNIZING SAFETY AND LIVENESS
    ALPERN, B
    SCHNEIDER, FB
    [J]. DISTRIBUTED COMPUTING, 1987, 2 (03) : 117 - 126
  • [3] Alsuwaiyel M.H., 2003, Algorithms: design techniques and analysis
  • [4] A COMPLETE QUANTITATIVE DEDUCTION SYSTEM FOR THE BISIMILARITY DISTANCE ON MARKOV CHAINS
    Bacci, Giorgio
    Bacci, Giovanni
    Larsen, Kim G.
    Mardare, Radu
    [J]. LOGICAL METHODS IN COMPUTER SCIENCE, 2018, 14 (04)
  • [5] On the metric-based approximate minimization of Markov Chains
    Bacci, Giovanni
    Bacci, Giorgio
    Larsen, Kim G.
    Mardare, Radu
    [J]. JOURNAL OF LOGICAL AND ALGEBRAIC METHODS IN PROGRAMMING, 2018, 100 : 36 - 56
  • [6] Baier C, 2008, PRINCIPLES OF MODEL CHECKING, P1
  • [7] Battery Transition Systems
    Boker, Udi
    Henzinger, Thomas A.
    Radhakrishna, Arjun
    [J]. ACM SIGPLAN NOTICES, 2014, 49 (01) : 595 - 606
  • [8] Bruns G, 2004, LECT NOTES COMPUT SC, V3142, P281
  • [9] Bu TM, 2017, PROCEEDINGS 11TH 2017 INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF SOFTWARE ENGINEERING (TASE), P32
  • [10] Formal Verification With Confidence Intervals to Establish Quality of Service Properties of Software Systems
    Calinescu, Radu
    Ghezzi, Carlo
    Johnson, Kenneth
    Pezze, Mauro
    Rafiq, Yasmin
    Tamburrelli, Giordano
    [J]. IEEE TRANSACTIONS ON RELIABILITY, 2016, 65 (01) : 107 - 125