PROBABILISTIC VERIFICATION

被引:47
|
作者
PNUELI, A [1 ]
ZUCK, LD [1 ]
机构
[1] YALE UNIV,DEPT COMP SCI,NEW HAVEN,CT 06520
关键词
D O I
10.1006/inco.1993.1012
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Communication protocols always have some embedded timed properties (e.g. timeout and transmission delay). To specify and analyse the timed properties, a new formal model is presented in this paper. The new protocol specification model is called the Fuzzy Timed Communicating State Machine (FTCSM) model. Since it is very hard to precisely specify time bounds as constants, the fuzzy time concept is applied to specify time bounds, i.e. each time bound is specified as a time interval. In the FTCSM model, each protocol entity and each communication channel is specified as an FTCSM, respectively. To analyse various properties of protocols specified in the FTCSM model, a fuzzy timed protocol verification method is proposed. To deal with the state space explosion problem, we adopt the probability-based partial timed verification approach. The corresponding probabilistic fuzzy timed verification scheme for the FTCSM model is also presented in detail. Using the FTCSM model and the associated probabilistic fuzzy timed protocol verification method, an Estelle-like Probabilistic Fuzzy Timed Protocol Verification System (EPFTPVS) has been developed on SUN SPARC workstations. In this way, a subset of Estelle-specified protocols with fuzzy time specifications can be automatically verified using EPFTPVS. © 1993 Academic Press, Inc.
引用
收藏
页码:1 / 29
页数:29
相关论文
共 50 条
  • [1] Complexity of probabilistic verification
    1600, ACM, New York, NY, USA (42):
  • [2] Probabilistic verification and approximation
    Lassaigne, Richard
    Peyronneta, Sylvain
    ANNALS OF PURE AND APPLIED LOGIC, 2008, 152 (1-3) : 122 - 131
  • [3] THE COMPLEXITY OF PROBABILISTIC VERIFICATION
    COURCOUBETIS, C
    YANNAKAKIS, M
    JOURNAL OF THE ASSOCIATION FOR COMPUTING MACHINERY, 1995, 42 (04): : 857 - 907
  • [4] VERIFICATION OF PROBABILISTIC PROGRAMS
    SHARIR, M
    PNUELI, A
    HART, S
    SIAM JOURNAL ON COMPUTING, 1984, 13 (02) : 292 - 314
  • [5] Perspectives in probabilistic verification
    Kaoen, Joost-Pieter
    TASE 2008: SECOND IFIP/IEEE INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF SOFTWARE ENGINEERING, PROCEEDINGS, 2008, : 3 - 10
  • [6] Probabilistic Verification and Approximation
    Lassaigne, Richard
    Peyronnet, Sylvain
    ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, 2006, 143 : 101 - 114
  • [7] VERIFICATION OF MULTIPROCESS PROBABILISTIC PROTOCOLS
    PNUELI, A
    ZUCK, L
    DISTRIBUTED COMPUTING, 1986, 1 (01) : 53 - 72
  • [8] Probabilistic Horn Clause Verification
    Albarghouthi, Aws
    STATIC ANALYSIS (SAS 2017), 2017, 10422 : 1 - 22
  • [9] Bloom filters in probabilistic verification
    Dillinger, PC
    Manolios, P
    FORMAL METHODS IN COMPUTER-AIDED DESIGN, PROCEEDINGS, 2004, 3312 : 367 - 381
  • [10] Probabilistic Verification of Network Configurations
    Steffen, Samuel
    Gehr, Timon
    Tsankov, Petar
    Vanbever, Laurent
    Vechev, Martin
    SIGCOMM '20: PROCEEDINGS OF THE 2020 ANNUAL CONFERENCE OF THE ACM SPECIAL INTEREST GROUP ON DATA COMMUNICATION ON THE APPLICATIONS, TECHNOLOGIES, ARCHITECTURES, AND PROTOCOLS FOR COMPUTER COMMUNICATION, 2020, : 750 - 764