scientific article
From MaRDI portal
Publication:3698787
zbMath0577.03019MaRDI QIDQ3698787
No author found.
Publication date: 1985
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
satisfiability probleminfinite wordsdecision procedurecomplementing Büchi automataomega regularityrepeating acceptanceExtended Temporal Logic
Modal logic (including the logic of norms) (03B45) Automata and formal grammars in connection with logical questions (03D05) Abstract data types; algebraic specification (68Q65) Decidability of theories and sets of sentences (03B25) Complexity of computation (including implicit computational complexity) (03D15)
Related Items (17)
Timed hyperproperties ⋮ The power of first-order quantification over states in branching and linear time temporal logics ⋮ Complementing deterministic Büchi automata in polynomial time ⋮ Robust, expressive, and quantitative linear temporal logics: pick any two for free ⋮ Monitoring first-order interval logic ⋮ Ambiguity, weakness, and regularity in probabilistic Büchi automata ⋮ Unnamed Item ⋮ Linear temporal logic symbolic model checking ⋮ Second-order propositional modal logic: expressiveness and completeness results ⋮ On automata on infinite trees ⋮ From Philosophical to Industrial Logics ⋮ From Monadic Logic to PSL ⋮ Model Checking Almost All Paths Can Be Less Expensive Than Checking All Paths ⋮ How Much Lookahead is Needed to Win Infinite Games? ⋮ Advanced Ramsey-Based Büchi Automata Inclusion Testing ⋮ On the complementation of Büchi automata ⋮ On the expressive power of temporal logic for infinite words
This page was built for publication:
