scientific article; zbMATH DE number 3922633

MaRDI QIDQ3698787zbMATH OpenFDO

Authors

Publication date 1985

zbMATH Keywords

complementing Büchi automatadecision procedureExtended Temporal Logicinfinite wordsomega regularityrepeating acceptancesatisfiability problem

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Modal logic (including the logic of norms) (03B45) Automata and formal grammars in connection with logical questions (03D05) Complexity of computation (including implicit computational complexity) (03D15) Abstract data types; algebraic specification (68Q65)

Recommendations

• On the complementation of Büchi automata
• Complementing deterministic Büchi automata in polynomial time
• Unifying Büchi complementation constructions
• BÜCHI COMPLEMENTATION MADE TIGHTER
• Automated Technology for Verification and Analysis

Cited in

(23)

• Complementing deterministic Büchi automata in polynomial time
• On automata on infinite trees
• Second-order propositional modal logic: expressiveness and completeness results
• On the complementation of Büchi automata
• Ambiguity, weakness, and regularity in probabilistic Büchi automata
• The power of first-order quantification over states in branching and linear time temporal logics
• Robust, expressive, and quantitative linear temporal logics: pick any two for free
• Advanced Ramsey-based Büchi automata inclusion testing
• On the Relationship between  -automata and Temporal Logic Normal Forms
• Propositional Projection Temporal Logic, B $\ddot{u}$ chi Automata and ω-Regular Expressions
• From Philosophical to Industrial Logics
• Complementation of Büchi Automata Using Alternation
• Linear temporal logic symbolic model checking
• scientific article; zbMATH DE number 7455737 (Why is no real title available?)
• 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?
• Monitoring first-order interval logic
• An automata theoretic approach to Temporal Logic
• Simulations in rank-based Büchi automata complementation
• Arbitrary-arity tree automata for QCTL
• On the expressive power of temporal logic for infinite words
• Timed hyperproperties

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 Q3698787)