Certifying inexpressibility

DOI10.1007/978-3-030-71995-1_20OpenAlexW4232076219MaRDI QIDQ2233423FDOQ2233423

Authors: Orna Kupferman, Salomon Sickert 

Publication date: 18 October 2021

Full work available at URL: https://arxiv.org/abs/2101.08756

zbMATH Keywords

gamesexpressive powerautomata on infinite words

Mathematics Subject Classification ID

Theory of software (68Nxx) Theory of computing (68Qxx)

Cites Work

• Counterexample-guided abstraction refinement for symbolic model checking
• Title not available (Why is that?)
• Decidability of Second-Order Theories and Automata on Infinite Trees
• Title not available (Why is that?)
• Reasoning about infinite computations
• Title not available (Why is that?)
• Separating regular languages with first-order logic
• Efficient separability of regular languages by subsequences and suffixes
• Testing and generating infinite sequences by a finite automaton
• Title not available (Why is that?)
• Modalities for model checking: Branching time logic strikes back
• Title not available (Why is that?)
• Tools and Algorithms for the Construction and Analysis of Systems
• Büchi complementation made tight
• Decision problems forω-automata
• Recognizing safety and liveness
• Solving parity games: explicit vs symbolic
• Solving Sequential Conditions by Finite-State Strategies
• On ω-regular sets
• Linear Automaton Transformations
• On bounded specifications
• From linear time to branching time
• Certifying inexpressibility
• Title not available (Why is that?)
• Efficient minimization of deterministic weak \(\omega\)-automata
• Automata theory and model checking
• Graph Games and Reactive Synthesis
• Model checking probabilistic systems
• Approximate automata for omega-regular languages
• Title not available (Why is that?)
• TYPENESS FOR ω-REGULAR AUTOMATA
• Exponential Determinization for ω‐Automata with a Strong Fairness Acceptance Condition
• Finding Shortest Witnesses to the Nonemptiness of Automata on Infinite Words
• Beyond hyper-minimisation -- minimising DBAs and DPAs is NP-complete
• Regular separability of well-structured transition systems
• Fixing the state budget: approximation of regular languages with small DFAs
• Title not available (Why is that?)

Cited In (4)

• Certifying inexpressibility
• The inexpressibility of validity
• Certifying DFA bounds for recognition and separation
• Impossibility of gathering, a certification

This page was built for publication: Certifying inexpressibility

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