#### Filter Results:

- Full text PDF available (13)

#### Publication Year

2008

2017

- This year (4)
- Last 5 years (17)
- Last 10 years (21)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Matteo Mio
- Logical Methods in Computer Science
- 2012

The probabilistic (or quantitative) modal μ-calculus is a fixed-point logic designed for expressing properties of probabilistic labeled transition systems (PLTS). Two semantics have been studied for this logic, both assigning to every process state a value in the interval [0, 1] representing the probability that the property expressed by the formula holds… (More)

- Matteo Mio
- FOSSACS
- 2011

The probabilistic modal μ-calculus is a fixed-point logic designed for expressing properties of probabilistic labeled transition systems (PLTS’s). Two equivalent semantics have been studied for this logic, both assigning to each state a value in the interval [0, 1] representing the probability that the property expressed by the formula holds at the state.… (More)

- Matteo Mio
- FoSSaCS
- 2014

- Matteo Mio, Alex K. Simpson
- FICS
- 2013

- Henryk Michalewski, Matteo Mio
- ICALP
- 2015

- Matteo Mio, Alex K. Simpson
- Fundam. Inform.
- 2017

The paper explores properties of Łukasiewicz μ-calculus, a version of the quantitative/probabilistic modal μ-calculus containing both weak and strong conjunctions and disjunctions from Łukasiewicz (fuzzy) logic. We show that this logic encodes the well-known probabilistic temporal logic PCTL. And we give a model-checking algorithm for computing the rational… (More)

- Matteo Mio, Alex K. Simpson
- FoSSaCS
- 2013

We present a formal proof system for compositional verification of probabilistic concurrent processes. Processes are specified using an SOS-style process algebra with probabilistic operators. Properties are expressed using a probabilistic modal μ-calculus. And the proof system is formulated as a sequent calculus in which sequents are given a quantitative… (More)

- Henryk Michalewski, Matteo Mio
- LFCS
- 2016

- Henryk Michalewski, Matteo Mio
- FSTTCS
- 2015

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 game automata. In particular this algorithm is applicable to all deterministic automata. We then use the algorithm to prove through… (More)