Zobrazeno 1 - 10
of 82
pro vyhledávání: '"Turrini, Andrea"'
Model-checking techniques have been extended to analyze quantum programs and communication protocols represented as quantum Markov chains, an extension of classical Markov chains. To specify qualitative temporal properties, a subspace-based quantum t
Externí odkaz:
http://arxiv.org/abs/2405.05825
In this paper, we propose an approximating framework for analyzing parametric Markov models. Instead of computing complex rational functions encoding the reachability probability and the reward values of the parametric model, we exploit the scenario
Externí odkaz:
http://arxiv.org/abs/2304.08330
Case split is a core proof rule in current decision procedures for the theory of string constraints. Its use is the primary cause of the state space explosion in string constraint solving, since it is the only rule that creates branches in the proof
Externí odkaz:
http://arxiv.org/abs/2303.01142
Complementation of nondeterministic B\"uchi automata (BAs) is an important problem in automata theory with numerous applications in formal verification, such as termination analysis of programs, model checking, or in decision procedures of some logic
Externí odkaz:
http://arxiv.org/abs/2301.01890
The determinization of a nondeterministic B\"uchi automaton (NBA) is a fundamental construction of automata theory, with applications to probabilistic verification and reactive synthesis. The standard determinization constructions, such as the ones b
Externí odkaz:
http://arxiv.org/abs/2206.13739
In this work, we exploit the power of \emph{finite ambiguity} for the complementation problem of B\"uchi automata by using reduced run directed acyclic graphs (DAGs) over infinite words, in which each vertex has at most one predecessor; these reduced
Externí odkaz:
http://arxiv.org/abs/2109.12828
We revisit here congruence relations for B\"uchi automata, which play a central role in the automata-based verification. The size of the classical congruence relation is in $3^{\mathcal{O}(n^2)}$, where $n$ is the number of states of a given B\"uchi
Externí odkaz:
http://arxiv.org/abs/2104.03555
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 tools it is better to pursue them at the same time. While this is well-u
Externí odkaz:
http://arxiv.org/abs/2007.02282
Publikováno v:
In The Journal of Systems & Software July 2023 201
Publikováno v:
In Information and Computation June 2023 292