31 citations · 69 across the 15 of their papers we have counts for
16 papers
Compact Quantitative Equational Theories as Monad Restrictions
Matteo Mio, Colin Riba
Proofs in quantitative algebra are, generally, infinite objects due to the presence of infinitary rules in the deductive apparatus. A quantitative equational theory is called compa…
Universal Quantitative Algebra for Fuzzy Relations and Generalised Metric Spaces
Matteo Mio, Ralph Sarkis, Valeria Vignudelli
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 metri…
Beyond Nonexpansive Operations in Quantitative Algebraic Reasoning
Matteo Mio, Ralph Sarkis, Valeria Vignudelli
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 th…
Combining nondeterminism, probability, and termination: equational and metric reasoning
Matteo Mio, Ralph Sarkis, Valeria Vignudelli
We study monads resulting from the combination of nondeterministic and probabilistic behaviour with the possibility of termination, which is essential in program semantics. Our mai…
Monads and Quantitative Equational Theories for Nondeterminism and Probability
Matteo Mio, Valeria Vignudelli
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 w…
Proof Theory of Riesz Spaces and Modal Riesz Spaces
Christophe Lucas, Matteo Mio
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…
Probabilistic logics based on Riesz spaces
Robert Furber, Radu Mardare, Matteo Mio
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…
Monadic Second Order Logic with Measure and Category Quantifiers
Matteo Mio, Michał Skrzypczak, Henryk Michalewski
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 o…
On the Regular Emptiness Problem of Subzero Automata
Henryk Michalewski, Matteo Mio, Mikołaj Bojańczyk
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 autom…
On the Problem of Computing the Probability of Regular Sets of Trees
Henryk Michalewski, Matteo Mio
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 compute…
Łukasiewicz μ-calculus
Matteo Mio, Alex Simpson
The paper explores properties of the Łukasiewicz μ-calculus, or Łμ for short, an extension of Łukasiewicz logic with scalar multiplication and least and greatest fixed-point operat…
Proceedings Tenth International Workshop on Fixed Points in Computer Science
Ralph Matthes, Matteo Mio
This volume contains the proceedings of the Tenth International Workshop on Fixed Points in Computer Science (FICS 2015) which took place on September 11th and 12th, 2015 in Berlin…
Upper-Expectation Bisimilarity and Real-valued Modal Logics
Matteo Mio
Several notions of bisimulation relations for probabilistic non-deterministic transition systems have been considered in the literature. We consider a novel testing-based behaviora…
Łukasiewicz mu-Calculus
Matteo Mio, Alex Simpson
The paper explores properties of Łukasiewicz mu-calculus, a version of the quantitative/probabilistic modal mu-calculus containing both weak and strong conjunctions and disjunction…
Probabilistic modal μ-calculus with independent product
Matteo Mio
The probabilistic modal μ-calculus is a fixed-point logic designed for expressing properties of probabilistic labeled transition systems (PLTS's). Two equivalent semantics have bee…
On the equivalence of game and denotational semantics for the probabilistic mu-calculus
Matteo Mio
The probabilistic (or quantitative) modal mu-calculus is a fixed-point logic de- signed for expressing properties of probabilistic labeled transition systems (PLTS). Two semantics…