The following pages link to (Q4501666):
Displaying 23 items.
- Branching-time logics with path relativisation (Q386037) (← links)
- Improved model checking of hierarchical systems (Q418123) (← links)
- \textit{Once} and \textit{for all} (Q439961) (← links)
- Refinement modal logic (Q476194) (← links)
- A modal logic framework for reasoning about comparative distances and topology (Q636293) (← links)
- A purely model-theoretic proof of the exponential succinctness gap between CTL\(^{+}\) and CTL (Q975478) (← links)
- Branching-time logics repeatedly referring to states (Q1047801) (← links)
- From bidirectionality to alternation. (Q1401248) (← links)
- On the expressivity and complexity of quantitative branching-time temporal logics (Q1401306) (← links)
- On temporal logic versus Datalog (Q1401358) (← links)
- Strategic reasoning with a bounded number of resources: the quest for tractability (Q2238736) (← links)
- Model-checking graded computation-tree logic with finite path semantics (Q2285155) (← links)
- To be fair, use bundles (Q2408744) (← links)
- \(\text{BTL}_{2}\) and the expressive power of \(\text{ECTL}^{+}\) (Q2500472) (← links)
- ATL* Satisfiability Is 2EXPTIME-Complete (Q3519515) (← links)
- An Automata-Theoretic Approach to Infinite-State Systems (Q3587257) (← links)
- Branching-Time Temporal Logics with Minimal Model Quantifiers (Q3637242) (← links)
- A decidable timeout-based extension of linear temporal logic (Q4583356) (← links)
- Comparing the succinctness of monadic query languages over finite trees (Q4659888) (← links)
- On the Way to Alternating Weak Automata (Q5090957) (← links)
- (Q5114824) (← links)
- (Q5232899) (← links)
- The Complexity of CTL* + Linear Past (Q5458359) (← links)
