Verification of probabilistic systems with faulty communication

Information and Computation

Volumn 202, Issue 2, 2005, Pages 141-165

  Abdulla, P A ^a   Bertrand, N ^b   Rabinovich, A ^c   Schnoebelen, Ph ^b  

^a UPPSALA UNIVERSITY   (Sweden)

^b UNIVERSITÉ PARIS SACLAY   (France)

^c TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; LINEAR SYSTEMS; NETWORK PROTOCOLS; PROBABILITY;

LINEAR-TIME PROPERTY; LOSSY CHANNEL SYSTEMS (LCS); PROBABILISTIC LOSSY CHANNEL SYSTEMS (PLCS); PROBABILISTIC SYSTEMS;

COMMUNICATION CHANNELS (INFORMATION THEORY);

EID: 26444582943     PISSN: 08905401     EISSN: 10902651     Source Type: Journal    
DOI: 10.1016/j.ic.2005.05.008     Document Type: Article

References (21)

1. P.A. Abdulla, and A. Rabinovich Verification of probabilistic systems with faulty communication Proceedings of the 6th International Conference on Foundations of Software Science and Computation Structures (FOSSACS 2003) Lecture Notes in Computer Science vol. 2620 2003 Springer Berlin 39 53
2. P.A. Abdulla, and B. Jonsson Verifying programs with unreliable channels Information and Computation 127 2 1996 91 101
3. P.A. Abdulla, and B. Jonsson Undecidable verification problems for programs with unreliable channels Information and Computation 130 1 1996 71 90
4. P.A. Abdulla, C. Baier, S. Purushothaman Iyer, and B. Jonsson Simulating perfect channels with probabilistic lossy channels Information and Computation 197 1-2 2005 22 40
5. C. Baier, and B. Engelen Establishing qualitative properties for probabilistic lossy channel systems: an algorithmic approach Proceedings of the 5th International AMAST Workshop Formal Methods for Real-Time and Probabilistic Systems (ARTS '99) Lecture Notes in Computer Science vol. 1601 1999 Springer Berlin 34 52
6. N. Bertrand, and Ph. Schnoebelen Model checking lossy channels systems is probably decidable Proceedings of the 6th International Conference on Foundations of Software Science and Computation Structures (FOSSACS 2003) Lecture Notes in Computer Science vol. 2620 2003 Springer Berlin 120 135
7. G.v. Bochmann Finite state description of communication protocols Computer Networks and ISDN Systems 2 1978 361 372
8. D. Brand, and P. Zafiropulo On communicating finite-state machines Journal of the ACM 30 2 1983 323 342
9. G. Cécé, A. Finkel, and S. Purushothaman Iyer Unreliable channels are easier to verify than perfect channels Information and Computation 124 1 1996 20 31
10. C. Courcoubetis, and M. Yannakakis The complexity of probabilistic verification Journal of the ACM 42 4 1995 857 907
11. J.-M. Couvreur, N. Saheb, and G. Sutre An optimal automata approach to LTL model checking of probabilistic systems Proceedings of the 10th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR 2003) Lecture Notes in Artificial Intelligence vol. 2850 2003 Springer Berlin 361 375
12. J. Esparza, A. Kucera, R. Mayr, Model checking probabilistic pushdown automata, in: Proceedings of the 19th IEEE Symposium on Logic in Computer Science (LICS 2004), IEEE Comp. Soc. Press, 2004, pp. 12-21.
13. G. Higman, Ordering by divisibility in abstract algebras, Proc. London Math. Soc. (3) 2 (7) (1952) 326-336.
14. J.G. Kemeny, J.L. Snell, and A.W. Knapp Denumerable Markov Chains 1966 D. Van Nostrand Co. Princeton, NJ, USA
15. P. Panangaden Measure and probability for concurrency theorists Theoretical Computer Science 253 2 2001 287 309
16. D. Peled, and T. Wilke Stutter-invariant temporal properties are expressible without the next-time operator Information Processing Letters 63 5 1997 243 246
17. S. Purushothaman Iyer, and M. Narasimha Probabilistic lossy channel systems Proceedings of the 7th International Joint Conference on Theory and Practice of Software Development (TAPSOFT '97) Lecture Notes in Computer Science vol. 1214 1997 Springer Berlin 667 681
18. A. Rabinovich Quantitative analysis of probabilistic lossy channel systems Proceedings of the 30th Internation Colloquim Automata, Languages, and Programming (ICALP 2003) Lecture Notes in Computer Science vol. 2719 2003 Springer Berlin 1008 1021
19. P. Schnoebelen Verifying lossy channel systems has nonprimitive recursive complexity Information Processing Letters 83 5 2002 251 261
20. W. Thomas Automata on infinite objects J.v. Leeuwen Handbook of Theoretical Computer Science vol. B 1990 Elsevier Science Amsterdam 133 191 Ch. 4
21. M.Y. Vardi, Automatic verification of probabilistic concurrent finite-state programs, in: Proceedings of the 26th IEEE Symposium on Foundations of Computer Science (FOCS '85), 1985, pp. 327-338.