On verifying fair lossy channel systems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2420, Issue , 2002, Pages 543-555

  Masson, Benoît ^a   Schnoebelen, P ^a  

^a CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

ALGORITHMIC VERIFICATION; COMPUTATIONAL MODEL; FAIR TERMINATION; FIFO CHANNELS; LOSSY CHANNEL SYSTEMS;

ARTIFICIAL INTELLIGENCE;

EID: 84957020219     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45687-2_45     Document Type: Conference Paper

References (12)

1. P. A. Abdulla, A. Annichini, and A. Bouajjani. Symbolic verification of lossy channel systems: Application to the bounded retransmission protocol. In Proc. 5th Int. Conf. Tools and Algorithms for the Construction and Analysis of Systems (TACAS’99), LNCS 1579, pages 208–222. Springer, 1999.
2. P. A. Abdulla, A. Bouajjani, and B. Jonsson. On-the-fly analysis of systems with unbounded, lossy FIFO channels. In Proc. 10th Int. Conf. Computer Aided Verification (CAV’98), LNCS 1427, pages 305–318. Springer, 1998.
3. P. A. Abdulla and B. Jonsson. Undecidable verification problems for programs with unreliable channels. Information and Computation, 130(1):71–90, 1996.
4. P. A. Abdulla and B. Jonsson. Verifying programs with unreliable channels. Information and Computation, 127(2):91–101, 1996.
5. P. A. Abdulla and M. Kindahl. Decidability of simulation and bisimulation between lossy channel systems and finite state systems. In Proc. 6th Int. Conf. Theory of Concurrency (CONCUR’95), LNCS 962, pages 333–347. Springer, 1995.
6. D. Brand and P. Zafiropulo. On communicating finite-state machines. Research Report RZ 1053, IBM Zurich Research Lab., June 1981. A short version appears in J.ACM 30(2):323–342, 1983.
7. G. Cécé, A. Finkel, and S. Purushothaman Iyer. Unreliable channels are easier to verify than perfect channels. Information and Computation, 124(1):20–31, 1996.
8. A. Finkel. Decidability of the termination problem for completely specificied protocols. Distributed Computing, 7(3):129–135, 1994.
9. N. Francez. Fairness. Springer, 1986.
10. R. Mayr. Undecidable problems in unreliable computations. In Proc. 4th Latin American Symposium on Theoretical Informatics (LATIN’2000), LNCS 1776, pages 377–386. Springer, 2000.
11. Ph. Schnoebelen. Bisimulation and other undecidable equivalences for lossy channel systems. In Proc. 4th Int. Symp. Theoretical Aspects of Computer Software (TACS’2001), LNCS 2215, pages 385–399. Springer, 2001.
12. Ph. Schnoebelen. Verifying lossy channel systems has nonprimitive recursive complexity. Information Processing Letters, 2002. To appear. Available at http://www.lsv.ens-cachan.fr/˜phs.