Deadlock detection in communicating finite state machines by even reachability analysis
- Wuxu Peng
- … show all 1 hide
Purchase on Springer.com
$39.95 / €34.95 / £29.95*
Rent the article at a discountRent now
* Final gross prices may vary according to local VAT.
A network of communicating finite state machines (CFSM) consists of a set of finite state machines which communicate asynchronously with each other over (potentially) unbounded FIFO channels by sending and receiving typed messages. As a concurrency model, CFSMs has been widely used to specify and validate communications protocols. CFSMs is also powerful and suitable for modeling mobile communication systems – a CFSM can naturally model a mobile station in a wireless communication system. The unbounded FIFO channels are ideal for modeling the communication behavior among mobile stations. Fair reachability is a very useful technique in detecting errors of deadlocks and unspecified receptions in networks of (CFSMs) consisting of two machines. The paper extends the classical fair reachability technique, which is only applicable to the class of two-machine CFSMs, to the general class of CFSMs. For bounded CFSMs, the extended fair reachability technique reduces by more than one half the total number of reachable global states that have to be searched in verifying freedom from deadlocks. The usefulness of the new reachability technique, called even reachability, is demonstrated through two examples.
- D. Brand and P. Zafiropulo, On communicating finite-state machines, Journal of the Association for Computing Machinery 30(2) (1983) 323–342.
- M. Gouda and C.K. Chang, Proving liveness for networks of communicating finite state machines, ACM Transactions on Programming Languages and Systems 8(1) (1986) 154–182. CrossRef
- M. Gouda, E. Gurari, T.-H. Lai and L.E. Rosier, On deadlock detection in systems of communicating finite state machines, Computers and Artificial Intelligence 6(3) (1987) 209–228.
- M. Gouda and J. Han, Protocol validation by fair progress state exploration, Computer Networks and ISDN System 9 (1985) 353–361. CrossRef
- G.J. Holzmann, An improved protocol reachability analysis technique, Software Practice and Experience 18(2) (February 1988) 137–161.
- J. Pachl, Protocol description and analysis based on a state transition model with channel expressions, in: Protocol Specification, Testing, and Verification, Vol. VII, eds. H. Rubin and C.H. West (North-Holland, Amsterdam, 1987) pp. 207–219.
- W. Peng and S. Purushothaman, Data flow analysis of communicating finite state machines, ACM Transactions on Programming Language and Systems 13(3) (1991) 399–442. CrossRef
- W. Peng and S. Purushothaman, Analysis of a class of communicating finite state machines, Acta Informatica 29 (1992) 499–522. CrossRef
- W. Peng, Single-link and time communicating finite state machines, in: Proc. of 1994 International Conference on Network Protocols, Boston (October 1994) pp. 126–133.
- T. Räuchle and S. Toueg, Exposure to deadlock for communicating processes is hard to detect, Information Processing Letters 21 (1985) 63–68. CrossRef
- J. Rubin and C.H. West, An improved protocol validation technique, Computer Networks 6(2) (April 1982) 65–73. CrossRef
- Y.T. Yu and M.G. Gouda, Deadlock detection for a class of communicating finite-state machines, IEEE Transaction on Communications 30(12) (December 1982) 2514–2518. CrossRef
- Y.T. Yu and M.G. Gouda, Unboundedness detection for a class of communicating finite state machines, Information Processing Letters 17 (1983) 235–240. CrossRef
- Deadlock detection in communicating finite state machines by even reachability analysis
Mobile Networks and Applications
Volume 2, Issue 3 , pp 251-257
- Cover Date
- Print ISSN
- Online ISSN
- Kluwer Academic Publishers
- Additional Links
- Industry Sectors
- Wuxu Peng (1)
- Author Affiliations
- 1. Department of Computer Science, Southwest Texas State University, San Marcos, TX, 78666, USA