Timer formulas and decidable metric temporal logic

DOI10.1016/j.ic.2004.12.002zbMath1068.03014MaRDI QIDQ1780454

Alexander Rabinovich, Joram Hirschfeld

Publication date: 13 June 2005

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2004.12.002

zbMATH Keywords

decidability; temporal logic; monadic predicate logic; metric formula

Mathematics Subject Classification ID

03B25: Decidability of theories and sets of sentences

03B44: Temporal logic

Related Items

A tool for deciding the satisfiability of continuous-time metric temporal logic, Continuous time temporal logic with counting, Automata and logics over finitely varying functions, The complexity of temporal logic over the reals, Temporal logics with incommensurable distances are undecidable, An SMT-based approach to satisfiability checking of MITL, Complexity of metric temporal logics with counting and the Pnueli modalities, Decidable metric logics, Complexity of Metric Temporal Logics with Counting and the Pnueli Modalities

Cites Work

• The complexity of temporal logic over the reals
• Real-time logics: Complexity and expressiveness
• The decision problem for linear temporal logic
• The monadic theory of order
• Models for reactivity
• On the decidability of continuous time specification formalisms
• The benefits of relaxing punctuality
• Decidability of Second-Order Theories and Automata on Infinite Trees
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item