3 citations · 12 across the 15 of their papers we have counts for
6 papers · 1 filter
Simulations in Rank-Based Büchi Automata Complementation (Technical Report)
Yu-Fang Chen, Vojtěch Havlena, Ondřej Lengál
Complementation of Büchi automata is an essential technique used in some approaches for termination analysis of programs. The long search for an optimal complementation constructio…
Register automata with linear arithmetic
Yu-Fang Chen, Ondrej Lengal, Tony Tan +1
We propose a novel automata model over the alphabet of rational numbers, which we call register automata over the rationals (RA-Q). It reads a sequence of rational numbers and outp…
A Novel Learning Algorithm for Büchi Automata based on Family of DFAs and Classification Trees
Yong Li, Yu-Fang Chen, Lijun Zhang +1
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…
The Commutativity Problem of the MapReduce Framework: A Transducer-based Approach
Yu-Fang Chen, Lei Song, Zhilin Wu
MapReduce is a popular programming model for data parallel computation. In MapReduce, the reducer produces an output from a list of inputs. Due to the scheduling policy of the plat…
A Finite Exact Representation of Register Automata Configurations
Yu-Fang Chen, Bow-Yaw Wang, Di-De Yen
A register automaton is a finite automaton with finitely many registers ranging from an infinite alphabet. Since the valuations of registers are infinite, there are infinitely many…
Proceedings 12th International Workshop on Verification of Infinite-State Systems
Yu-Fang Chen, Ahmed Rezine
The aim of the INFINITY workshop is to provide a forum for researchers interested in the development of formal methods and algorithmic techniques for the analysis of systems with i…