On the decidability and complexity of Metric Temporal Logic over finite words
From MaRDI portal
(Redirected from Publication:5310684)
Decidability of theories and sets of sentences (03B25) Temporal logic (03B44) Automata and formal grammars in connection with logical questions (03D05) Complexity of computation (including implicit computational complexity) (03D15) Specification and verification (program logics, model checking, etc.) (68Q60)
Recommendations
- On the expressiveness of metric temporal logic over bounded timed words
- Decidability results for metric and layered temporal logics
- Some Recent Results in Metric Temporal Logic
- Relaxed decidability and the robust semantics of metric temporal logic
- Complexity of Metric Temporal Logics with Counting and the Pnueli Modalities
- Complexity of metric temporal logics with counting and the Pnueli modalities
- Timer formulas and decidable metric temporal logic
- Expressive completeness for metric temporal logic
- scientific article; zbMATH DE number 7056237
- The Expressive Power of Temporal and First-Order Metric Logics
Cited in
(47)- Decidability results for metric and layered temporal logics
- Timeline-based planning over dense temporal domains
- On the termination and structural termination problems for counter machines with incrementing errors
- Complexity issues for timeline-based planning over dense time under future and minimal semantics
- Context-free timed formalisms: robust automata and linear temporal logics
- ``Most of leads to undecidability: failure of adding frequencies to LTL
- Bounded variability of metric temporal logic
- Parameterized model checking of weighted networks
- Metric temporal answer set programming over timed traces
- Complexity hierarchies beyond elementary
- Adequacy and complete axiomatization for timed modal logic
- Zeno, Hercules and the Hydra: downward rational termination is Ackermannian
- Adding one or more equivalence relations to the interval temporal logic \(\mathsf{AB}\overline{\mathsf{B}}\)
- On Unary Fragments of MTL and TPTL over Timed Words
- Time-Bounded Verification of CTMCs against Real-Time Specifications
- Model Checking Real-Time Systems
- Time-Bounded Verification
- Metric propositional neighborhood logic with an equivalence relation
- Complexity of timeline-based planning over dense temporal domains: exploring the middle ground
- Timed context-free temporal logics
- Mixing Lossy and Perfect Fifo Channels
- Some Recent Results in Metric Temporal Logic
- MTL with Bounded Variability: Decidability and Complexity
- Realizability of real-time logics
- A survey of timed automata for the development of real-time systems
- Model-checking timed temporal logics
- scientific article; zbMATH DE number 7559498 (Why is no real title available?)
- Determinisability of register and timed automata
- Relaxed decidability and the robust semantics of metric temporal logic
- Zeno, Hercules, and the Hydra: safety metric temporal logic is Ackermann-complete
- Satisfiability for MTL and TPTL over non-monotonic data words
- The ω-Regular Post Embedding Problem
- Robust Analysis of Timed Automata Via Channel Machines
- Post Embedding Problem Is Not Primitive Recursive, with Applications to Channel Systems
- Timed modal logics for real-time systems. Specification, verification and control
- Tomorrow and All our Yesterdays: MTL Satisfiability over the Integers
- Tools and Algorithms for the Construction and Analysis of Systems
- Foundations of Software Science and Computation Structures
- Generalizing Non-punctuality for Timed Temporal Logic with Freeze Quantifiers
- Metric temporal equilibrium logic over timed traces
- Model-checking real-time systems: revisiting the alternating automaton route
- When do you start counting? Revisiting counting and Pnueli modalities in timed logics
- Metric quantifiers and counting in timed logics and automata
- To drive or not to drive: a logical and computational analysis of European transport regulations
- Timed hyperproperties
- Decidability of logics based on an indeterministic metric tense logic
- Model checking memoryful linear-time logics over one-counter automata
This page was built for publication: On the decidability and complexity of Metric Temporal Logic over finite words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5310684)
