The verification of probabilistic lossy channel systems

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

Volumn 2925, Issue , 2004, Pages 445-465

  Schnoebelen, Philippe ^a  

^a CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

FIFO CHANNELS; LOSSY CHANNEL SYSTEMS; PROBABILISTIC LOSSY CHANNEL SYSTEMS; VERIFICATION TECHNIQUES;

ARTIFICIAL INTELLIGENCE;

EID: 23944465568     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24611-4_13     Document Type: Article

References (24)

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), Amsterdam, The Netherlands, Mar. 1999, volume 1579 of Lecture Notes in Computer Science, pages 208-222. Springer, 1999.
2. P. A. Abdulla, C. Baier, S. Purushothaman Iyer, and B. Jonsson. Reasoning about probabilistic lossy channel systems. In Proc. 11th Int. Conf. Concurrency Theory (CONCUR'2000), University Park, PA, USA, Aug. 2000, volume 1877 of Lecture Notes in Computer Science, pages 320-333. Springer, 2000.
3. P. A. Abdulla, K. Čerāns, B. Jonsson, and Yih-Kuen Tsay. Algorithmic analysis of programs with well quasi-ordered domains. Information and Computation, 160(1/2):109-127, 2000.
4. P. A. Abdulla and B. Jonsson. Undecidable verification problems for programs with unreliable channels. Information and Computation, 130(1):71-90, 1996.
5. P. A. Abdulla and B. Jonsson. Verifying programs with unreliable channels. Information and Computation, 127(2):91-101, 1996.
6. 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), Philadelphia, PA, USA, Aug. 1995, volume 962 of Lecture Notes in Computer Science, pages 333-347. Springer, 1995.
7. P. A. Abdulla and A. Rabinovich. Verification of probabilistic systems with faulty communication. In Proc. 6th Int. Conf. Foundations of Software Science and Computation Structures (FOSSACS'2003), Warsaw, Poland, Apr. 2003, volume 2620 of Lecture Notes in Computer Science, pages 39-53. Springer, 2003.
8. C. Baier and B. Engelen. Establishing qualitative properties for probabilistic lossy channel systems: An algorithmic approach. In Proc. 5th Int. AMAST Workshop Formal Methods for Real-Time and Probabilistic Systems (ARTS'99), Bamberg, Germany, May 1999, volume 1601 of Lecture Notes in Computer Science, pages 34-52. Springer, 1999.
9. N. Bertrand and Ph. Schnoebelen. Model checking lossy channels systems is probably decidable. In Proc. 6th Int. Conf. Foundations of Software Science and Computation Structures (FOSSACS'2003), Warsaw, Poland, Apr. 2003, volume 2620 of Lecture Notes in Computer Science, pages 120-135. Springer, 2003.
10. N. Bertrand and Ph. Schnoebelen. Verifying nondeterministic channel systems with probabilistic message losses. In Proc. 3rd Int. Workshop on Automated Verification of Infinite-State Systems (AVIS'04), Barcelona, Spain, Apr. 2004, 2004. To appear.
11. D. Brand and P. Zafiropulo. On communicating finite-state machines. Journal of the ACM, 30(2):323-342, 1983.
12. 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.
13. C. Courcoubetis and M. Yannakakis. The complexity of probabilistic verification. Journal of the ACM, 42(4):857-907, 1995.
14. A. Finkel. Decidability of the termination problem for completely specificied protocols. Distributed Computing, 7(3):129-135, 1994.
15. A. Finkel and Ph. Schnoebelen. Well structured transition systems everywhere! Theoretical Computer Science, 256(1-2):63-92, 2001.
16. G. Higman. Ordering by divisibility in abstract algebras. Proc. London Math. Soc. (3), 2(7):326-336, 1952.
17. R. Mayr. Undecidable problems in unreliable computations. In Proc. 4th Latin American Symposium on Theoretical Informatics (LATIN'2000), Punta del Este, Uruguay, Apr. 2000, volume 1776 of Lecture Notes in Computer Science, pages 377-386. Springer, 2000.
18. B. Masson and Ph. Schnoebelen. On verifying fair lossy channel systems. In Proc. 27th Int. Symp. Math. Found. Comp. Sci. (MFCS'2002), Warsaw, Poland, Aug. 2002, volume 2420 of Lecture Notes in Computer Science, pages 543-555. Springer, 2002.
19. P. Panangaden. Measure and probability for concurrency theorists. Theoretical Computer Science, 253(2):287-309, 2001.
20. S. Purushothaman Iyer and M. Narasimha. Probabilistic lossy channel systems. In Proc. 7th Int. Joint Conf. Theory and Practice of Software Development (TAPSOFT'97), Lille, France, Apr. 1997, volume 1214 of Lecture Notes in Computer Science, pages 667-681. Springer, 1997.
21. A. Rabinovich. Quantitative analysis of probabilistic lossy channel systems. In Proc. 30th Int. Coll. Automata, Languages, and Programming (ICALP'2003), Eindhoven, NL, July 2003, volume 2719 of Lecture Notes in Computer Science, pages 1008-1021. Springer, 2003.
22. Ph. Schnoebelen. Bisimulation and other undecidable equivalences for lossy channel systems. In Proc. 4th Int. Symp. Theoretical Aspects of Computer Software (TACS'2001), Sendai, Japan, Oct. 2001, volume 2215 of Lecture Notes in Computer Science, pages 385-399. Springer, 2001.
23. Ph. Schnoebelen. Verifying lossy channel systems has nonprimitive recursive complexity. Information Processing Letters, 83(5):251-261, 2002.
24. M. Y. Vardi. Probabilistic linear-time model checking: An overview of the automata-theoretic approach. In Proc. 5th Int. AMAST Workshop Formal Methods for Real-Time and Probabilistic Systems (ARTS'99), Bamberg, Germany, May 1999, volume 1601 of Lecture Notes in Computer Science, pages 265-276. Springer, 1999.