Probabilistic lossy channel systems

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

Volumn 1214, Issue , 1997, Pages 667-681

  Iyer, Purush ^a   Narasimha, Mùrali ^a  

^a North Carolina State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

SOFTWARE DESIGN; SPECIFICATION LANGUAGES; SPECIFICATIONS;

COMMUNICATION BUFFER; MODEL OF COMPUTATION; PROBABILISTIC LOSSY CHANNEL SYSTEMS; PROBABILISTIC MODEL CHECKING; PROTOCOL SPECIFICATIONS; REACHABILITY PROBLEM; REALISTIC MODEL; STATE OPERATORS;

MODEL CHECKING;

EID: 84956998252     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0030633     Document Type: Conference Paper

References (17)

1. P. Abdulla and B. Jonsson. Verifying programs with unreliable channels. In Proceedings of the IEEE fiymposium on Logic in Computer Science, 1993.
2. P. Abdulla and B. Jonsson. Undecidable verification problems for programs with unreliable channels. In Proceedings of the Annual International Colloquium on Automata, Languages and Programming, 1994.
3. Bartlett, Scantlebury, and Wilkinson. A note on reliable full-duplex transmissionover half duplex lines. Comm. ACM, 12(5):260-265, 1969.
4. G. Bochmann. Finite st&re description of communication protocols. Comput. Networks, 2:362-372, 1978.
5. D. Brand and P. Zafiropulo. On communicating finite state machines. Journal of the Association of Computing machinery, 30(2):323-342, 1983.
6. G. Cede, A. Finkel, and S. P. Iyer. Unreliable channels are easier to verify than perfect channels. Information and Computation, 124(1):20-31, 1996.
7. C. Courcoubetis and M. Yannakakis. Verifying temporal properties of finite-state probabilistic programs. In Proc. 1988 IEEE Syrup. on the Foundations of Comp. Sci., 1988.
8. M. Diaz, J.P. Ansart, P. Azema, and V. Chari. The Formal Description Technique Estelle. North-Holland, Amsterdam, 1989.
9. E. A. Emerson and J. Y. Halpern. "sometimes" and "not never" revisited: On branching time versus linear time temporal logic. JACM, 33(1):151-178, 1986.
10. A. Finkel. Decidability of the termination problem form completely specified protocols. Dist. Comput., 7:129-135, 1994.
11. S. Hart, M. Sharir, and A. Pnueli. Termination of probabilistic concurrent program. A CM Transactions on Programming Languages and Systems, 5(3):356-380, July 1983.
12. J. G. Kemeny, J. L. Snell, and A. W. Knapp. Denumerable Markov Chains. Van Nostrand, New Jersey, 1966.
13. E. M. Clarke, M. C. Browne and O. Griimberg. Characterizing finite kripke structures in propositional temporal logic. Journal of TCS, 59:115-131, 1988.
14. W. Peng and S. Purushothaman. Data flow analysis of communicating finite state machines. A CM Transactions on Programming Languages and Systems, 13(3):399-442, July 1991.
15. M. Y. Vardi. Automatic verification of probabilistic concurrent finite-state programs. In IEEE Symposium on Foundations of Computer Science, pages 327-338, 1985.
16. P. Wolper, M. Vardi, and A. Sistla. Reasoning about infinite computation paths. In 1EEE Symposium on Foundations of Computer Science (FOCS), 1983.
17. CCITT Recommendation Z.100. Specification and description language sdl. Blue Book Vols X.1-X.5, ITU General Secreterait, Geneva, 1989.