The following pages link to (Q4945224):
Displaying 14 items.
- Continuous time temporal logic with counting (Q418179) (← links)
- A logical characterization of timed regular languages (Q728264) (← 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)
- 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)
- An infinite hierarchy of temporal logics over branching time (Q1854487) (← links)
- Is your model checker on time? On the complexity of model checking for timed modal logics (Q1858436) (← links)
- Future temporal logic needs infinitely many modalities (Q1877549) (← links)
- Quantified temporal alethic-deontic logic (Q2987727) (← links)
- QBF Encoding of Temporal Properties and QBF-Based Verification (Q3192192) (← links)
- Complexity of Metric Temporal Logics with Counting and the Pnueli Modalities (Q3543292) (← links)