Certifying DFA Bounds for Recognition and Separation

The automation of decision procedures makes certification essential. We suggest to use determinacy of turn-based two-player games with regular winning conditions in order to generate certificates for the number of states that a deterministic finite automaton (DFA) needs in order to recognize a given language. Given a language L and a bound k, recognizability of L by a DFA with k states is reduced to a game between Prover and Refuter. The interaction along the game then serves as a certificate. Certificates generated by Prover are minimal DFAs. Certificates generated by Refuter are faulty attempts to define the required DFA. We compare the length of offline certificates, which are generated with no interaction between Prover and Refuter, and online certificates, which are based on such an interaction, and are thus shorter. We show that our approach is useful also for certification of separability of regular languages by a DFA of a given size. Unlike DFA minimization, which can be solved in polynomial time, separation is NP-complete, and thus the certification approach is essential. In addition, we prove NP-completeness of a strict version of separation.

[1]  Orna Kupferman,et al.  Environment-Friendly Safety , 2012, Haifa Verification Conference.

[2]  A. Nerode,et al.  Linear automaton transformations , 1958 .

[3]  Slawomir Lasota,et al.  Regular Separability of Well-Structured Transition Systems , 2018, CONCUR.

[4]  Bowen Alpern,et al.  Recognizing safety and liveness , 2005, Distributed Computing.

[5]  Wim Martens,et al.  Efficient Separability of Regular Languages by Subsequences and Suffixes , 2013, ICALP.

[6]  Daniel Neider.  Computing Minimal Separating DFAs and Regular Invariants Using SAT and SMT Solvers , 2012, ATVA.

[7]  Sven Schewe,et al.  Beyond Hyper-Minimisation---Minimising DBAs and DPAs is NP-Complete , 2010, FSTTCS.

[8]  Bernd Finkbeiner,et al.  Explainable Reactive Synthesis , 2020, ATVA.

[9]  Thomas Place,et al.  Separating regular languages with first-order logic , 2014, CSL-LICS.

[10]  Peter J. Stuckey,et al.  Fixing the State Budget: Approximation of Regular Languages with Small DFAs , 2017, ATVA.

[11]  Charles P. Pfleeger,et al.  State Reduction in Incompletely Specified Finite-State Machines , 1973, IEEE Transactions on Computers.

[12]  Joël Ouaknine,et al.  O-Minimal Invariants for Linear Loops , 2018, ICALP.

[13]  Sabine Mérienne,et al.  Programme , 1953, Neuromuscular Disorders.

[14]  Morteza Lahijanian,et al.  Explainable Multi Agent Path Finding , 2020, AAMAS.

[15]  F. Joel Ferguson,et al.  On state reduction of incompletely specified finite state machines , 2007, Comput. Electr. Eng..

[16]  Orna Kupferman,et al.  Model Checking of Safety Properties , 1999, Formal Methods Syst. Des..

[17]  Marijn J. H. Heule,et al.  Exact DFA Identification Using SAT Solvers , 2010, ICGI.

[18]  Orna Kupferman,et al.  Certifying Inexpressibility , 2021, FoSSaCS.

[19]  E. Mark Gold,et al.  Complexity of Automaton Identification from Given Data , 1978, Inf. Control..

[20]  Dominique Perrin,et al.  Finite Automata , 1958, Philosophy.

[21]  Dana Fisman.  Inferring regular languages and ω-languages , 2018, J. Log. Algebraic Methods Program..

[22]  J. R. Büchi,et al.  Solving sequential conditions by finite-state strategies , 1969 .

[23]  Orna Kupferman,et al.  From complementation to certification , 2005, Theor. Comput. Sci..

[24]  Dana Angluin,et al.  Learning Regular Sets from Queries and Counterexamples , 1987, Inf. Comput..