Zobrazeno 1 - 10
of 247
pro vyhledávání: '"Bacci, Giovanni"'
Continuous-time Markov chains (CTMCs) are popular modeling formalism that constitutes the underlying semantics for real-time probabilistic systems such as queuing networks, stochastic process algebras, and calculi for systems biology. Prism and Storm
Externí odkaz:
http://arxiv.org/abs/2302.08588
Cyber-physical systems (CPSs) are naturally modelled as reactive systems with nondeterministic and probabilistic dynamics. Model-based verification techniques have proved effective in the deployment of safety-critical CPSs. Central for a successful a
Externí odkaz:
http://arxiv.org/abs/2110.03014
Autor:
Bacci, Giorgio, Bacci, Giovanni, Larsen, Kim G., Tribastone, Mirco, Tschaikowski, Max, Vandin, Andrea
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 lifting of probabilistic bisimulation to polynomial differential equati
Externí odkaz:
http://arxiv.org/abs/2104.13160
Euclidean Markov decision processes are a powerful tool for modeling control problems under uncertainty over continuous domains. Finite state imprecise, Markov decision processes can be used to approximate the behavior of these infinite models. In th
Externí odkaz:
http://arxiv.org/abs/2006.14923
Autor:
Bacci, Giorgio, Bacci, Giovanni, Larsen, Kim G., Mardare, Radu, Tang, Qiyi, van Breugel, Franck
Publikováno v:
Logical Methods in Computer Science, Volume 17, Issue 1 (February 2, 2021) lmcs:5994
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 automata. In this paper, we present a characterization of the bisimila
Externí odkaz:
http://arxiv.org/abs/1907.01768
Automata learning techniques automatically generate system models from test observations. These techniques usually fall into two categories: passive and active. Passive learning uses a predetermined data set, e.g., system logs. In contrast, active le
Externí odkaz:
http://arxiv.org/abs/1906.12239
Autor:
Bacci, Giovanni1 (AUTHOR) giovanni.bacci@unibo.it, Bozzola, Marco2 (AUTHOR) marco@relio.it, Gaiani, Marco1 (AUTHOR) marco.gaiani@unibo.it, Garagnani, Simone1 (AUTHOR)
Publikováno v:
Heritage (2571-9408). Sep2023, Vol. 6 Issue 9, p6422-6450. 29p.
In this paper, we address the approximate minimization problem of Markov Chains (MCs) from a behavioral metric-based perspective. Specifically, given a finite MC and a positive integer k, we are looking for an MC with at most k states having minimal
Externí odkaz:
http://arxiv.org/abs/1806.00528
Autor:
Bacci, Giovanni, Bouyer, Patricia, Fahrenberg, Uli, Larsen, Kim G., Markey, Nicolas, Reynier, Pierre-Alain
In this paper, we propose a novel framework for the synthesis of robust and optimal energy-aware controllers. The framework is based on energy timed automata, allowing for easy expression of timing constraints and variable energy rates. We prove deci
Externí odkaz:
http://arxiv.org/abs/1805.00847
Publikováno v:
Logical Methods in Computer Science, Volume 13, Issue 2 (June 30, 2017) lmcs:3753
We propose a distance between continuous-time Markov chains (CTMCs) and study the problem of computing it by comparing three different algorithmic methodologies: iterative, linear program, and on-the-fly. In a work presented at FoSSaCS'12, Chen et al
Externí odkaz:
http://arxiv.org/abs/1702.08306