Serializable histories in quantified propositional temporal logic

DOI10.1080/00207160412331284051MaRDI QIDQ4652741zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• The serializability problem for a temporal logic of transaction queries
• scientific article; zbMATH DE number 4182805
• Serialization of concurrent programs
• On serializability
• Generalized theory of serializability

Cites work

• Decidable fragments of first-order temporal logics
• Defining conditional independence using collapses
• Generalized theory of serializability
• Proving partial order properties
• Temporal logic can be more expressive
• The complementation problem for Büchi automata with applications to temporal logic
• The serializability of concurrent database updates

Cited in

(2)

• Undivided and indistinguishable histories in branching-time logics
• The serializability problem for a temporal logic of transaction queries

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4652741)