Zobrazeno 1 - 10
of 121
pro vyhledávání: '"Bacci, Giorgio"'
In this paper, we study Polynomial Lawvere logic (PL), a logic on the quantale of the extended positive reals, developed for reasoning about metric spaces. PL is appropriate for encoding quantitative reasoning principles, such as quantitative equatio
Externí odkaz:
http://arxiv.org/abs/2402.03543
Publikováno v:
Electronic Notes in Theoretical Informatics and Computer Science, Volume 3 - Proceedings of MFPS XXXIX (November 23, 2023) entics:12292
Lawvere showed that generalised metric spaces are categories enriched over $[0, \infty]$, the quantale of the positive extended reals. The statement of enrichment is a quantitative analogue of being a preorder. Towards seeking a logic for quantitativ
Externí odkaz:
http://arxiv.org/abs/2302.01224
Inspired by the seminal work of Hyland, Plotkin, and Power on the combination of algebraic computational effects via sum and tensor, we develop an analogous theory for the combination of quantitative algebraic effects. Quantitative algebraic effects
Externí odkaz:
http://arxiv.org/abs/2212.11784
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
Publikováno v:
EPTCS 312, 2020, pp. 29-42
When modeling concurrent or cyber-physical systems, non-functional requirements such as time are important to consider. In order to improve the timing aspects of a model, it is necessary to have some notion of what it means for a process to be faster
Externí odkaz:
http://arxiv.org/abs/1810.11243
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:
Pedersen, Mathias Ruggaard, Fijalkow, Nathanaël, Bacci, Giorgio, Larsen, Kim Guldstrand, Mardare, Radu
Semi-Markov processes are Markovian processes in which the firing time of the transitions is modelled by probabilistic distributions over positive reals interpreted as the probability of firing a transition at a certain moment in time. In this paper
Externí odkaz:
http://arxiv.org/abs/1711.10216
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