Serializable histories in quantified propositional temporal logic
From MaRDI portal
Publication:4652741
DOI10.1080/00207160412331284051zbMath1099.68027MaRDI QIDQ4652741
Publication date: 28 February 2005
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207160412331284051
68P15: Database theory
68P20: Information storage and retrieval of data
68N25: Theory of operating systems
03B44: Temporal logic
Related Items
Cites Work
- Generalized theory of serializability
- The complementation problem for Büchi automata with applications to temporal logic
- Defining conditional independence using collapses
- Proving partial order properties
- Decidable fragments of first-order temporal logics
- Temporal logic can be more expressive
- The serializability of concurrent database updates