REVERSE REACHABILITY ANALYSIS - A NEW TECHNIQUE FOR DEADLOCK DETECTION ON COMMUNICATING FINITE-STATE MACHINES

被引：3
|
作者：
HUNG, YC
CHEN, GH
机构：
[1] Department of Computer Science and Information Engineering, National Taiwan University, Taipei
来源：
SOFTWARE-PRACTICE & EXPERIENCE | 1993年 / 23卷 / 09期
关键词：
COMMUNICATING FINITE STATE MACHINE; DEADLOCK DETECTION; REACHABILITY ANALYSIS; REVERSE REACHABILITY ANALYSIS;
D O I：
10.1002/spe.4380230904
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
The communicating finite state machines can exchange messages over bounded FIFO channels. In this paper, a new technique, called reverse reachability analysis, is proposed to detect deadlocks on the communication between the communicating finite state machines. The technique is based on finding reverse reachable paths starting from possible deadlock states. If a reverse reachable path can reach the initial global state, then deadlock occurs. Otherwise the communication is deadlock-free. The effectiveness of the technique has been verified by some real protocols such as a specification ot X.25 call establishment/clear protocol and Bartlet's alternating bit protocol.
引用
收藏
页码：965 / 979
页数：15
相关论文
共 50 条
  • [11] IN FINITE-STATE MACHINES, LIVING MACHINES
    KRUGER, T
    ARCHITECTURAL DESIGN, 1994, (111) : R14 - R15
  • [12] TESTING FINITE-STATE MACHINES - FAULT-DETECTION
    YANNAKAKIS, M
    LEE, D
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1995, 50 (02) : 209 - 227
  • [13] Reachability for Finite-State Process Algebras Using Static Analysis
    Skrypnyuk, Nataliya
    Nielson, Flemming
    REACHABILITY PROBLEMS, 2011, 6945 : 231 - 244
  • [14] COMBINED USE OF FINITE-STATE MACHINES AND PETRI NETS FOR MODELING COMMUNICATING PROCESSES
    PATTAVINA, A
    TRIGILA, S
    ELECTRONICS LETTERS, 1984, 20 (22) : 915 - 916
  • [15] Periodic finite-state machines
    Kopetz, H.
    El-Salloum, C.
    Huber, B.
    Obermaisser, R.
    10TH IEEE INTERNATIONAL SYMPOSIUM ON OBJECT AND COMPONENT-ORIENTED REAL-TIME DISTRIBUTED COMPUTING, PROCEEDINGS, 2007, : 10 - +
  • [16] ANALYSIS OF A CLASS OF COMMUNICATING FINITE STATE MACHINES
    PENG, WX
    PURUSHOTHAMAN, S
    ACTA INFORMATICA, 1992, 29 (6-7) : 499 - 522
  • [17] State assignment of finite-state machines
    Ahmad, I
    Dhodhi, MK
    IEE PROCEEDINGS-COMPUTERS AND DIGITAL TECHNIQUES, 2000, 147 (01): : 15 - 22
  • [18] Robots and finite-state machines
    Carter, EF
    DR DOBBS JOURNAL, 1997, 22 (02): : 50 - +
  • [19] Improved reachability analysis of large finite state machines
    Cabodi, G
    Camurati, P
    Quer, S
    1996 IEEE/ACM INTERNATIONAL CONFERENCE ON COMPUTER-AIDED DESIGN - DIGEST OF TECHNICAL PAPERS, 1996, : 354 - 360
  • [20] Refinement of finite-state machines
    Li, HW
    Min, YH
    Li, ZC
    CAD/GRAPHICS '2001: PROCEEDINGS OF THE SEVENTH INTERNATIONAL CONFERENCE ON COMPUTER AIDED DESIGN AND COMPUTER GRAPHICS, VOLS 1 AND 2, 2001, : 624 - 629
12345