scientific article; zbMATH DE number 4179361

zbMATH Open0716.03035MaRDI QIDQ3203012FDOQ3203012

Authors: E. Allen Emerson, C. S. Jutla 

Publication date: 1989

Title of this publication is not available (Why is that?)

Recommendations

• BÜCHI COMPLEMENTATION MADE TIGHTER
• Automated Technology for Verification and Analysis
• Büchi complementation made tight
• On the complementation of Büchi automata
• Exponential Determinization for ω‐Automata with a Strong Fairness Acceptance Condition

zbMATH Keywords

decision procedures\(\omega \) -automataBüchi automaton on infinite stringsmodal logics of programs

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Decidability of theories and sets of sentences (03B25) Logic in computer science (03B70)

Cited In (14)

• Exponential Determinization for ω‐Automata with a Strong Fairness Acceptance Condition
• Automated temporal reasoning about reactive systems
• Lower Bounds for Complementation of ω-Automata Via the Full Automata Technique
• Title not available (Why is that?)
• Progress measures, immediate determinacy, and a subset construction for tree automata
• Fixed point characterization of infinite behavior of finite-state systems
• Lower Bounds for Complementation of omega-Automata Via the Full Automata Technique
• Linear temporal logic -- from infinite to finite horizon
• Games for the \(\mu\)-calculus
• Mechanizing the Powerset Construction for Restricted Classes of ω-Automata
• Short Witnesses and Accepting Lassos in ω-Automata
• An automata-theoretic approach to linear temporal logic
• Fast symbolic algorithms for omega-regular games under strong transition fairness
• Determinization and Complementation of Streett Automata

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