scientific article
From MaRDI portal
Publication:3730012
zbMath0596.68036MaRDI QIDQ3730012
Publication date: 1986
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Specification and verification (program logics, model checking, etc.) (68Q60) Abstract data types; algebraic specification (68Q65) Decidability of theories and sets of sentences (03B25)
Related Items (31)
On the universal and existential fragments of the \(\mu\)-calculus ⋮ Fuzzy tree automata ⋮ A focus system for the alternation-free \(\mu \)-calculus ⋮ Axiomatizing the equational theory of regular tree languages ⋮ On modal mu-calculus and Büchi tree automata ⋮ Logical definability of fixed points ⋮ Towards the hierarchical verification of reactive systems ⋮ Equational Properties of Fixed Point Operations in Cartesian Categories: An Overview ⋮ On the Weak Index Problem for Game 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. ⋮ Unnamed Item ⋮ The Non-deterministic Mostowski Hierarchy and Distance-Parity Automata ⋮ Unnamed Item ⋮ Equational properties of fixed-point operations in cartesian categories: An overview ⋮ Axiomatizing weighted synchronization trees and weighted bisimilarity ⋮ Completions of \(\mu \)-algebras ⋮ The \(\mu\)-calculus alternation hierarchy collapses over structures with restricted connectivity ⋮ Duality and the completeness of the modal \(\mu\)-calculus ⋮ The monadic second-order logic of graphs. IX: Machines and their behaviours ⋮ An initial semantics for the \(\mu\)-calculus on trees and Rabin's complementation lemma ⋮ The modal mu-calculus alternation hierarchy is strict ⋮ \(\varSigma^{\mu}_2\) is decidable for \(\varPi^{\mu}_2\) ⋮ Ambiguous classes in \(\mu\)-calculi hierarchies ⋮ The modal mu-calculus alternation hierarchy is strict ⋮ Linear Game Automata: Decidable Hierarchy Problems for Stripped-Down Alternating Tree Automata ⋮ Unique, guarded fixed points in an additive setting ⋮ Mu-calculus path checking ⋮ A Fully Equational Proof of Parikh's Theorem
This page was built for publication:
