Symbolic verification of communicating systems with probabilistic message losses: Liveness and fairness

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

Volumn 4229 LNCS, Issue , 2006, Pages 212-227

  Baier, C ^a   Bertrand, N ^b   Schnoebelen, Ph ^b  

^a UNIVERSITY OF BONN   (Germany)

^b CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

CHANNEL CAPACITY; DATA TRANSFER; ELECTRONIC MAIL; PROBABILISTIC LOGICS; SCHEDULING; STORAGE ALLOCATION (COMPUTER); COMPUTABILITY AND DECIDABILITY; FORMAL METHODS;

CHANNEL SYSTEMS; LINEAR TIME PROPERTIES; PROBABILISTIC MESSAGE LOSSES; UNRELIABLE COMMUNICATION; FINITE MEMORY; LINEAR-TIME PROPERTIES; MESSAGE LOSS; QUALITATIVE MODEL; SIMPLE PROTOCOL; SYMBOLIC VERIFICATION; TWO WAYS;

COMMUNICATION SYSTEMS; MODEL CHECKING;

EID: 33750572839     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11888116_17     Document Type: Conference Paper

References (32)

1. P. A. Abdulla, C. Baier, S. Purushothaman Iyer, and B. Jonsson. Simulating perfect channels with probabilistic lossy channels. Information and Computation, 197(1-2):22-40, 2005.
2. P. A. Abdulla, N. Bertrand, A. Rabinovich, and Ph Schnoebelen. Verification of probabilistic systems with faulty communication. Information and Computation, 202(2): 141-165, 2005.
3. P. A. Abdulla, A. Bouajjani, and J. d'Orso. Deciding monotonic games. In Proc. 17th Int. Workshop Computer Science Logic (CSL 2003) and 8th Kurt Gödel Coll. (KGL 2003), Vienna, Austria, Aug. 2003, volume 2803 of Lecture Notes in Computer Science, pages 1-14. Springer, 2003.
4. P. A. Abdulla, A. Collomb-Annichini, A. Bouajjani, and B. Jonsson. Using forward reachability analysis for verification of lossy channel systems. Formal Methods in System Design, 25(1):39-65, 2004.
5. P. A. Abdulla and B. Jonsson. Undecidable verification problems for programs with unreliable channels. Information and Computation, 130(1):71-90, 1996.
6. P. A. Abdulla and B. Jonsson. Verifying programs with unreliable channels. Information and Computation, 127(2):91-101, 1996.
7. C. Baier, N. Bertrand, and Ph. Schnoebelen. A note on the attractor-property of infinite-state Markov chains. Information Processing Letters, 97(2):58-63, 2006.
8. C. Baier, N. Bertrand, and Ph. Schnoebelen. On computing fixpoints in well-structured regular model checking, with applications to lossy channel systems. RR cs.CS/0606091, Computing Research Repository, June 2006. Visible at http://arxiv.org/abs/cs.CS/0606091.
9. C. Baier, N. Bertrand, and Ph. Schnoebelen. Verifying nondeterministic probabilistic channel systems against co-regular linear-time properties. RR cs.LO/0511023, Computing Research Repository, April 2006. To be published in ACM Trans. Computational Logic, visible at http://arxiv.org/abs/cs.LO/0511023.
10. 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.
11. C. Baier, B. R. Haverkort, H. Hermanns, J.-P. Katoen, and M. Siegle, editors. Validation of Stochastic Systems - A Guide to Current Research, volume 2925 of Lecture Notes in Computer Science. Springer, 2004.
12. C. Baier and M. Kwiatkowska. Model checking for a probabilistic branching time logic with fairness. Distributed Computing, 11 (3): 125-155, 1998.
13. 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.
14. N. Bertrand and Ph. Schnoebelen. Verifying nondeterministic channel systems with probabilistic message losses. In Ramesh Bharadwaj, editor, Proc. 3rd Int. Workshop on Automated Verification of Infinite-State Systems (AVIS 2004), Barcelona, Spain, Apr. 2004, 2004.
15. D. Brand and P. Zafiropulo. On communicating finite-state machines. Journal of the ACM, 30(2):323-342, 1983.
16. C. Courcoubetis and M. Yannakakis. The complexity of probabilistic verification. Journal of the ACM, 42(4):857-907, 1995.
17. A. Finkel. Decidability of the termination problem for completely specificied protocols. Distributed Computing, 7(3):129-135, 1994.
18. B. Hailpern and S. Owicki. Verifying network protocols using temporal logic. In Proc. NBS/IEEE Symposium on Trends and Applications 1980: Computer Network Protocols, Gaithersburg, MD, May 1980, pages 18-28. IEEE Comp. Soc. Press, 1980.
19. S. Hart, M. Sharir, and A. Pnueli. Termination of probabilistic concurrent programs. ACM Transactions on Programming Languages and Systems, 5(3):356-380, 1983.
20. A. Kučera and Ph. Schnoebelen. A general approach to comparing infinite-state systems with their finite-state specifications. Theoretical Computer Science, 2006. To appear.
21. 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.
22. J. K. Pachl. Protocol description and analysis based on a state transition model with channel expressions. In Proc. 7th IFIP WG6.1 Int. Workshop on Protocol Specification, Testing, and Verification (PSTV '87), Zurich, Switzerland, May 1987, pages 207-219. North-Holland, 1987.
23. P. Panangaden. Measure and probability for concurrency theorists. Theoretical Computer Science, 253(2):287-309, 2001.
24. A. Pnueli. On the extremely fair treatment of probabilistic algorithms. In Proc. 15th ACM Symp. Theory of Computing (STOC '83), Boston, MA, Apr. 1983, pages 278-290. ACM Press, 1983.
25. A. Pnueli and L. D. Zuck. Verification of multiprocess probabilistic protocols. Distributed Computing, 1(1):53-72, 1986.
26. A. Pnueli and L. D. Zuck. Probabilistic verification. Information and Computation, 103(1):l-29, 1993.
27. 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.
28. M. L. Puterman. Markov decision processes: discrete stochastic dynamic programming. John Wiley & Sons, 1994.
29. 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.
30. Ph. Schnoebelen. Verifying lossy channel systems has nonprimitive recursive complexity. Information Processing Letters, 83(5):251-261, 2002.
31. Ph. Schnoebelen. The verification of probabilistic lossy channel systems. In Baier et al. [11], pages 445-465.
32. M. Y. Vardi. Automatic verification of probabilistic concurrent finite-state programs. In Proc. 26th IEEE Symp. Foundations of Computer Science (FOCS '85), Portland, OR, USA, Oct. 1985, pages 327-338. IEEE Comp. Soc. Press, 1985.