Verification of probabilistic systems with faulty communication

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

Volumn 2620, Issue , 2003, Pages 39-53

  Abdulla, Parosh Aziz ^a   Rabinovich, Alexander ^b  

^a UPPSALA UNIVERSITY   (Sweden)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COMMUNICATION CHANNELS (INFORMATION THEORY); COMPUTABILITY AND DECIDABILITY; COMPUTATION THEORY; PROBABILITY;

COMMUNICATION MEDIUM; FIFO BUFFER; FINITE STATE; LOSSY CHANNEL SYSTEMS; MODEL CHECKING PROBLEM; PROBABILISTIC LOSSY CHANNEL SYSTEMS; VERIFICATION OF PROBABILISTIC SYSTEMS;

MODEL CHECKING;

EID: 35248854481     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36576-1_3     Document Type: Article

References (11)

1. th Int. Conf. on Concurrency Theory, volume 1877 of Lecture Notes in Computer Science, 2000.
2. Parosh Aziz Abdulla and Bengt Jonsson. Undecidable verification problems for programs with unreliable channels. Information and Computation, 130(1):71-90, 1996.
3. Parosh Aziz Abdulla and Bengt Jonsson. Verifying programs with unreliable channels. Information and Computation, 127(2):91-101, 1996.
4. C. Baier and B. Engelen. Establishing qualitative properties for probabilistic lossy channel systems. In Katoen, editor, ARTS'99, Formal Methods for Real-Time and Probabilistic Systems, 5th Int. AMAST Workshop, volume 1601 of Lecture Notes in Computer Science, pages 34-52. Springer Verlag, 1999.
5. G. V. Bochman. Finite state description of communicating protocols. Computer Networks, 2:361-371, 1978.
6. N. Bertrand and Ph. Schnoebelen. Model checking lossy channels systems is probably decidable. In Proc. FOSSACS03, Conf. on Foundations of Software Science and Computation Structures, 2003.
7. D. Brand and P. Zafiropulo. On communicating finite-state machines. Journal of the ACM, 2(5):323-342, April 1983.
8. Gérard Cécé, Alain Finkel, and S. Purushothaman Iyer. Unreliable channels are easier to verify than perfect channels. Information and Computation, 124(1):20-31, 10 January 1996.
9. G. Higman. Ordering by divisibility in abstract algebras. Proc. London Math. Soc., 2:326-336, 1952.
10. J.G. Kemeny, J.L. Snell, and A.W. Knapp. Denumerable Markov Chains. D Van Nostad Co., 1966.
11. W. Thomas. Automata on infinite objects. In Handbook of Theoretical Computer Science, Volume B: Formal Methods and Semantics, pages 133-192, 1990.