8 citations · 27 across the 10 of their papers we have counts for
12 papers
Computing Fixed Points using Dependency Oracles
Giorgio Bacci, Giovanni Bacci, Kim G. Larsen +1
We present global and local algorithms for solving systems of equations over Noetherian posets with a bottom element, a general setting underlying many verification problems. Our a…
MM Algorithms to Estimate Parameters in Continuous-time Markov Chains
Giovanni Bacci, Anna Ingólfsdóttir, Kim G. Larsen +1
Continuous-time Markov chains (CTMCs) are popular modeling formalism that constitutes the underlying semantics for real-time probabilistic systems such as queuing networks, stochas…
Active Learning of Markov Decision Processes using Baum-Welch algorithm (Extended)
Giovanni Bacci, Anna Ingólfsdóttir, Kim Larsen +1
Cyber-physical systems (CPSs) are naturally modelled as reactive systems with nondeterministic and probabilistic dynamics. Model-based verification techniques have proved effective…
Efficient Local Computation of Differential Bisimulations via Coupling and Up-to Methods
Giorgio Bacci, Giovanni Bacci, Kim G. Larsen +3
We introduce polynomial couplings, a generalization of probabilistic couplings, to develop an algorithm for the computation of equivalence relations which can be interpreted as a l…
Approximating Euclidean by Imprecise Markov Decision Processes
Manfred Jaeger, Giorgio Bacci, Giovanni Bacci +2
Euclidean Markov decision processes are a powerful tool for modeling control problems under uncertainty over continuous domains. Finite state imprecise, Markov decision processes c…
Computing Probabilistic Bisimilarity Distances for Probabilistic Automata
Giorgio Bacci, Giovanni Bacci, Kim G. Larsen +3
The probabilistic bisimilarity distance of Deng et al. has been proposed as a robust quantitative generalization of Segala and Lynch's probabilistic bisimilarity for probabilistic…