The following pages link to (Q4938638):
Displaying 11 items.
- Metric temporal logic revisited (Q266865) (← links)
- Continuous time temporal logic with counting (Q418179) (← links)
- Decidability of logics based on an indeterministic metric tense logic (Q897475) (← links)
- Complexity of metric temporal logics with counting and the Pnueli modalities (Q974119) (← links)
- Decidable metric logics (Q999264) (← links)
- Decidable verification for reducible timed automata specified in a first order logic with time (Q1606131) (← links)
- Timer formulas and decidable metric temporal logic (Q1780454) (← links)
- Is your model checker on time? On the complexity of model checking for timed modal logics (Q1858436) (← links)
- Complexity of Metric Temporal Logics with Counting and the Pnueli Modalities (Q3543292) (← links)
- A first order logic for specification of timed algorithms: Basic properties and a decidable class (Q5957904) (← links)
- METRICS FOR FORMAL STRUCTURES, WITH AN APPLICATION TO KRIPKE MODELS AND THEIR DYNAMICS (Q6103448) (← links)