From fairness to chance

Electronic Notes in Theoretical Computer Science

Volumn 22, Issue , 1999, Pages 55-87

  De Alfaro, Luca ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; ALGORITHMS; COMPUTER SIMULATION; PROBABILITY; RANDOM PROCESSES; SCHEDULING; SEMANTICS;

FINITE-STATE SYSTEMS; MATHEMATICAL ABSTRACTION; PROBABILISTIC CHOICES; SYNCHRONOUS COMPOSITION;

MATHEMATICAL MODELS;

EID: 0009629465     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(05)80597-3     Document Type: Conference Paper

References (32)

1. Alur R., Henzinger T.A. Finitary fairness. Proc. 9th IEEE Symp. Logic in Comp. Sci. 1994;52-61
2. Bianco A., de Alfaro L. Model checking of probabilistic and nondeterministic systems. Found, of Software Tech. and Theor. Comp. Sci., volume 1026 of Lect. Notes in Comp. Sci. 1995;499-513 Springer-Verlag
3. D.P. Bertsekas. Dynamic Programming and Optimal Control. Athena Scientific, 1995. Volumes I and II.
4. Bertsekas D.P., Tsitsiklis J.N. An analysis of stochastic shortest path problems. Math. of Op. Res. 16:(3):1991;580-595
5. Courcoubetis C., Yannakakis M. Verifying temporal properties of finite-state probabilistic programs. Proc. 29th IEEE Symp. Found, of Comp. Sci. 1988;338-354
6. Courcoubetis C., Yannakakis M. Markov decision processes and regular events. Proc. 17th Int. Colloq. Aut. Lang. Prog., volume 443 of Lect. Notes in Comp. Sci. 1990;336-349 Springer-Verlag
7. Courcoubetis C., Yannakakis M. The complexity of probabilistic verification. J. ACM. 42:(4):1995;857-907
8. L. de Alfaro. Formal Verification of Probabilistic Systems. PhD thesis, Stanford University, 1997. Technical Report STAN-CS-TR - 98-1601.
9. de Alfaro L. Temporal logics for the specification of performance and reliability. In Proc. of Symp. on Theor. Asp. of Comp. Sci., volume 1200 of Lect. Notes in Comp. Sci. 1997;165-176 Springer-Verlag
10. de Alfaro L. How to specify and verify the long-run average behavior of probabilistic systems. Proc. 13th IEEE Symp. Logic in Comp. Sci. 1998;454-465
11. de Alfaro L. Stochastic transition systems. In CONCUR′98: Concurrency Theory. 9th Int. Conf, Lect. Notes in Comp. Sci. 1998;Springer-Verlag
12. de Alfaro L. Computing minimum and maximum reachability times in probabilistic systems. To appear in CONCUR′99: Concurrency Theory. 10th Int. Conf., Lect. Notes in Comp. Sci. 1999;Springer-Verlag
13. de Alfaro, T.A. Henzinger L., Kupferman O. Concurrent reachability games. Proc. 39th IEEE Symp. Found, of Comp. Sci. 1998
14. Derman C. Finite State Markovian Decision Processes. 1970;Acedemic Press
15. Francez N. Fairness. 1986;Springer-Verlag
16. Hart S., Sharir M., Pnueli A. Termination of probabilistic concurrent programs. ACM Trans. Prog. Lang. Sys. 5:(3):1983;356-380
17. Kwiatkowska M., Baier C. Model checking for a probabilistic branching time logic with fairness. Technical Report CSR-96-12. 1996;. University of Birmingham
18. Kemeny J.G., Snell J.L., Knapp A.W. Denumerable Markov Chains. 1966;D. Van Nostrand Company
19. Kwiatkowska M. Survey of fairness notions. Information and Software Technology. 31:(7):1989;371-386
20. Lehmann D., Pnueli A., Stavi J. Impartiality, justice and fairness: the ethics of concurrent termination. In Proc. 8th Int. Colloq. Aut. Lang. Prog., volume 115 of Led. Notes in Comp. Sci. 1981;264-277 Springer-Verlag
21. Manna Z., Pnueli A. The Temporal Logic of Reactive and Concurrent Systems: Specification. 1991;Springer-Verlag, New York
22. Pnueli A. On the extremely fair treatment of probabilistic algorithms. Proc. 15th ACM Symp. Theory of Comp. 1983;278-290
23. Pnueli A., Zuck L. Probabilistic verification by tableaux. Proc. First IEEE Symp. Logic in Comp. Sci. 1986;322-331
24. Pnueli A., Zuck L.D. Probabilistic verification. Information and Computation. 103:1993;1-29
25. Rabin M.O. Probabilistic automata. Information and Computation. 6:1963;230-245
26. Ross S.M. Average cost semi-Markov decision processes. J. Appl. Prob. 7:1970;649-656
27. Safra S. On the complexity of ω-automata. Proc. 29th IEEE Symp. Found, of Comp. Sci. 1988
28. R. Segala. Modeling and Verification of Randomized Distributed Real-Time Systems. PhD thesis, MIT, 1995. Technical Report MIT/LCS/TR - 676.
29. Segala R., Lynch N.A. Probabilistic simulations for probabilistic processes. CONCUR′94: Concurrency Theory. 5th Int. Conf., volume 836 of Lect. Notes in Comp. Sci. 1994;481-496 Springer-Verlag
30. Thomas W. Automata on infinite objects. van Leeuwen J. Handbook of Theoretical Computer Science volume B, chapter 4. 1990;135-191 Elsevier Science Publishers (North-Holland), Amsterdam
31. Vardi M.Y. Automatic verification of probabilistic concurrent finite-state systems. Proc. 26th IEEE Symp. Found, of Comp. Sci. 1985;327-338
32. Vardi M. Infinite games against nature. 1995