The following pages link to (Q2771058):
Displaying 17 items.
- Branching-time logics with path relativisation (Q386037) (← links)
- Reasoning about temporal properties of rational play (Q1028639) (← links)
- Model checking for fragments of the interval temporal logic HS at the low levels of the polynomial time hierarchy (Q1784961) (← links)
- The complexity of propositional linear temporal logics in simple cases (Q1854521) (← links)
- Is your model checker on time? On the complexity of model checking for timed modal logics (Q1858436) (← links)
- Temporal logics with language parameters (Q2232279) (← links)
- Strategic reasoning with a bounded number of resources: the quest for tractability (Q2238736) (← links)
- Model checking for hybrid branching-time logics (Q2291813) (← links)
- Efficient timed model checking for discrete-time systems (Q2368994) (← links)
- Model checking abilities of agents: a closer look (Q2481560) (← links)
- \(\text{BTL}_{2}\) and the expressive power of \(\text{ECTL}^{+}\) (Q2500472) (← links)
- Equivalence between model-checking flat counter systems and Presburger arithmetic (Q2636509) (← links)
- Specification and Verification of Multi-Agent Systems (Q3166991) (← links)
- Equivalence Between Model-Checking Flat Counter Systems and Presburger Arithmetic (Q3447697) (← links)
- A Logic for Reasoning about Rational Agents (Q3602940) (← links)
- Branching-Time Temporal Logics with Minimal Model Quantifiers (Q3637242) (← links)
- (Q5015270) (← links)
