Serializable histories in quantified propositional temporal logic

DOI10.1080/00207160412331284051zbMath1099.68027OpenAlexW1966971514MaRDI QIDQ4652741

Walter Hussak

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

zbMATH Keywords

Temporal LogicDatabase ConcurrencySerializability

Mathematics Subject Classification ID

Database theory (68P15) Information storage and retrieval of data (68P20) Theory of operating systems (68N25) Temporal logic (03B44)

Related Items (1)

The serializability problem for a temporal logic of transaction queries

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

This page was built for publication: Serializable histories in quantified propositional temporal logic