Unreliable Channels are Easier to Verify Than Perfect Channels

Information and Computation

Volumn 124, Issue 1, 1996, Pages 20-31

  Cécé, Gérard ^a   Finkel, Alain ^a   Purushothaman Iyer, S ^b  

^a UNIVERSITÉ PARIS SACLAY   (France)

^b North Carolina State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 13544268666     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.1996.0003     Document Type: Article

References (17)

1. Abdulla, P., and Jonsson, B. (1993). Verifying programs with unreliable channels, in "Proceedings of Logic in Computer Science," Eighth Annual Symposium on Logic in Computer Science, Montreal, June 1993, Computer Science Press.
2. Abdulla, P., and Jonsson, B. (1994). Undecidability of verifying programs with unreliable channels, in "Proceedings of ICALP," LNCS 820.
3. Bartlett, K. A., Scantlebury, R. A., and Wilkinson, P. T. (1969). A note on reliable full-duplex transmission over half-duplex lines, Comm. ACM 12(5), 260-265.
4. Berstel, J. (1979). "Transductions and Context-Free Languages," Teubner, Stuttgart.
5. Bochmann, Gregor (1978). Finite state description of communication protocols, Comput. Networks 2, 362-372.
6. Brand, Daniel, and Zafiropulo, Pitro (1983). On communicating finite-state machines, J. Assoc. Comput. Mach. 30(2), 323-342.
7. CCITT Recommendation Z.100 (1988). "Specification and Description Language SDL," Blue Book Vols. X.1-X.5, ITU General Secretariat, Geneva.
8. Diaz, M., Ansart, J. P., Azema, P., and Chari, V. (1989). "The Formal Description Technique Estelle," North-Holland, Amsterdam.
9. Emerson, E. A., and Halpern, J. Y. (1986). "Sometimes" and "not never" revisited: On branching time versus linear time temporal logic, J. Assoc. Comput. Mach. 33(1), 151-178.
10. Finkel, Alain (1994). Decidability of the termination problem for completely specified protocols, Distrib. Comput. 7, 129-135.
11. van Glabbeek, R. J., and Vaandrager, F. W. (1993). Modular specification of process algebras, Theoret. Comput. Sci. 113, 293-348.
12. Gouda, M. G., Gurari, E. M., Lai, T.-H., and Rosier, L. E. (1987). On deadlock detection in systems of communicating finite state machines, Comput. Artif. Intell. 6(3), 209-228.
13. Higman, G. (1952). Ordering by divisibility in abstract algebras, Proc London Math. Soc. 2, 326-336.
14. Lothaire, M. (1983). "Combinatorics on Words," Addison-Wesley, Reading, MA.
15. Pachl, J. K. (1987). Protocol description and analysis based on a state transition model with channel expressions, in "Proceedings of Protocol Specification, Testing and Verification, VII, May," North-Holland.
16. Peng, W., and Purushothaman, S. (1991). Data flow analysis of communicating finite state machines, ACM Trans. Programming Languages Systems 13(3), 399-442.
17. Tarski, A. (1955). A lattice theoretic fixpoint theorem and its application, Pacific J. Math. 5, 285-305.