Search

• < Previous
• 1
• Next >

---

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 have been studied for this logic, both assigning to every process state a value in the interval [0,1] representing the&nbsp;[&hellip;]

---

Probabilistic modal {\mu}-calculus with independent product

Matteo Mio.

The probabilistic modal {\mu}-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&nbsp;[&hellip;]

---

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 are then used to obtain completely syntactic proofs of some interesting results concerning the two theories. Most&nbsp;[&hellip;]

---