4 citations · 5 across the 3 of their papers we have counts for
5 papers
Congruence Relations for Büchi Automata
Yong Li, Yih-Kuen Tsay, Andrea Turrini +2
We revisit here congruence relations for Büchi automata, which play a central role in the automata-based verification. The size of the classical congruence relation is in $3^{\math…
Proving Non-Inclusion of Büchi Automata based on Monte Carlo Sampling
Yong Li, Andrea Turrini, Xuechao Sun +1
The search for a proof of correctness and the search for counterexamples (bugs) are complementary aspects of verification. In order to maximize the practical use of verification to…
On the Power of Unambiguity in Büchi Complementation
Yong Li, Moshe Y. Vardi, Lijun Zhang
In this work, we exploit the power of \emph{unambiguity} for the complementation problem of Büchi automata by utilizing reduced run directed acyclic graphs (DAGs) over infinite wor…
Hybrid Compositional Reasoning for Reactive Synthesis from Finite-Horizon Specifications
Suguman Bansal, Yong Li, Lucas M. Tabajara +1
LTLf synthesis is the automated construction of a reactive system from a high-level description, expressed in LTLf, of its finite-horizon behavior. So far, the conversion of LTLf f…
An Efficient Synthesis Algorithm for Parametric Markov Chains Against Linear Time Properties
Yong Li, Wanwei Liu, Andrea Turrini +2
In this paper, we propose an efficient algorithm for the parameter synthesis of PLTL formulas with respect to parametric Markov chains. The PLTL formula is translated to an almost…