Advanced Ramsey-Based Büchi Automata Inclusion Testing

Abdulla, Parosh Aziz; Chen, Yu‐Fang; Clemente, Lorenzo; Holík, Lukáš; Hong, Chih-Duo; Mayr, Richard; Vojnar, Tomáš

doi:10.1007/978-3-642-23217-6_13

Cited by 39 publications

(74 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…On the one hand, they offer a sound, but incomplete, approximation of language inclusion that may be sufficient in many practical cases. On the other hand, simulations can be used for quotienting automata [5,18,14], for pruning transitions [1,2], or for improving existing decision procedures on NBA like the Ramsey-based [17] or the antichain algorithm for inclusion, resp. universality checking [12].…”

Section: Introductionmentioning

confidence: 99%

Buffered Simulation Games for Büchi Automata

Hutagalung

Lange

Lozes

2014

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

Simulation relations are an important tool in automata theory because they provide efficiently computable approximations to language inclusion. In recent years, extensions of ordinary simulations have been studied, for instance multi-pebble and multi-letter simulations which yield better approximations and are still polynomial-time computable.In this paper we study the limitations of approximating language inclusion in this way: we introduce a natural extension of multi-letter simulations called buffered simulations. They are based on a simulation game in which the two players share a FIFO buffer of unbounded size. We consider two variants of these buffered games called continuous and look-ahead simulation which differ in how elements can be removed from the FIFO buffer. We show that look-ahead simulation, the simpler one, is already PSPACE-hard, i.e. computationally as hard as language inclusion itself. Continuous simulation is even EXPTIME-hard. We also provide matching upper bounds for solving these games with infinite state spaces.

show abstract

Section: Introductionmentioning

confidence: 99%

Buffered Simulation Games for Büchi Automata

Hutagalung

Lange

Lozes

2014

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

show abstract

“…It would be interesting to see if our results hold without this restriction. Another direction, would be to use alternate methods like Ramsey theorem based [2,14] or Anti-chain based [13,10] methods avoiding complementation and hence determinization to do language inclusion check.…”

Section: Resultsmentioning

confidence: 99%

On Timed Scope-Bounded Context-Sensitive Languages

Bhave

Krishna

Phawade

et al. 2019

Developments in Language Theory

View full text Add to dashboard Cite

In (DLT 2016) we studied timed context sensitive languages characterized by multiple stack push down automata (MPA), with an explicit bound on number of stages where in each stage at most one stack is used (k-round MPA). In this paper, we continue our work on timed MPA and study a subclass in which a symbol corresponding to a stack being pushed in it must be popped within fixed number of contexts of that stack -scope-bounded push-down automata with multiple stacks (k-scope MPA). We use Visibly Push-down Alphabet and Event Clocks to show that timed k-scope MPA have decidable reachability problem; are closed under Boolean operations; and have an equivalent logical characterization.

show abstract

“…The ROLL library (http://iscasmc.ios.ac.cn/roll) is implemented in JAVA. The DFA operations in ROLL are delegated to the dk.brics.automaton package, and we use the RABIT tool [2,3] to check the equivalence of two BAs. We evaluate the performance of ROLL using the smallest BAs corresponding to all the 295 LTL specifications available in BüchiStore [37], where the numbers of states in the BAs range over 1 to 17 and transitions range over 0 to 123.…”

Section: Resultsmentioning

confidence: 99%

A Novel Learning Algorithm for Büchi Automata Based on Family of DFAs and Classification Trees

Chen

Zhang

et al. 2017

Tools and Algorithms for the Construction and Analysis of Systems

Self Cite

View full text Add to dashboard Cite

Abstract. In this paper, we propose a novel algorithm to learn a Büchi automaton from a teacher who knows an ω-regular language. The algorithm is based on learning a formalism named family of DFAs (FDFAs) recently proposed by Angluin and Fisman [10]. The main catch is that we use a classification tree structure instead of the standard observation table structure. The worst case storage space required by our algorithm is quadratically better than the table-based algorithm proposed in [10]. We implement the first publicly available library ROLL (Regular Omega Language Learning), which consists of all ω-regular learning algorithms available in the literature and the new algorithms proposed in this paper. Experimental results show that our tree-based algorithms have the best performance among others regarding the number of solved learning tasks.

show abstract

Advanced Ramsey-Based Büchi Automata Inclusion Testing

Cited by 39 publications

References 17 publications

Buffered Simulation Games for Büchi Automata

Buffered Simulation Games for Büchi Automata

On Timed Scope-Bounded Context-Sensitive Languages

A Novel Learning Algorithm for Büchi Automata Based on Family of DFAs and Classification Trees

Contact Info

Product

Resources

About