Quantitative analysis of probabilistic lossy channel systems

Information and Computation

Volumn 204, Issue 5, 2006, Pages 713-740

  Rabinovich, Alexander ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COMMUNICATION CHANNELS (INFORMATION THEORY); PROBABILITY;

COMMUNICATION MEDIUM; FIFO BUFFER; FINITE STATE; LOSSY CHANNEL SYSTEMS; PROBABILISTIC LOSSY CHANNEL SYSTEMS; QUALITATIVE MODEL; QUANTITATIVE MODEL CHECKING;

MODEL CHECKING;

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

References (22)

1. P. A. Abdulla, C. Baier, P. Iyer, B. Jonsson, Reasoning about probabilistic lossy channel systems, in: Proceedings of the CONCUR 2000, Lecture Notes in Computer Science, vol. 1877, 2000.
2. P. A. Abdulla, N. Bertrand, A. Rabinovich, Ph. Schnoebelen, Verification of probabilistic systems with faulty communication, Information and Computation 202(2) (2005) 105-228.
3. P. A. Abdulla, B. Jonsson, Undecidable verification problems for programs with unreliable channels, Information and Computation 130(1) (1996) 71-90. (Pubitemid 126411858)
4. P. A. Abdulla, B. Jonsson, Verifying programs with unreliable channels, Information and Computation 127(2) (1996) 91-101. (Pubitemid 126411497)
5. P. A. Abdulla, A. Rabinovich, Verification of probabilistic systems with faulty communication, in: FOSSACS'03, Lecture Notes in Computer Science, vol. 2620, Springer, Berlin, 2003, pp. 39-53.
6. C. Baier, B. Engelen, Establishing qualitative properties for probabilistic lossy channel systems, in: ARTS'99, Lecture Notes in Computer Science, vol. 1601, Springer, Berlin, 1999, pp. 34-52.
7. N. Bertrand, Ph. Schnoebelen, Model checking lossy channels systems is probably decidable, in: FOSSACS'03, Lecture Notes in Computer Science, vol. 2620, Springer, Berlin, 2003, pp. 120-135.
8. D. Brand, P. Zafiropulo, On communicating finite-state machines, Journal of the ACM 2(5) (1983) 323-342.
9. Gérard Cécé, Alain Finkel, S. Purushothaman Iyer, Unreliable channels are easier to verify than perfect channels, Information and Computation 124(1) (1996) 20-31. (Pubitemid 126411491)
10. C. Courcoubetis, M. Yannakakis, The complexityof probabilistic verification, Journal of the ACM 42(1995) 857-907.
11. J. Esparza, A. Kucera, R. Mayr, Model checking probabilistic pushdown automata, LICS04(2004) 12-21.
12. A. Finkel, Ph. Schnoebelen, Well structured transition systems everywhere!, Theoretical Computer Science 256 (1-2) (2001) 63-92. (Pubitemid 32666102)
13. G. Higman, Ordering by divisibility in abstract algebras, Proceedings of the London Mathematical Society 2(1952) 326-336.
14. P. Iyer, M. Narasimha, Probabilistic lossy channel systems, in: Proceedings of the TAPSOFT'97, Lecture Notes in Computer Science, vol. 1214, 1997, pp. 667-681. (Pubitemid 127053382)
15. S. Karlin, A First Course in Stochastic Processes, Academic Press, New York, 1966.
16. J. Kemeny, J. Snell, A. Knapp, Denumerable Markov Chains, D Van Nostad Co., 1966.
17. J. R. Norris, Markov Chains, Cambridge University Press, Cambridge, 1997.
18. A. Rabinovich, Quantitative analysis of probabilistic lossy channel systems, in: ICALP03, Lecture Notes in Computer Sciences, vol. 2719, 2003, pp. 1008-1021.
19. Ph. Schnoebelen, Verifying lossy channel systems has nonprimitive recursive complexity, Information Processing Letters 83(5) (2002) 251-261. (Pubitemid 34704431)
20. Ph. Schnoebelen, The verification of probabilistic lossy channel systems, in: Lecture Notes in Computer Sciences, vol. 2925, Springer, Berlin, 2004, pp. 445-465.
21. W. Thomas, Automata on infinite objects, in: Handbook of Theoretical Computer Science, Volume B: Formal Methods and Semantics, 1990, pp. 133-192.
22. M. Vardi, Probabilistic linear-time model checking: an overview of the automata-theoretic approach, in: Proceedings of the 5th Workshop on Formal Methods for Real-Time and Probabilsitic Systems, Lecture Notes in Computer Science, vol. 1601, 1999, pp. 265-276.