Characterizing CTL-like logics on finite trees.
From MaRDI portal
Publication:2490815
Recommendations
Cites work
- A variety theorem for trees and theories
- Cascades of tree-automata and computations in universal algebras
- CONCUR 2004 - Concurrency Theory
- FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
- General varieties of tree languages
- Generalized finite automata theory with an application to a decision problem of second-order logic
- scientific article; zbMATH DE number 4108163 (Why is no real title available?)
- scientific article; zbMATH DE number 3497806 (Why is no real title available?)
- scientific article; zbMATH DE number 3615891 (Why is no real title available?)
- scientific article; zbMATH DE number 475413 (Why is no real title available?)
- scientific article; zbMATH DE number 618821 (Why is no real title available?)
- scientific article; zbMATH DE number 1948485 (Why is no real title available?)
- scientific article; zbMATH DE number 798167 (Why is no real title available?)
- scientific article; zbMATH DE number 897895 (Why is no real title available?)
- scientific article; zbMATH DE number 3290336 (Why is no real title available?)
- scientific article; zbMATH DE number 3368555 (Why is no real title available?)
- On pseudovarieties, varieties of languages, filters of congruences, pseudoidentities and related topics
- On the expressive power of temporal logic
- Regular languages defined with generalized quantifiers
- Temporal logic and semidirect products: An effective characterization of the until hierarchy
- Temporal logic can be more expressive
- The temporal logic of branching time
- Verification of reactive systems. Formal methods and algorithms.
- Wreath products of algebras: Generalizing the Krohn-Rhodes theorem to arbitrary algebras
Cited in
(13)- Algebra for trees
- Characterizing EF over infinite trees and modal logic on transitive graphs
- Aperiodicity in Tree Automata
- Characterization of Logics over Ranked Tree Languages
- Algebraic characterization of logically defined tree languages
- Games for Temporal Logics on Trees
- A family of temporal logics on finite trees
- Dynamic logic of tree composition
- FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
- CONCUR 2004 - Concurrency Theory
- Products of tree automata with an application to temporal logic
- Some varieties of finite tree automata related to restricted temporal logics
- Recognisability for algebras of infinite trees
This page was built for publication: Characterizing CTL-like logics on finite trees.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2490815)
