Antichains: A New Algorithm for Checking Universality of Finite Automata
Abstract elided by the publisher.
Related papers
- Antichain Algorithms for Finite Automata TACAS 2010
- Checking NFA equivalence with bisimulations up to congruence POPL 2013
- Lazy Automata Techniques for WS1S TACAS 2017
- Mata: A Fast and Simple Finite Automata Library TACAS 2024
- Antichains Algorithms for the Inclusion Problem Between ømega-VPL TACAS 2023
- Safraless Synthesis for Epistemic Temporal Specifications CAV 2014
- Antichains: Alternative Algorithms for LTL Satisfiability and Model-Checking TACAS 2008
- Timed Automata Verification and Synthesis via Finite Automata Learning TACAS 2023