Reasoning about probabilistic lossy channel systems

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

Volumn 1877 LNCS, Issue , 2000, Pages 320-333

  Abdulla, Parosh ^a   Baier, Christel ^b   Iyer, Purushothaman ^c   Jonsson, Bengt ^a  

^a UPPSALA UNIVERSITY   (Sweden)

^b UNIVERSITY OF BONN   (Germany)

^c North Carolina State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS; MARKOV PROCESSES; PROBABILITY;

CORRECTNESS PROPERTIES; DEGREE OF CONFIDENCE; FINITE STATE PROCESS; INFINITE STATE SYSTEMS; NON-PROBABILISTIC; PERFECT CHANNELS; PROBABILISTIC LOSSY CHANNEL SYSTEMS; SAFETY PROPERTY;

MARKOV PROCESSES; COMMUNICATION CHANNELS (INFORMATION THEORY);

EID: 84885197071     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44618-4_24     Document Type: Conference Paper

References (8)

1. Parosh Aziz Abdulla and Bengt Jonsson. Undecidable verification problems for programs with unreliable channels. Information and Computation, 130(1): 71-90, 1996. A Preliminary Version appeared in Proc. ICALP '94, LNCS 820.
2. st IEEE Int. Symp. on Logic in Computer Science.
3. 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.
4. D. Brand and P. Zafiropulo. On communicating finite-state machines. Journal of the ACM, 2(5): 323-342, April 1983.
5. Rajiv Gupta, Scott A. Smolka, and Shaji Bhaskar. On randomizatioon in sequential and distributed algorithms. ACM Computing Surveys, 26(1): 7-86, March 1994.
6. Purush Iyer and Murali Narasimha. Probabilistic lossy channel systems. In Michel Bidoit and Max Dauchet, editors, TAPSOFT'97: Theory and Practice of Software Development, Volume 1214 of Lecture Notes in Computer Science, pages 667-681. Springer-Verlag, 1997.
7. J. G. Kemeny, J. L. Snell, and A. W. Knapp. Denumerable Markov Chains. Van Nostrand, New Jersey, 1966.
8. M. O. Rabin. Probabilistic algorithms. In J. F. Traub, editor, Algorithms and Com-plexity: New Directi ons and Recent Results, pages 21-39. Academic Press, 1976. This classic paper on probabilistic algorithms features algorithms for primality testing and nearest neighbors.