On Gabbay's temporal fixed point operator

DOI10.1016/0304-3975(94)00084-VzbMATH Open0874.68272OpenAlexW2111376785MaRDI QIDQ673958FDOQ673958

Authors: Ian Hodkinson 

Publication date: 28 February 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(94)00084-v

Recommendations

• The temporal logic of branching time
• Temporal algebra
• The complexity of propositional linear temporal logics
• Decision procedures and expressiveness in the temporal logic of branching time

zbMATH Keywords

MetateMPSPACE-complete satisfiability problemUSF

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27)

Cites Work

• Rabin's uniformization problem
• The complexity of propositional linear temporal logics
• Title not available (Why is that?)
• Temporal logic can be more expressive
• Title not available (Why is that?)
• Testing and generating infinite sequences by a finite automaton
• Solving Sequential Conditions by Finite-State Strategies
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (2)

• Modeling data-intensive reactive systems with relational transition systems
• Expressive completeness for LTL with modulo counting and group quantifiers

This page was built for publication: On Gabbay's temporal fixed point operator

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