Abstract
In this chapter, we present procedures for checking linear temporal logic and automata specifications of sequential and concurrent probabilistic programs. We follow two different approaches: For LTL and sequential probabilistic programs, our method proceeds in a tableau style fashion, while the remaining procedures are based on automata theory.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Arons, T., Zuck, L., Pnueli, A.: Automatic verification by probabilistic abstraction. In: Submitted to Fossacs 2003 (2003)
Clarke, E.M., Emerson, E.A., Sistla, A.P.: Automatic verification of finite state concurrent systems using temporal logic specifications: A practical approach. In: Conference Record of the Tenth Annual ACM Symposium on Principles of Programming Languages, Austin, Texas, January 24-26, 1983, ACM SIGACT-SIGPLAN, pp. 117–126 (1983)
Clarke, E.M., Wing, J.M.: Formal methods: State of the art and future directions. ACM Computing Surveys 28(4), 626–643 (1996)
Courcoubetis, C., Yannakakis, M.: The complexity of probabilistic verification. Journal of the ACM 42(4), 857–907 (1995)
Hart, S., Sharir, M.: Probabilistic temporal logics for finite and bounded models. In: ACM Symposium on Theory of Computing (STOC 1984), Baltimore, USA, April 1984, pp. 1–13. ACM Press, New York (1984)
Kemeny, J.G., Snell, J.L.: Finite Markov Chains. Van Nostrand Reinhold, New York (1960)
Lehman, D., Rabin, M.O.: On the advantage of free choice: A fully symmetric and fully distributed solution to the dining philosophers problem. In: Proceedings of 10th ACM Symposium of Principles of Programming Languages, Williamsburg, pp. 133–138 (1981)
Lehmann, D., Shelah, S.: Reasoning with time and chance. Information and Control 53(3), 165–198 (1982)
Lichtenstein, O., Pnueli, A.: Checking that finite state concurrent programs satisfy their linear specification. In: Proceedings of the Twelfth Annual ACM Symposium on Principles of Programming Languages, January 1985, pp. 97–107. ACM, New York (1985)
Pnueli, A.: The temporal logic of programs. In: Proceedings of the 18th IEEE Symposium on the Foundations of Computer Science (FOCS 1977), Providence, Rhode Island, October 31–November 2, pp. 46–57. IEEE Computer Society Press, Los Alamitos (1977)
Pnueli, A.: On the extremely fair treatment of probabilistic algorithms. In: Proceedings of the Fifteenth Annual ACM Symposium on Theory of Computing, Boston, Massachusetts, April 25-27, pp. 278–290 (1983)
Pardalos, P., Rajasekaran, S., Reif, J., Rolim, J.: Handbook on Randomized Computing. Kluwer Academic Publishers, Dordrecht (2001)
Pnueli, A., Zuck, L.D.: Probabilistic verification. Information and Computation 103(1), 1–29 (1993)
Queille, J.P., Sifakis, J.: Specification and verification of concurrent systems in CESAR. In: Proceedings of the Fifth International Symposium in Programming. LNCS, vol. 137, pp. 337–351. Springer, Heidelberg (1982)
Safra, S.: On the complexity of omega-automata. In: Proceedings of the 29th Annual Symposium on Foundations of Computer Science, FoCS 1988, Los Alamitos, California, October 1988, pp. 319–327. IEEE Computer Society Press, Los Alamitos (1988)
Moshe, Y.: Vardi. Automatic verification of probabilistic concurrent finite-state programs. In: 26th Annual Symposium on Foundations of Computer Science, Portland, Oregon, October 21-23, pp. 327–338. IEEE, Los Alamitos (1985)
Vardi, M.Y.: Logics for Concurrency. LNCS, vol. 1043, pp. 238–266. Springer, Heidelberg (1996)
Wolper, P.: Temporal logic can be more expressive. Information and Control 56(1/2), 72–99 (1983)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Bollig, B., Leucker, M. (2004). Verifying Qualitative Properties of Probabilistic Programs. In: Baier, C., Haverkort, B.R., Hermanns, H., Katoen, JP., Siegle, M. (eds) Validation of Stochastic Systems. Lecture Notes in Computer Science, vol 2925. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24611-4_4
Download citation
DOI: https://doi.org/10.1007/978-3-540-24611-4_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22265-1
Online ISBN: 978-3-540-24611-4
eBook Packages: Springer Book Archive