Probabilistic temporal logics via the modal mu-calculus

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

Volumn 1578, Issue , 1999, Pages 288-305

  Narasimha, Murali ^a   Cleaveland, Rance ^b   Iyer, Purush ^a  

^a North Carolina State University   (United States)

^b Stony Brook University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; COMPUTER CIRCUITS; MODEL CHECKING; SEMANTICS;

FINITE STATE; LABELED TRANSITION SYSTEMS; MODAL MU CALCULUS; MODEL CHECKING ALGORITHM; MODEL CHECKING PROBLEM; NON-PROBABILISTIC; PROBABILISTIC TEMPORAL LOGIC; SYSTEM STATE;

TEMPORAL LOGIC;

EID: 84937687275     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-49019-1_20     Document Type: Conference Paper

References (27)

1. A. Aziz, V. Singhal, F. Balarin, R.K. Brayton, and A.L. Sangiovanni-Vincentelli. It usually works: The temporal logic of stochastic systems. In Proc of Computer Aided Verification’95. Springer-Verlag, July 1995.
2. A. Bianco and L. de Alfaro. Model-checking of probabilistic and non- deterministic systems. In Proc. Foundations of software technology and theoretical computer science, Lecture notes in Computer science, vol 1026, pages 499-513. Springer-Verlag, December 1995.
3. Rastislav Bodik, Rajiv Gupta, and Mary Lou Soffa. Complete removal of redundant computations. ACM SIGPLAN Notices, 33(5): 1-14, May 1998.
4. Thomas Ball and James R. Larus. Optimally profiling and tracing programs. In Ravi Sethi, editor, Proceedings of the 19th Annual Symposium on Principles of Programming Languages, pages 59-70, Albuquerque, NM, January 1992. ACM Press.
5. E.M. Clarke, E.A. Emerson, and A.P. Sistla. Automatic verification of finite- state concurrent systems using temporal logic specifications. ACM Transactions on Programming Languages and Systems, 8(2):244-263, April 1986.
6. Ranee Cleaveland. Tableau-based model checking in the propositional mu- calculus. Acta Informatica, 27(8):725-747, 1990.
7. C. Courcoubetis and M. Yannakakis. Verifying temporal properties of finite- state probabilistic programs. In Proc. 1988 IEEE Symp. on the Foundations of Comp. Sci., 1988.
8. 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.
9. E. Allen Emerson and Chin-Laung Lei. Efficient model-checking in fragments of the propositional mu-calculus. In Proceedings 1st Annual IEEE Symp. on Logic in Computer Science, LLCS’86, Cambridge, MA, USA, 16-18 June 1986, pages 267-278. IEEE Computer Society Press, Los Alamitos, CA, 1986.
10. H. Hansson. Time and Probability in Formal Design of Distributed Systems. Elsevier, 1994.
11. Michael Huth and Marta Kwiatkowska. Quantitative analysis and model checking. In Proceedings, Twelth Annual IEEE Symposium on Logic in Computer Science, pages 111-122, Warsaw, Poland, 29 June-2 July 1997. IEEE Computer Society Press.
12. M. Hennessy and R. Milner. Algebraic laws for nondeterminism and concurrency. Journal of the Association of Computing Machinery, 32(1):137-161, 1985.
13. D. Kozen. Results on the propositional /t-calculus. Theoretical Computer Science, 27(l):333-354, 1983.
14. J. G. Kemeny, J. L. Snell, and A. W. Knapp. Denumerable Markov Chains. Van Nostrand, New Jersey, 1966.
15. K. G. Larsen and A. Skou. Bisimulation through probabilistic testing. Information and Computation, 94, 1991.
16. McMillan, K. L. Symbolic Model Checking. Kluwer Academic Publishers, Norwell Massachusetts, 1993.
17. Azaria Paz. Introduction to Probablistic Automata. Academic Press, New York, 1971.
18. A. Philippou, O. Sokolksy, R. Cleaveland, I. Lee, and S. Smolka. Probabilistic resource failure in real-time process algebra. 1998. To appear in Proceedings of CONCUR.
19. Amir Pnueli and Lenore D. Zuck. Probabilistic verification. Information and Computation, 103(1): 1-29, March 1993.
20. G. Ramalingam. Data flow frequency analysis. In Proceedings of the ACM SIGPIAN’96 Conference on Programming Language Design and Implementation, pages 267-277, Philadelphia, Pennsylvania, 21-24 May 1996.
21. David A. Schmidt. Data flow analysis is model checking of abstract interpretation. In Conference Record of POPL’98: The 25th ACM SIGPLAN- SIGACT Symposium on Principles of Programming Languages, pages 38-48, San Diego, California, 19-21 January 1998.
22. R. Segala. A compositional trace-based semantics for probabilistic automata. In CONCUR95, pages 324-338, 1995.
23. A. P. Sistla, A. Emerson, and C. Jutla. Model checking in fragments of the mu-calculus. In Proceedings of the International Conference on Computer Aided Verification, volume Vol 697 of LNCS, pages 385-396. Springer-Verlag, June 1993.
24. Bernhard Steffen. Data flow analysis as model checking. Lecture Notes in Computer Science, vol. 526, 1991.
25. C. Stirling. Modal and Temporal Logics, volume 2 of Handbook of Logic in Computer Science, pages 478-551. Oxford Science Press, 1992.
26. M. Y. Vardi. Automatic verification of probabilistic concurrent finite-state programs. In IEEE Symposium on Foundations of Computer Science, pages 327-338, 1985.
27. Rob van Glabbeek, Scott A. Smolka, Bernhard Steffen, and Chris M. N. Tofts. Reactive, generative, and stratified models of probabilistic processes. In Proc. of Fifth Annual IEEE Symposium on Logic in Computer Science, pages 130-141. IEEE Computer Society Press, June 1990.