29 citations · 149 across the 31 of their papers we have counts for
8 papers · 1 filter
Divide-and-Conquer Determinization of Büchi Automata based on SCC Decomposition
Yong Li, Andrea Turrini, Weizhi Feng +2
The determinization of a nondeterministic Büchi automaton (NBA) is a fundamental construction of automata theory, with applications to probabilistic verification and reactive synth…
On the Power of Finite Ambiguity in Büchi Complementation
Weizhi Feng, Yong Li, Andrea Turrini +2
In this work, we exploit the power of \emph{finite ambiguity} for the complementation problem of Büchi automata by using reduced run directed acyclic graphs (DAGs) over infinite wo…
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…
Verifying Probabilistic Timed Automata Against Omega-Regular Dense-Time Properties
Hongfei Fu, Yi Li, Jianlin Li +1
Probabilistic timed automata (PTAs) are timed automata (TAs) extended with discrete probability distributions.They serve as a mathematical model for a wide range of applications th…
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…
Distribution-based Bisimulation and Bisimulation Metric in Probabilistic Automata
Yuan Feng, Lei Song, Lijun Zhang
Probabilistic automata were introduced by Rabin in 1963 as language acceptors. Two automata are equivalent if and only if they accept each word with the same probability. On the ot…
Late Weak Bisimulation for Markov Automata
Christian Eisentraut, Jens Chr. Godskesen, Holger Hermanns +2
Weak bisimilarity is a distribution-based equivalence notion for Markov automata. It has gained some popularity as the coarsest reasonable behavioural equivalence on Markov automat…