Verifying nondeterministic probabilistic channel systems against ω-regular linear-time properties

ACM Transactions on Computational Logic

Volumn 9, Issue 1, 2007, Pages

  Baier, Christel ^a,c   Bertrand, Nathalie ^b,d   Schnoebelen, Philippe ^b,d  

^a UNIVERSITY OF BONN   (Germany)

^b CNRS   (France)

^c Institut für Informatik III   (Germany)

^d UNIVERSITÉ PARIS SACLAY   (France)

Author keywords

Communication protocols; Lossy channels; Markov decision processes; Probabilistic models

Indexed keywords

LOSSY CHANNEL SYSTEMS (LCS); MARKOV DECISION PROCESSES; PROBABILISTIC MODELS; UNBOUNDED FIFO CHANNELS;

AUTOMATA THEORY; HIDDEN MARKOV MODELS; LINEAR PROGRAMMING; NETWORK PROTOCOLS; PROBLEM SOLVING;

CHANNEL ESTIMATION;

EID: 37049008643     PISSN: 15293785     EISSN: 1557945X     Source Type: Journal    
DOI: 10.1145/1297658.1297663     Document Type: Article

References (30)

1. ABDULLA, P. A., BAIER, C., PURUSHOTHAMAN IYER, S., AND JONSSON, B. 2005a. Simulating perfect channels with probabilistic lossy channels. Inform. Comput. 197, 1-2, 22-40.
2. ABDULLA, P. A., BERTRAND, N., RABINOVICH, A., AND SCHNOEBELEN, PH. 2005b. Verification of probabilistic systems with faulty communication. Inform. Comput. 202, 2, 141-165.
3. ABDULLA, P. A., ČERANS, K, JONSSON, B., AND TSAY, Y.-K. 2000. Algorithmic analysis of programs with well quasi-ordered domains. Inform. Comput. 160, 1/2, 109-127.
4. ABDULLA, P. A., COLLOMB-ANNICHINI, A., BOUAJJANI, A., AND JONSSON, B. 2004. Using forward reachability analysis for verification of lossy channel systems. Form. Methods Syst. Design 25, 1, 39-65.
5. ABDULLA, P. A. AND JONSSON, B. 1996a. Undecidable verification problems for programs with unreliable channels. Inform. Comput. 130, 1, 71-90.
6. ABDULLA, P. A. AND JONSSON, B. 1996b. Verifying programs with unreliable channels. Inform. Comput. 127, 2, 91-101.
7. BAIER, C., BERTRAND, N, AND SCHNOEBELEN, PH. 2006. A note on the attractor-property of infinitestate Markov chains. Inform. Proces. Lett. 97, 2, 58-63.
8. BAIER, C. AND ENGELEN, B. 1999. Establishing qualitative properties for probabilistic lossy channel systems: An algorithmic approach. In Proceedings of the 5th International AMAST Workshop Formal Methods for Real-Time and Probabilistic System,s (ARTS), Bamberg, Germany. Lecture Notes in Computer Science, vol. 1601. Springer, 34-52.
9. BERTRAND, N. AND SCHNOEBELEN, PH. 2003. Model checking lossy channels systems is probably decidable. In Proceedings of the 6th International Conference on Foundations of Software Science and Computation Structures (FOSSACS), Warsaw, Poland. Lecture Notes in Computer Science, vol. 2620. Springer, 120-135.
10. BERTRAND, N. AND SCHNOEBELEN, PH. 2004. Verifying nondeterministic channel systems with probabilistic message losses. In Proceedings of the 3rd International Workshop on Automated Verification of Infinite-State Systems (AVIS), 2004. Barcelona, Spain. R. Bharadwaj, Ed.
11. BRAND, D. AND ZAFIROPULO, P. 1983. On communicating finite-state machines. J. ACM 30, 2, 323-342.
12. CÉCÉ, G., FINKEL, A., AND PURUSHOTHAMAN IYER, S. 1996. Unreliable channels are easier to verify than perfect channels. Inform. Comput. 124, 1, 20-31.
13. COURCOUBETIS, C. AND YANNAKAKIS, M. 1995. The complexity of probabilistic verification. J. ACM 42, 4, 857-907.
14. EMERSON, E. A. 1990. Temporal and modal logic. In Handbook of Theoretical Computer Science, J. v. Leeuwen, Ed. Vol. B. Elsevier Science, Chap. 16, 995-1072.
15. FINKEL, A. 1994. Decidability of the termination problem for completely specificied protocols. Distrib. Comput. 7, 3, 129-135.
16. FINKEL, A. AND SCHNOEBELEN, PH. 2001. Well-structured transition systems everywhere! Theoret. Comput. Sci. 256, 1-2, 63-92.
17. GRÄDEL, E., THOMAS, W., AND WILKE, T., Eds. 2002. Automata, Logics, and Infinite Games: A Guide to Current Research. Lecture Notes in Computer Science, vol. 2500. Springer.
18. KEMENY, J. G., SNELL, J. L., AND KNAPP, A. W 1966. Denumerable Markov Chains. D. Van Nostrand Co., Princeton, NJ.
19. MASSON, B. AND SCHNOEBELEN, PH. 2002. On verifying fair lossy channel systems. In Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science (MFCS). Warsaw, Poland. Lecture Notes in Computer Science, vol. 2420. Springer, 543-555.
20. MAYR, R. 2003. Undecidable problems in unreliable computations. Theoret. Comput. Sci. 297, 1-3, 337-354.
21. PACHL, J. K. 1987. Protocol description and analysis based on a state transition model with channel expressions. In Proceedings of the 7th IFIP WG6.1 International Workshop on Protocol Specification, Testing, and Verification (PSTV). Zurich, Switzerland. North-Holland, 207-219.
22. PANANGADEN, P. 2001. Measure and probability for concurrency theorists. Theoret. Comput. Sci. 253, 2, 287-309.
23. PURUSHOTHAMAN IYER, S. AND NARASIMHA, M. 1997. Probabilistic lossy channel systems. In Proceed-ings of the 7th International Joint Conference on Theory and Practice of Software Development (TAPSOFT). Lille, France. Lecture Notes in Computer Science, vol. 1214. Springer, 667-681.
24. PUTERMAN, M. L. 1994. Markov Decision Processes: Discrete Stochastic Dynamic Programming. John Wiley & Sons.
25. RABINOVICH, A. 2003. Quantitative analysis of probabilistic lossy channel systems. In Proceedings of the 30th International Coll. Automata, Languages, and Programming (ICALP). Eindhoven, NL. Lecture Notes in Computer Science, vol. 2719. Springer, 1008-1021.
26. SCHNOEBELEN, PH. 2001. Bisimulation and other undecidable equivalences for lossy channel systems. In Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software (TACS). Sendai, Japan. Lecture Notes in Computer Science, vol. 2215. Springer, 385-399.
27. SCHNOEBELEN, PH. 2002. Verifying lossy channel systems has nonprimitive recursive complexity. Inform. Proces. Lett. 83, 5, 251-261.
28. SCHNOEBELEN, PH. 2004. The verification of probabilistic lossy channel systems. In Validation of Stochastic Systems-A Guide to Current Research, C. Baier et al. Eds. Lecture Notes in Computer Science, vol. 2925. Springer, 445-465.
29. VARDI, M. Y. 1985. Automatic verification of probabilistic concurrent finite-state programs. In Proceedings of the 26th Symposium on Foundations of Computer Science (FOCS). Portland, OR. IEEE Computer Society Press, 327-338.
30. VARDI, M. Y. 1999. Probabilistic linear-time model checking: An overview of the automatatheoretic approach. In Proceedings of the 5th International AMAST Workshop Formal Methods for Real-Time and Probabilistic System,s (ARTS). Bamberg, Germany. Lecture Notes in Computer Science, vol. 1601. Springer, 265-276.