Fixed point characterization of infinite behavior of finite-state systems

DOI10.1016/S0304-3975(97)00039-XMaRDI QIDQ1389678zbMATH OpenFDO

Authors Damian Niwiński

Publication date 30 June 1998

Published in Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

fixed pointspowerset algebrasRabin automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• On finite representations of infinite-state behaviours
• An automata-theoretic approach to infinite-state systems
• scientific article; zbMATH DE number 1759611
• A decidability result for the model checking of infinite-state systems
• Finite and infinite implementation of transition systems
• scientific article; zbMATH DE number 4189200
• Bounded model checking of infinite state systems
• scientific article; zbMATH DE number 1079152
• On characterizations of fixed points
• On reachability and safety in infinite-state systems

Cites work

• scientific article; zbMATH DE number 4179361 (Why is no real title available?)
• scientific article; zbMATH DE number 3898850 (Why is no real title available?)
• scientific article; zbMATH DE number 3960988 (Why is no real title available?)
• scientific article; zbMATH DE number 3972168 (Why is no real title available?)
• scientific article; zbMATH DE number 3990873 (Why is no real title available?)
• scientific article; zbMATH DE number 3714896 (Why is no real title available?)
• scientific article; zbMATH DE number 3714908 (Why is no real title available?)
• scientific article; zbMATH DE number 49206 (Why is no real title available?)
• scientific article; zbMATH DE number 3492660 (Why is no real title available?)
• scientific article; zbMATH DE number 3562469 (Why is no real title available?)
• scientific article; zbMATH DE number 3591916 (Why is no real title available?)
• scientific article; zbMATH DE number 475417 (Why is no real title available?)
• scientific article; zbMATH DE number 1142314 (Why is no real title available?)
• scientific article; zbMATH DE number 1142324 (Why is no real title available?)
• scientific article; zbMATH DE number 1142326 (Why is no real title available?)
• scientific article; zbMATH DE number 3995637 (Why is no real title available?)
• scientific article; zbMATH DE number 2102739 (Why is no real title available?)
• scientific article; zbMATH DE number 3237829 (Why is no real title available?)
• scientific article; zbMATH DE number 3290336 (Why is no real title available?)
• scientific article; zbMATH DE number 3339435 (Why is no real title available?)
• scientific article; zbMATH DE number 3349291 (Why is no real title available?)
• A lattice-theoretical fixpoint theorem and its applications
• Alternating automata on infinite trees
• Alternating automata with start formulas
• An automata theoretic decision procedure for the propositional mu- calculus
• Automata for the modal \(\mu \)-calculus and related results
• Automata-theoretic techniques for modal logics of programs
• Completeness of Kozen's axiomatisation of the propositional \(\mu\)-calculus.
• Decidability of Second-Order Theories and Automata on Infinite Trees
• Equivalences and transformations of regular systems - applications to recursive program schemes and grammars
• Fixed-point characterization of context-free ∞-languages
• Infinite games played on finite graphs
• On the synthesis of strategies in infinite games
• On ω-regular sets
• Results on the propositional \(\mu\)-calculus
• Set theory. With an introduction to descriptive set theory. Translation of the original Polish edition. 2nd, completely revised ed
• Simulating alternating tree automata by nondeterministic automata: New results and new proofs of the theorems of Rabin, McNaughton and Safra
• The computational complexity of logical theories
• The greatest fixed-points and rational omega-tree languages
• The modal mu-calculus alternation hierarchy is strict

Cited in

(22)

• scientific article; zbMATH DE number 4189200 (Why is no real title available?)
• On finite representations of infinite-state behaviours
• On modal \(\mu \)-calculus over finite graphs with small components or small tree width
• The complexity of stochastic Müller games
• On modal -calculus and non-well-founded set theory
• Fixpoint alternation: arithmetic, transition systems, and the binary tree
• Theμ-calculus alternation-depth hierarchy is strict on binary trees
• scientific article; zbMATH DE number 3960988 (Why is no real title available?)
• Automata and fixed point logic: a coalgebraic perspective
• Modular games for coalgebraic fixed point logics
• Domain mu-calculus
• The alternation hierarchy in fixpoint logic with chop is strict too
• On temporal logic versus Datalog
• Equivalence of probabilistic \(\mu\)-calculus and p-automata
• Free \(\mu\)-lattices
• A fixpoint approach to finite delay and fairness
• Pushdown processes: Games and model-checking
• Alternation is strict for higher-order modal fixpoint logic
• Ambiguous classes in \(\mu\)-calculi hierarchies
• On Distributive Fixed-Point Expressions
• Deciding low levels of tree-automata hierarchy
• Fixpoints, games and the difference hierarchy

This page was built for publication: Fixed point characterization of infinite behavior of finite-state systems

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