The serializability problem for a temporal logic of transaction queries

References

• Börger , E. , Grädel , E. and Gurevich , Y. 1997 . The Classical Decision Problem , Berlin : Springer .
   Google Scholar
• Degtyarev , A. , Fisher , M. and Lisitsa , A. 2002 . Equality and Monodic First-Order Temporal Logic . Studia Logica , 72 : 147 – 156 .
   Google Scholar
• Hodkinson , I. , Wolter , F. and Zakharyaschev , M. 2000 . Decidable Fragments of First-Order Temporal Logics . Annals of Pure and Applied Logic , 106 : 85 – 134 .
   Web of Science ®Google Scholar
• Hodkinson , I. , Kontchakov , R. , Kurucz , A. , Wolter , F. and Zakharyaschev , M. On the Computational Complexity of Decidable Fragments of First-Order Linear Temporal Logics . Proceedings of TIME-ICTL'03 . pp. 91 – 98 .
   Google Scholar
• Hussak , W. 2004 . Serializable Histories in Quantified Propositional Temporal Logic . International Journal of Computer Mathematics , 81 : 1203 – 1212 .
   Web of Science ®Google Scholar
• Merz , S. 1992 . Decidability and Incompleteness Results for First-Order Temporal Logic of Linear Time . Journal of Applied Non-Classical Logics , 2 : 139 – 156 .
   Google Scholar
• Papadimitriou , C. 1979 . The Serializability of Concurrent Database Updates . Journal of the ACM , 26 : 631 – 653 .
   Web of Science ®Google Scholar
• Peled , D. , Katz , S. and Pnueli , A. Specifying and Proving Serializability in Temporal Logic . Proceedings of LICS . pp. 232 – 245 .
   Google Scholar
• Peled , D. and Pnueli , A. 1994 . Proving Partial Order Properties . Theoretical Computer Science , 126 : 143 – 182 .
   Web of Science ®Google Scholar
• Valencia , F. 2005 . Decidability of Infinite-State Timed CCP Processes and First-Order LTL . Theoretical Computer Science , 330 : 577 – 607 .
   Web of Science ®Google Scholar
• Wolter , F. and Zakharyaschev , M. 2002 . Axiomatizing the Monodic Fragment of First-Order Temporal Logic . Annals of Pure and Applied Logic , 118 : 133 – 145 .
   Web of Science ®Google Scholar