The following pages link to (Q4251919):
Displayed 14 items.
- Continuous time temporal logic with counting (Q418179) (← links)
- Temporal logics with incommensurable distances are undecidable (Q879597) (← 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)
- Product interval automata (Q1847544) (← links)
- Future temporal logic needs infinitely many modalities (Q1877549) (← links)
- On the expressiveness of TPTL and MTL (Q2266987) (← links)
- Efficient timed model checking for discrete-time systems (Q2368994) (← links)
- Some Recent Results in Metric Temporal Logic (Q3543284) (← links)
- Complexity of Metric Temporal Logics with Counting and the Pnueli Modalities (Q3543292) (← links)
- Checking Temporal Properties of Discrete, Timed and Continuous Behaviors (Q5452193) (← links)
- A first order logic for specification of timed algorithms: Basic properties and a decidable class (Q5957904) (← links)