Pages that link to "Item:Q5310684"

The following pages link to On the decidability and complexity of Metric Temporal Logic over finite words (Q5310684):

Displaying 40 items.

• Adequacy and complete axiomatization for timed modal logic (Q283762) (← links)
• Adding one or more equivalence relations to the interval temporal logic \(\mathsf{AB}\overline{\mathsf{B}}\) (Q288804) (← links)
• Metric propositional neighborhood logic with an equivalence relation (Q329414) (← links)
• A survey of timed automata for the development of real-time systems (Q394966) (← links)
• Timed modal logics for real-time systems. Specification, verification and control (Q548704) (← links)
• To drive or not to drive: a logical and computational analysis of European transport regulations (Q821552) (← links)
• Timed hyperproperties (Q821560) (← links)
• Decidability of logics based on an indeterministic metric tense logic (Q897475) (← links)
• Model checking memoryful linear-time logics over one-counter automata (Q974117) (← links)
• Decidability results for metric and layered temporal logics (Q1815429) (← links)
• Timeline-based planning over dense temporal domains (Q1989337) (← links)
• On the termination and structural termination problems for counter machines with incrementing errors (Q2037198) (← links)
• Complexity issues for timeline-based planning over dense time under future and minimal semantics (Q2067619) (← links)
• Context-free timed formalisms: robust automata and linear temporal logics (Q2113377) (← links)
• ``Most of'' leads to undecidability: failure of adding frequencies to LTL (Q2233396) (← links)
• Bounded variability of metric temporal logic (Q2408743) (← links)
• Parameterized model checking of weighted networks (Q2447757) (← links)
• Metric temporal answer set programming over timed traces (Q2694559) (← links)
• Complexity hierarchies beyond elementary (Q2828216) (← links)
• On Unary Fragments of MTL and TPTL over Timed Words (Q2938172) (← links)
• Time-Bounded Verification of CTMCs against Real-Time Specifications (Q3172840) (← links)
• Model Checking Real-Time Systems (Q3176387) (← links)
• Time-Bounded Verification (Q3184695) (← links)
• (Q3384890) (← links)
• (Q3384894) (← links)
• Path Checking for MTL and TPTL over Data Words (Q3451113) (← links)
• Mixing Lossy and Perfect Fifo Channels (Q3541029) (← links)
• Some Recent Results in Metric Temporal Logic (Q3543284) (← links)
• MTL with Bounded Variability: Decidability and Complexity (Q3543293) (← links)
• Realizability of Real-Time Logics (Q3648828) (← links)
• Model-checking Timed Temporal Logics (Q4982129) (← links)
• (Q5089309) (← links)
• (Q5094137) (← links)
• Relaxed Decidability and the Robust Semantics of Metric Temporal Logic (Q5275335) (← links)
• Zeno, Hercules, and the Hydra (Q5277917) (← links)
• The ω-Regular Post Embedding Problem (Q5458353) (← links)
• Robust Analysis of Timed Automata Via Channel Machines (Q5458357) (← links)
• Post Embedding Problem Is Not Primitive Recursive, with Applications to Channel Systems (Q5458840) (← links)
• Generalizing Non-punctuality for Timed Temporal Logic with Freeze Quantifiers (Q6488465) (← links)
• Metric temporal equilibrium logic over timed traces (Q6656458) (← links)