The Complexity of Tree Automata and Logics of Programs
From MaRDI portal
Recommendations
Cited in
(77)- scientific article; zbMATH DE number 1406216 (Why is no real title available?)
- Hierarchical cost-parity games
- A decision procedure for \(\mathrm{CTL}^{*}\) based on tableaux and automata
- Solving odd-fair parity games
- Program schemata technique for propositional program logics: a 30-year history
- Constraint automata on infinite data trees: from \(\mathrm{CTL}(\mathbb{Z})/\mathrm{CTL}^*(\mathbb{Z})\) to decision procedures
- On the expressive power of hybrid branching-time logics
- scientific article; zbMATH DE number 475414 (Why is no real title available?)
- A survey of stochastic -regular games
- On the expressive power of hybrid branching-time logics
- Constraint automata on infinite data trees: from CTL\((\mathbb{Z})\text{CTL}^*(\mathbb{Z})\) to decision procedures
- A characterisation theorem for two-way bisimulation-invariant monadic least fixpoint logic over finite structures
- From Muller to parity and Rabin qutomata: optimal transformations preserving (history) determinism
- Satisfiability of \(\operatorname{ECTL}^\ast\) with constraints
- Dynamic logic of tree composition
- scientific article; zbMATH DE number 7199579 (Why is no real title available?)
- A survey on temporal logics for specifying and verifying real-time systems
- Sublogics of a branching time logic of robustness
- CTL^ with graded path modalities
- Games for synthesis of controllers with partial observation.
- Compactness and finite dimension in asymmetric normed linear spaces
- On the Complexity of Branching-Time Logics
- On the equivalence of recursive and nonrecursive Datalog programs
- The supremum asymmetric norm on sequence algebras: a general framework to measure complexity distances
- The complexity of tree automata and XPath on grammar-compressed trees
- A tableau-based decision procedure for CTL^*
- Games where you can play optimally with arena-independent finite memory
- Expressiveness and succinctness of a logic of robustness
- Compositional construction of most general controllers
- Temporal logics with language parameters
- To be fair, use bundles
- Coalgebraic satisfiability checking for arithmetic \(\mu\)-calculi
- Complexity of synthesis of composite service with correctness guarantee
- The average running time of an algorithm as a midpoint between fuzzy sets
- Temporal Logic with Recursion.
- Decidability and expressivity of Ockhamist propositional dynamic logics
- The modal -calculus caught off guard
- The mu-calculus and Model Checking
- Mathematical modal logic: A view of its evolution
- On the proof theory of the modal mu-calculus
- Deciding the unguarded modal \(\mu\)-calculus
- Compositional analysis for verification of parameterized systems
- scientific article; zbMATH DE number 7215285 (Why is no real title available?)
- The Complexity of Tree Transducer Output Languages
- Checking history-determinism is NP-hard for parity automata
- Interpolation for converse PDL
- Temporal logic with recursion
- scientific article; zbMATH DE number 4170887 (Why is no real title available?)
- scientific article; zbMATH DE number 3972842 (Why is no real title available?)
- The complexity space of partial functions: a connection between complexity analysis and denotational semantics
- A tableau for bundled strategies
- scientific article; zbMATH DE number 7650825 (Why is no real title available?)
- The Nesting-Depth of Disjunctive μ-Calculus for Tree Languages and the Limitedness Problem
- Aggregation of asymmetric distances in computer science
- On aggregation of normed structures
- Some varieties of finite tree automata related to restricted temporal logics
- A goal-directed decision procedure for hybrid PDL
- Temporal logics with language parameters
- Computing the width of non-deterministic automata
- scientific article; zbMATH DE number 3938533 (Why is no real title available?)
- Parameterized Algorithms for Parity Games
- A focus system for the alternation-free \(\mu \)-calculus
- EXPTIME Tableaux for the Coalgebraic μ-Calculus
- Automata-theoretic techniques for modal logics of programs
- Determinization and memoryless winning strategies
- scientific article; zbMATH DE number 1512627 (Why is no real title available?)
- A survey on satisfiability checking for the \(\mu \)-calculus through tree automata
- Branching time? Pruning time!
- Proof systems for the modal \(\mu \)-calculus obtained by determinizing automata
- Model checking for hybrid branching-time logics
- A unifying semantics for time and events
- Branching-time logics with path relativisation
- Chain-monadic second order logic over regular automatic trees and epistemic planning synthesis
- The model checking fingerprints of CTL operators
- scientific article; zbMATH DE number 1696780 (Why is no real title available?)
- Model checking timed recursive CTL
- Program schemata technique to solve propositional program logics revised
This page was built for publication: The Complexity of Tree Automata and Logics of Programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4268874)
