Verifying identical communicating processes is undecidable

Theoretical Computer Science

Volumn 174, Issue 1-2, 1997, Pages 217-230

  Finkel, Alain ^a   McKenzie, Pierre ^b  

^a UNIVERSITÉ PARIS SACLAY   (France)

^b UNIVERSITÉ DE MONTRÉAL   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMMUNICATION CHANNELS (INFORMATION THEORY); COMPUTATIONAL METHODS; FINITE AUTOMATA; MATHEMATICAL MODELS; PETRI NETS; TREES (MATHEMATICS);

COMMUNICATING FINITE STATE MACHINES; MUTUAL EXCLUSION; UNDECIDABILITY;

COMPUTABILITY AND DECIDABILITY;

EID: 0346044672     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(96)00026-6     Document Type: Article

References (13)

1. P. Abdullah and B. Jonsson, Verifying programs with unreliable channels, in: Proc. 8th Annual IEEE Symposium on Logic in Computer Science, Montréal, Canada (1993) 160-170.
2. P. Abdullah and B. Jonsson, Undecidability of verifying programs with unreliable channels, in: Proc. ICALP, Lecture Notes in Computer Science, Vol. 820 (1994).
3. A. Benslimane, Deciding boundedness for systems of two communicating finite state machines, in: Proc. 3rd IEEE Internat. Symp. on High Performance Distributed Computing (1994) 262-269.
4. D. Brand and P. Zafiropulo, On communicating finite state machines, Tech. Rep. RZ 1053, IBM Zurich Research Lab, Ruschlikon, Switzerland, June 1981.
5. D. Brand and P. Zafiropulo, On communicating finite state machines, J. Assoc. Comput. Machinery 30 (1983) 323-342.
6. CCITT Recommendation Z.100: Specification and description language SDL, Blue Book Vol X.1-X.5 (1988), ITU General Secretariat, Geneva.
7. G. CéCé, A. Finkel and S. Purushothaman Iyer, Unreliable channels are easier to verify than perfect channels, Information and Computation 124 (1995).
8. M. Diaz, J.P. Ansart, P. Azena and V. Chari, The formal description technique Estelle (North-Holland, Amsterdam, 1989).
9. A. Finkel, Decidability of the termination problem for completely specified protocols, Distributed Comput. 7 (1994) 129-135.
10. J.E. Hopcroft and J.D. Ullman, Introduction to Automata Theory, Languages, and Computation (Addison-Wesley, Reading, MA, 1979).
11. G. Memmi and A. Finkel, An introduction to Fifo nets - Monogeneous nets: a subclass of Fifo nets, Theoret. Comput. Sci. 35 (1985) 191-214.
12. G. Tel, Introduction to Distributed Algorithms (Cambridge Univ. Press, Cambridge, 1994).
13. B. Vauquelin and P. Franchi-Zannettacci, Automates à files, Theoret. Comput. Sci. 80 (1980) 221-225.