Timer formulas and decidable metric temporal logic

DOI10.1016/j.ic.2004.12.002zbMath1068.03014OpenAlexW2079880156MaRDI 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

decidabilitytemporal logicmonadic predicate logicmetric formula

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Temporal logic (03B44)

Related Items (9)

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

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

This page was built for publication: Timer formulas and decidable metric temporal logic