Pages that link to "Item:Q4268874"
From MaRDI portal
The following pages link to The Complexity of Tree Automata and Logics of Programs (Q4268874):
Displaying 50 items.
- Satisfiability of \(\operatorname{ECTL}^\ast\) with constraints (Q269503) (← links)
- Branching-time logics with path relativisation (Q386037) (← links)
- A survey of stochastic \(\omega \)-regular games (Q414898) (← links)
- A tableau-based decision procedure for CTL\(^*\) (Q432138) (← links)
- Complexity of synthesis of composite service with correctness guarantee (Q439758) (← links)
- On aggregation of normed structures (Q646150) (← links)
- On the equivalence of recursive and nonrecursive Datalog programs (Q676421) (← links)
- The average running time of an algorithm as a midpoint between fuzzy sets (Q732662) (← links)
- A unifying semantics for time and events (Q814548) (← links)
- Compactness and finite dimension in asymmetric normed linear spaces (Q818408) (← links)
- The complexity of tree automata and XPath on grammar-compressed trees (Q860863) (← links)
- On the proof theory of the modal mu-calculus (Q1005937) (← links)
- Determinization and memoryless winning strategies (Q1357005) (← links)
- Games for synthesis of controllers with partial observation. (Q1401346) (← links)
- Mathematical modal logic: A view of its evolution (Q1422628) (← links)
- Sublogics of a branching time logic of robustness (Q1740655) (← links)
- CTL\(^\ast\) with graded path modalities (Q1784942) (← links)
- On the expressive power of hybrid branching-time logics (Q1989342) (← links)
- Temporal logic with recursion (Q2051830) (← links)
- A focus system for the alternation-free \(\mu \)-calculus (Q2142090) (← links)
- Hierarchical cost-parity games (Q2210523) (← links)
- Program schemata technique for propositional program logics: a 30-year history (Q2216719) (← links)
- Temporal logics with language parameters (Q2232279) (← links)
- Aggregation of asymmetric distances in computer science (Q2269783) (← links)
- Model checking for hybrid branching-time logics (Q2291813) (← links)
- The model checking fingerprints of CTL operators (Q2317834) (← links)
- Compositional construction of most general controllers (Q2350495) (← links)
- A goal-directed decision procedure for hybrid PDL (Q2351150) (← links)
- Compositional analysis for verification of parameterized systems (Q2368952) (← links)
- To be fair, use bundles (Q2408744) (← links)
- A survey on temporal logics for specifying and verifying real-time systems (Q2418645) (← links)
- Decidability and Expressivity of Ockhamist Propositional Dynamic Logics (Q2835868) (← links)
- The supremum asymmetric norm on sequence algebras: a general framework to measure complexity distances (Q2843617) (← links)
- Branching Time? Pruning Time! (Q2908510) (← links)
- Parameterized Algorithms for Parity Games (Q2946404) (← links)
- The complexity space of partial functions: a connection between complexity analysis and denotational semantics (Q3008383) (← links)
- The Modal μ-Calculus Caught Off Guard (Q3010366) (← links)
- The Complexity of Tree Transducer Output Languages (Q3165963) (← links)
- The mu-calculus and Model Checking (Q3176384) (← links)
- Program Schemata Technique to Solve Propositional Program Logics Revised (Q3179178) (← links)
- A Tableau for Bundled Strategies (Q3455759) (← links)
- The Nesting-Depth of Disjunctive μ-Calculus for Tree Languages and the Limitedness Problem (Q3540194) (← links)
- EXPTIME Tableaux for the Coalgebraic μ-Calculus (Q3644748) (← links)
- On the Complexity of Branching-Time Logics (Q3644771) (← links)
- (Q4273661) (← links)
- Deciding the unguarded modal -calculus (Q4583323) (← links)
- Expressiveness and succinctness of a logic of robustness (Q4586143) (← links)
- (Q4939253) (← links)
- (Q5028465) (← links)
- On the expressive power of hybrid branching-time logics (Q5079784) (← links)
