Zobrazeno 1 - 10
of 59
pro vyhledávání: '"MIO, MATTEO"'
Publikováno v:
Logical Methods in Computer Science, Volume 20, Issue 4 (December 3, 2024) lmcs:12339
We present a generalisation of the theory of quantitative algebras of Mardare, Panangaden and Plotkin where (i) the carriers of quantitative algebras are not restricted to be metric spaces and can be arbitrary fuzzy relations or generalised metric sp
Externí odkaz:
http://arxiv.org/abs/2304.14361
The framework of quantitative equational logic has been successfully applied to reason about algebras whose carriers are metric spaces and operations are nonexpansive. We extend this framework in two orthogonal directions: algebras endowed with gener
Externí odkaz:
http://arxiv.org/abs/2201.09087
We study monads resulting from the combination of nondeterministic and probabilistic behaviour with the possibility of termination, which is essential in program semantics. Our main contributions are presentation results for the monads, providing equ
Externí odkaz:
http://arxiv.org/abs/2012.00382
Autor:
Mio, Matteo, Vignudelli, Valeria
The monad of convex sets of probability distributions is a well-known tool for modelling the combination of nondeterministic and probabilistic computational effects. In this work we lift this monad from the category of sets to the category of metric
Externí odkaz:
http://arxiv.org/abs/2005.07509
Autor:
Lucas, Christophe, Mio, Matteo
Publikováno v:
Logical Methods in Computer Science, Volume 18, Issue 1 (February 17, 2022) lmcs:6428
We design hypersequent calculus proof systems for the theories of Riesz spaces and modal Riesz spaces and prove the key theorems: soundness, completeness and cut elimination. These are then used to obtain completely syntactic proofs of some interesti
Externí odkaz:
http://arxiv.org/abs/2004.11185
Publikováno v:
Logical Methods in Computer Science, Volume 16, Issue 1 (January 27, 2020) lmcs:5306
We introduce a novel real-valued endogenous logic for expressing properties of probabilistic transition systems called Riesz modal logic. The design of the syntax and semantics of this logic is directly inspired by the theory of Riesz spaces, a matur
Externí odkaz:
http://arxiv.org/abs/1903.09463
Publikováno v:
Logical Methods in Computer Science, Volume 14, Issue 2, Automata and logic (April 10, 2018) lmcs:3148
We investigate the extension of Monadic Second Order logic, interpreted over infinite words and trees, with generalized "for almost all" quantifiers interpreted using the notions of Baire category and Lebesgue measure.
Externí odkaz:
http://arxiv.org/abs/1702.04769
Publikováno v:
EPTCS 223, 2016, pp. 1-23
Subzero automata is a class of tree automata whose acceptance condition can express probabilistic constraints. Our main result is that the problem of determining if a subzero automaton accepts some regular tree is decidable.
Comment: In Proceedi
Comment: In Proceedi
Externí odkaz:
http://arxiv.org/abs/1608.03319
Autor:
Mio, Matteo
The probabilistic (or quantitative) modal μ-calculus is a fixed-point logic designed for expressing properties of probabilistic labeled transition systems (PLTS’s). Two semantics have been studied for this logic, both assigning to every process st
Externí odkaz:
http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.563751
Autor:
Michalewski, Henryk, Mio, Matteo
We consider the problem of computing the probability of regular languages of infinite trees with respect to the natural coin-flipping measure. We propose an algorithm which computes the probability of languages recognizable by \emph{game automata}. I
Externí odkaz:
http://arxiv.org/abs/1510.01640