Almost-certain eventualities and abstract probabilities in the quantitative temporal logic qTL

Theoretical Computer Science

Volumn 293, Issue 3, 2003, Pages 507-534

  McIver, Annabelle ^a   Morgan, Carroll ^b  

^a MACQUARIE UNIVERSITY   (Australia)

^b UNIVERSITY OF NEW SOUTH WALES   (Australia)

Author keywords

Almost certain correctness; Modal mu calculus; Probabilistic temporal logic; Probabilistic transition systems

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER SCIENCE; PROBABILITY;

ABSTRACT PROBABILITIES;

PROBABILISTIC LOGICS;

EID: 0037427177     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(02)00612-6     Document Type: Conference Paper

References (20)

1. Ben-Ari M., Pnueli A., Manna Z. The temporal logic of branching time. Acta Inform. 20:1983;207-226.
2. Bianco A., de Alfaro L. Model checking of probabilistic and nondeterministic systems. Klarund N., Mukund M., Sohoni M. Foundations of Software Technology and Theoretical Computer Science, Lecture Notes in Computer Sciences. vol. 1026:1995;499-512 Springer, Berlin.
3. Chandy K.M., Misra J. Parallel Program Design - a Foundation. 1988;Addison-Wesley, Reading, MA.
4. R. Cleaveland, B. Steffen, A linear-time model-checking algorithm for the alternation-free modal- μ calculus, in: Proc. CAV, 1991.
5. Courcoubetis C., Yannakakis M. The complexity of probabilistic verification. J. Assoc. Comput. Mach. 42(4):1995;857-907.
6. L. de Alfaro, T. Henzinger, Concurrent ω -regular games, in: Proc. 15th IEEE Symp. Logic in Computer Science (LICS), 141-154, 2000.
7. E. Emerson, Temporal and modal logics, in: J. van Leeuwen (Ed.), Handbook of Theoretical Computer Science, Volume B: Formal Models and Semantics, Elsevier and MIT Press, 1990, Cambridge, MA, pp. 995-1072.
8. Hart S., Sharir M., Pnueli A. Termination of probabilistic concurrent programs. ACM Trans. Prog. Language Systems. 5:1983;356-380.
9. Kozen D. Results on the propositional. μ -calculus Theoret. Comput. Sci. 27:1983;333-354.
10. A. McIver, Quantitative program logic and counting rounds in probabilistic distributed algorithms, in: Proc. 5th Internat. Workshop ARTS '99, Lecture Notes in Computer Science, vol. 1601, Springer, Berlin, 1999.
11. McIver A., Morgan C. Demonic, angelic and unbounded probabilistic choices in sequential programs. Acta Inform. 37:2001;329-354.
12. Morgan C. Proof rules for probabilistic loops. Jifeng H., Cooke J., Wallis P. Proc. BCS-FACS 7th Refinement Workshop, Workshops in Computing. 1996;Springer, Berlin. http://www.springer.co.uk/ewic/workshops/7RW.
13. C. Morgan, A. McIver, A probabilistic temporal calculus based on expectations, in: L. Groves, S. Reeves (Eds.), Proc. Formal Methods Pacific '97, Springer, Singapore, 1997, available at [17].
14. Morgan C., McIver A. An expectation-based model for probabilistic temporal logic. Logic J. IGPL. 7(6):1999;779-804. http://www3.oup.co.uk/igpl/Volume_07/Issue_06; also available via [17].
15. Morgan C., McIver A., Seidel K. Probabilistic predicate transformers. ACM Trans. Prog. Language Systems. 18(3):1996;325-353.
16. Pnueli A., Zuck L. Probabilistic verification. Inform. and Comput. 103(1):1993;1-29.
17. PSG (Probabilistic Systems Group), Collected Reports, http://web.comlab.ox.ac.uk/oucl/research/areas/probs/bibliography.html.
18. Rao J. Reasoning about probabilistic parallel programs. ACM Trans. Prog. Language Systems. 16(3):1994.
19. Sharir M., Pnueli A., Hart S. Verification of probabilistic programs. SIAM J. Comput. 13(2):1984;292-314.
20. M. Vardi, Automatic verification of probabilistic concurrent finite-state programs, in: Proc. 26th IEEE Symp. on Foundations of Computer Science, Portland, 1985, pp. 327-338.