References
References
- Papadimitriou , CH . (1979) . The serializability of concurrent database updates . J. the ACM , 26 : 631 – 653 .
- Manna Z Pnueli A (1981) Verification of concurrent programs: The temporal framework In: R. S. Boyer, J. S. Moore (Eds.), The Correctness Problem in Computer Science, Academic Press London pp. 215–273
- Hodkinson , I , Wolter , F and Zakharyaschev , M . (2000) . Decidable fragments of first-order temporal logics . Ann. Pure Appl. Logic , 106 : 85 – 134 .
- Manna Z Pnueli A (1992) The Temporal Logic of Reactive and Concurrent Systems: Specification, Springer-Verlag Berlin
- Peled , D and Pnueli , A . (1994) . Proving partial order properties . Theoret. Comp. Sci. , 126 : 143 – 182 .
- Vidyasankar , K . (1987) . Generalized theory of serializability . Acta Informat. , 24 : 105 – 119 .
- Katz , S and Peled , D . (1992) . Defining conditional independence using collapses . Theoret. Comp. Sci. , 101 : 337 – 359 .
- Peled D Katz S Pnueli A (1991) Specifying and proving serializability in temporal logic Proceedings LICS 1991, IEEE Computer Society Press pp. 232–245
- Sistla , AP , Vardi , MY and Wolper , P . (1978) . The complementation problem for Büchi automata with application to temporal logic . Theoret. Comp. Sci. , 49 : 217 – 237 .
- Kesten Y Pnueli A (1995) A complete proof system for QPTL Proceedings LICS 1995, IEEE Computer Society Press pp. 2–12
- French T Reynolds M (2003) A sound and complete proof system for QPTL In: P. Balbiani, N. Suzuki, F. Wolter and M. Zakharyaschev (Eds.), Advances in Modal Logic 4 King's College Publications London pp. 127–148
- Wolper , P . (1983) . Temporal logic can be more expressive . Inform. Control , 56 : pp. 72–99
- French T (2003) Quantified propositional temporal logic with repeating states Proceedings TIME-ICTL’03, IEEE Computer Society Press pp. 155–165