Temporal logics and model checking for fairly correct systems

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2006, Pages 389-398

  Varacca, Daniele ^a   Völzer, Hagen ^b  

^a IMPERIAL COLLEGE LONDON   (United Kingdom)

^b UNIVERSITY OF LÜBECK   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CONCURRENT ENGINEERING; MODEL CHECKING; PROBABILISTIC LOGICS; SYSTEMS ANALYSIS; TOPOLOGY;

PROBABILISTIC LARGENESS; TEMPORAL SPECIFICATION; TOPOLOGICAL LARGENESS;

TEMPORAL LOGIC;

EID: 34547298738     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/LICS.2006.49     Document Type: Conference Paper

References (29)

1. B. Alpern and F. B. Schneider. Defining liveness. Inf. Proc. Letters, 21:181-185, Oct. 1985.
2. R. Alur, C. Courcoubetis, and D. L. Dill. Model-checking for probabilistic real-time systems (extended abstract). Proc. ICALP, LNCS 510, pp. 115-126. Springer, 1991.
3. R. Alur and T. A. Henzinger. Local liveness for compositional modeling of fair reactive systems. In Proc. CAV, LNCS 939, pp. 166-179. Springer, 1995.
4. B. Aminof, T. Ball, and O. Kupferman. Reasoning about systems with transition fairness. In Proc. LPAR, LNCS 3452, pp. 194-208. Springer, 2004.
5. K. R. Apt, N. Francez, and S. Katz. Appraising fairness in languages for distributed programming. Distr. Comput., 2:226-241, 1988.
6. 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. CAV, LNCS 939, pp. 155-165. Springer, 1995.
7. R. Ben-Eliyahu and M. Magidor. A temporal logic for proving properties of topologically general executions. Inf. and Comp., 124(2):127-144, 1996.
8. D. Berwanger, E. Grädel, and S. Kreutzer. Once upon a time in the west - determinacy, definability, and complex-ity of path games. In Proc. LPAR, LNAI 2850, pp. 229-243, 2003.
9. E. Y. Chang, Z. Manna, and A. Pnueli. Characterization of temporal property classes. In Proc. ICALP, LNCS 623, pp. 474-486. Springer, 1992.
10. E. M. Clarke, E. A. Emerson, and A. P. Sistla. Automatic verification of finite-state concurrent systems using temporal logic specifications. ACM Trans. Program. Lang. Syst., 8(2):244-263, 1986.
11. C. Courcoubetis and M. Yannakakis. The complexity of probabilistic verification. J. ACM, 42(4):857-907, 1995.
12. E. A. Emerson and C.-L. Lei. Modalities for model checking: Branching time strikes back. In Proc. POPL, pp. 84-96, 1985.
13. F. E. Fich and E. Ruppert. Hundreds of impossibility results for distributed computing. Distr. Comput., 16(2-3): 121-163, 2003.
14. H. Hansson and B. Jonsson. A logic for reasoning about time and reliability. Formal Asp. Comput., 6(5):512-535, 1994.
15. O. Kupferman. Augmenting branching temporal logics with existential quantification over atomic propositions. J. Log. Comput., 9(2):135-147, 1999.
16. O. Kupferman and A. Pnueli. Once and for all. In Proc. LICS, pp. 25-35. IEEE Computer Society, 1995.
17. O. Kupferman and M. Y. Vardi. Memoryful branching-time logic. This volume.
18. L. Lamport. Fairness and hyperfairness. Distr. Comput., 13(4):239-245, 2000.
19. F. Laroussinie and P. Schnoebelen. Specification in CTL+past for verification in CTL. Inf. and Comput., 156(1-2):236-263, 2000.
20. D. Lehmann and S. Shelah. Reasoning with time and chance. Inf. and Contr., 53(3): 165-198, 1982.
21. O. Lichtenstein, A. Pnueli, and L. D. Zuck. The glory of the past. In Proc. of Logic of Programs, LNCS 193, pp. 196-218. Springer, 1985.
22. Z. Manna and A. Pnueli. A hierarchy of temporal properties. In Proc. PODC, pp. 377-408. ACM, 1990.
23. J. C. Oxtoby. Measure and Category. A Survey of the Analogies between Topological and Measure Spaces. Springer-Verlag, 1971.
24. M. Pistore and M. Y. Vardi. The planning spectrum - one, two, three, infinity. In Proc. LICS, pp. 234-243, 2003.
25. P. Schnoebelen. The complexity of temporal logic model checking. In Selected Papers from the 4th Workshop on Advances in Modal Logics (AiML'02), pp. 393-436, 2003.
26. W. Thomas. Automata on infinite objects. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B: Formal Models and Semantics. Elsevier, 1990.
27. M. Y. Vardi. Automatic verification of probabilistic concurrent finite-state programs. In Proc. FOCS, pp. 327-338, 1985.
28. H. Volzer, D. Varacca, and E. Kindler. Defining fairness. In Proc. CONCUR, LNCS 3653, pp. 458-472. Springer, 2005.
29. L. D. Zuck, A. Pnueli, and Y. Kesten. Automatic verification of probabilistic free choice. In Proc. VMCAI, LNCS 2294, pp. 208-224. Springer, 2002.