Certifying inexpressibility
From MaRDI portal
Publication:2233423
DOI10.1007/978-3-030-71995-1_20OpenAlexW4232076219MaRDI QIDQ2233423
Salomon Sickert, Orna Kupferman
Publication date: 18 October 2021
Full work available at URL: https://arxiv.org/abs/2101.08756
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Recognizing safety and liveness
- Reasoning about infinite computations
- Efficient minimization of deterministic weak \(\omega\)-automata
- Solving parity games: explicit vs symbolic
- Modalities for model checking: Branching time logic strikes back
- Certifying inexpressibility
- Separating Regular Languages with First-Order Logic
- Beyond Hyper-Minimisation--Minimising DBAs and DPAs is NP-Complete
- On Bounded Specifications
- Automata Theory and Model Checking
- Graph Games and Reactive Synthesis
- Model Checking Probabilistic Systems
- Linear Automaton Transformations
- Approximate Automata for Omega-Regular Languages
- Exponential Determinization for ω‐Automata with a Strong Fairness Acceptance Condition
- Counterexample-guided abstraction refinement for symbolic model checking
- On ω-regular sets
- O-Minimal Invariants for Discrete-Time Dynamical Systems
- Fixing the State Budget: Approximation of Regular Languages with Small DFAs
- From linear time to branching time
- Tools and Algorithms for the Construction and Analysis of Systems
- Efficient Separability of Regular Languages by Subsequences and Suffixes
- Büchi Complementation Made Tight
- TYPENESS FOR ω-REGULAR AUTOMATA
- Solving Sequential Conditions by Finite-State Strategies
- Decision problems forω-automata
- Testing and generating infinite sequences by a finite automaton
- Decidability of Second-Order Theories and Automata on Infinite Trees
- Finding Shortest Witnesses to the Nonemptiness of Automata on Infinite Words
This page was built for publication: Certifying inexpressibility
