scientific article; zbMATH DE number 3960988

MaRDI QIDQ3730012zbMATH OpenFDO

Authors Damian Niwiński

Publication date 1986

zbMATH Keywords

decidabilityfixed point operatorsRabin automata on infinite treesRabin pair indicestree algebra

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Specification and verification (program logics, model checking, etc.) (68Q60) Abstract data types; algebraic specification (68Q65)

Recommendations

• Fixed point characterization of infinite behavior of finite-state systems
• scientific article; zbMATH DE number 4189200
• scientific article; zbMATH DE number 2102757
• The greatest fixed-points and rational omega-tree languages
• On Distributive Fixed-Point Expressions

Cited in

(40)

• Mu-calculus path checking
• Logical definability of fixed points
• The modal mu-calculus alternation hierarchy is strict
• On modal mu-calculus and Büchi tree automata
• Fixed point characterization of infinite behavior of finite-state systems
• The equational logic of fixed points
• On the equational definition of the least prefixed point.
• A gap property of deterministic tree languages.
• Ambiguous classes in \(\mu\)-calculi hierarchies
• \(\varSigma^{\mu}_2\) is decidable for \(\varPi^{\mu}_2\)
• A focus system for the alternation-free \(\mu \)-calculus
• On the universal and existential fragments of the \(\mu\)-calculus
• Fuzzy tree automata
• Axiomatizing weighted synchronization trees and weighted bisimilarity
• Unique, guarded fixed points in an additive setting: extended abstract
• Equational properties of fixed point operations in Cartesian categories: an overview
• On the weak index problem for game automata
• scientific article; zbMATH DE number 1817687 (Why is no real title available?)
• scientific article; zbMATH DE number 4202337 (Why is no real title available?)
• The descriptive complexity of modal model-checking games
• The Non-deterministic Mostowski Hierarchy and Distance-Parity Automata
• Linear Game Automata: Decidable Hierarchy Problems for Stripped-Down Alternating Tree Automata
• The \(\mu\)-calculus alternation hierarchy collapses over structures with restricted connectivity
• A Fully Equational Proof of Parikh's Theorem
• scientific article; zbMATH DE number 7310100 (Why is no real title available?)
• Equational properties of fixed-point operations in Cartesian categories: an overview
• Game-based local model checking for the coalgebraic \(\mu\)-calculus
• Towards the hierarchical verification of reactive systems
• The modal mu-calculus alternation hierarchy is strict
• Efficient Algorithms for Omega-Regular Energy Games
• COOL 2 – A Generic Reasoner for Modal Fixpoint Logics (System Description)
• From Muller to parity and Rabin qutomata: optimal transformations preserving (history) determinism
• Size measures and alphabetic equivalence in the -calculus
• Duality and the completeness of the modal -calculus
• The monadic second-order logic of graphs. IX: Machines and their behaviours
• An initial semantics for the -calculus on trees and Rabin's complementation lemma
• Deterministic and game separability for regular languages of infinite trees
• Axiomatizing the equational theory of regular tree languages
• Completions of -algebras
• Small clones and the projection property

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3730012)