Construction of deadlock-free designs of communication protocols from observations

Computer Journal

Volumn 45, Issue 2, 2002, Pages 162-173

  Chen, Xiao Jun ^a   Ural, Hasan ^b  

^a UNIVERSITY OF WINDSOR   (Canada)

^b UNIVERSITY OF OTTAWA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SIMULATION; COMPUTER SYSTEM RECOVERY; DISTRIBUTED COMPUTER SYSTEMS; FINITE AUTOMATA; REVERSE ENGINEERING; SOFTWARE ENGINEERING;

COMMUNICATING FINITE STATE MACHINE; COMPLEX DISTRIBUTED SYSTEMS;

NETWORK PROTOCOLS;

EID: 0036236516     PISSN: 00104620     EISSN: None     Source Type: Journal    
DOI: 10.1093/comjnl/45.2.162     Document Type: Article

References (33)

1. Reverse engineering and design recovery
2. Reverse engineering of communication protocols
3. Finite state descriptions of communication protocols
4. On communicating finite state machines
5. A decomposition method for the analysis and design of finite state protocols
6. A sequence method for protocol construction
7. A service creation environment based on scenarios
8. Automatic synthesis of state machines from trace diagrams
9. Synthesizing a protocol converter from executable protocol traces
10. Towards analyzing and synthesizing protocols
11. Communications software reverse engineering
12. Recovery of communication protocol design from protocol execution traces
13. Recovery of protocol service design with timing behaviour from protocol execution traces
14. Recovery of CFSM-based protocol and service design from protocol execution traces
15. Closed covers: To verify progress for communicating finite state machines
16. On the decidability of livelock detection in networks of communicating finite state machines
17. Protocol validation by fair progress state exploration
18. Protocol validation by maximal progress state exploration
19. An improved protocol reachability analysis technique
20. Protocol verification using reachability analysis: The state explosion problem and relief strategies
21. Generalized fair reachability analysis for cyclic protocols
22. Probabilistic verification of communication protocols
23. Protocol validation by simultaneous reachability analysis
24. A unified approach to the deadlock detection in networks of communicating finite state machines
25. An improved protocol validation technique
26. An automated technique of communications protocol validation
27. Protocol verification by random state exploration
28. Deadlock detection for a class of communicating finite state machines
29. Protocol validation by duologue-matrix analysis
30. A test case generation method for concurrent programs
31. A calculus of total correctness for communicating processes