On the verification of qualitative properties of probabilistic processes under fairness constraints

Information Processing Letters

Volumn 66, Issue 2, 1998, Pages 71-79

  Baier, Christel ^a   Kwiatkowska, Marta ^b  

^a UNIVERSITY OF MANNHEIM   (Germany)

^b UNIVERSITY OF BIRMINGHAM   (United Kingdom)

Author keywords

Fairness; Probabilistic processes; Verification

Indexed keywords

CONSTRAINT THEORY; SPECIFICATIONS;

VERIFICATION;

PROBABILISTIC LOGICS;

EID: 0032048230     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0020-0190(98)00038-6     Document Type: Article

References (32)

1. R. Alur, C. Courcoubetis, D. Dill, Model-checking for probabilistic real-time systems, in: Proc. ICALP'91, Lecture Notes in Comput. Sci. 510, Springer, Berlin, 1991, pp. 115-127.
2. L. de Alfaro, Formal verification of performance and reliability of real-time systems, Technical Report, Stanford University, 1996.
3. C. Baier, M.Z. Kwiatkowska, Model checking for a probabilistic branching time logic with fairness, Distrib. Comput., to appear.
4. C. Baier, M.Z. Kwiatkowska, Domain equations for probabilistic processes, in: Proc. EXPRESS'97, Electronic Notes in Theoret. Comput. Sci. 7, 1997. URL: http://www.elsevier.nl/ locate/entcs/volume7.html.
5. A. Bianco, L. de Alfaro, Model checking of probabilistic and nondeterministic systems, in: Proc. Foundations of Software Technology and Theoretical Computer Science, Lecture Notes in Comput, Sci. 1026. Springer, Berlin, 1995, pp. 499-513.
6. L. Christoff, I. Christoff, Reasoning about safety and liveness properties for probabilistic processes, in: Proc. Foundations of Software Technology and Theoretical Computer Science, Lecture Notes in Comput. Sci 652, Springer, Berlin, 1992, pp. 342-355.
7. C. Courcoubetis, M. Yannakakis, Verifying temporal properties of finite-state probabilistic programs, in: Proc. FOCS'88, ACM Press, 1988, pp. 338-345.
8. N. Francez, Fairness, Springer, New York, 1988.
9. A. Giacalone, C. Jou, S. Smolka, Algebraic reasoning for probabilistic concurrent systems, in: Proc. IFIP TC2 Working Conference on Programming Concepts and Methods, 1990.
10. R. van Glabbeek, S. Smolka, B. Steffen, Reactive, generative, and stratified models for probabilistic processes, Inform. and Comput. 121 (1) (1995) 59-80.
11. R. van Glabbeek, S. Smolka, B. Steffen, C. Tofts, Reactive, generative, and stratified models for probabilistic processes, in: Proc. LICS'90, IEEE CS Press, 1990, pp. 130-141.
12. H. Hansson, Time and Probability in Formal Design of Distributed Systems, Real-Time Safety Critical Systems, Elsevier Science, Amsterdam, 1994.
13. H. Hansson, B. Jonsson, A calculus for communicating systems with time and probabilities, in: Proc. 11th IEEE Symposium on Real Time Systems, 1990.
14. H. Hansson, B. Jonsson, A logic for reasoning about time and probability, Formal Aspects of Computing 6 (1994) 512-535.
15. S. Hart, M. Sharir, Probabilistic temporal logic for finite and bounded models, in: Proc. 16th ACM Symposium on Theory of Computing, 1984, pp. 1-13.
16. S. Hart, M. Sharir, A. Pnueli, Termination of probabilistic concurrent programs, ACM Trans. Programming Languages 5 (1983) 356-380.
17. B. Jonsson, W. Yi, Compositional testing preorders for probabilistic processes, in: Proc. LICS'95, IEEE CS Press. 1995, pp. 431-443.
18. M. Kwiatkowska, Survey of fairness notions, Inform. and Software Technol. 31 (7) (1989) 371-386.
19. K. Larsen, A. Skou, Bisimulation through probabilistic testing, Inform. and Comput. 94 (1991) 1-28.
20. K. Larsen, A. Skou, Compositional verification of probabilistic processes, in: Proc. CONCUR'92, Lecture Notes in Comput. Sci. 630, Springer, Berlin, 1992, pp. 456-471.
21. D. Lehmann, A. Pnueli, J. Stavi, Impartiality, justice and fairness: the ethics of concurrent termination, in: Proc. ICALP'81, Lecture Notes in Comput. Sci. 115. Springer, Berlin, 1981.
22. D. Lehmann, S. Shelah, Reasoning with time and chance, Inform. and Control 53 (1982) 165-198.
23. O. Lichtenstein, A. Pnueli, Checking that finite state concurrent programs satisfy their linear specification, in: Proc. 12th ACM Symp. on Principles of Programming Languages, 1985. pp. 97-107.
24. Z. Manna, A. Pnueli, Temporal Verification of Reactive Systems: Safety, Springer,. Berlin, 1995.
25. A. Pnueli, On the extremely fair treatment of probabilistic algorithms, in: Proc. 15th ACM Symposium on Theory of Computing, 1983.
26. A. Pnueli, L. Zuck, Verification of multiprocess probabilistic protocols, Distrib. Comput. 1 (1) (1986) 53-72.
27. A. Pnueli, L. Zuck, Probabilistic verification, Inform. and Comput. 103 (1993) 1-29.
28. J. Queille, J. Sifakis, Fairness and related properties in transition systems - a temporal logic to deal with fairness, Acta Inform. 19 (1983) 195-220.
29. R. Segala, Modeling and verification of randomized distributed real-time systems, Ph.D. Thesis, Massachusetts Institute of Technology, Cambridge, MA, 1995.
30. C. Tofts, Processes with probabilities, Formal Aspects of Comput. 6 (5) (1994).
31. M. Vardi, Automatic verification of probabilistic concurrent finite-state programs, in: Proc. FOCS'85, ACM Press, 1985, pp. 327-338.
32. W. Yi, K. Larsen, Testing probabilistic and nondeterministic processes, in: Proc. Protocol Specification, Testing and Verification XII, Elsevier Science, North-Holland, Amsterdam, 1992, pp. 47-61.