Pages that link to "Item:Q1780454"
From MaRDI portal
The following pages link to Timer formulas and decidable metric temporal logic (Q1780454):
Displaying 19 items.
- A tool for deciding the satisfiability of continuous-time metric temporal logic (Q262137) (← links)
- Metric temporal logic revisited (Q266865) (← links)
- Continuous time temporal logic with counting (Q418179) (← links)
- Automata and logics over finitely varying functions (Q636272) (← links)
- The complexity of temporal logic over the reals (Q636345) (← links)
- Temporal logics with incommensurable distances are undecidable (Q879597) (← links)
- An SMT-based approach to satisfiability checking of MITL (Q897649) (← links)
- Complexity of metric temporal logics with counting and the Pnueli modalities (Q974119) (← links)
- Decidable metric logics (Q999264) (← links)
- Programming in metric temporal logic (Q1128978) (← links)
- Two-sorted metric temporal logics (Q1391098) (← links)
- Periodicity based decidable classes in a first order timed logic (Q2368906) (← links)
- Bounded variability of metric temporal logic (Q2408743) (← links)
- Metric temporal reasoning with less than two clocks (Q2901203) (← links)
- Complexity of Metric Temporal Logics with Counting and the Pnueli Modalities (Q3543292) (← links)
- Parametric Metric Interval Temporal Logic (Q3564866) (← links)
- On the decidability of continuous time specification formalisms (Q4221299) (← links)
- (Q4621139) (← links)
- On the decidability and complexity of Metric Temporal Logic over finite words (Q5310684) (← links)