Matteo Mio  Home Page
Email: miomatteo@gmail.com
Address: Office FS17, William Gates Building, J. J. Thomson Avenue, Cambridge CB3 0FD, England.
About me:
Postdoctoral researcher, Computer Laboratory  University of Cambridge. My position is supported by the ECSYM advanced grant from ERC of Prof. Glynn Winskel.Previously: [03/201202/2013] PostDoc position at CWI, Amsterdam, within the Formal Methods Group. [02/201203/2013] PostDoc position at LIXÉcole Polytechnique, within the group Comète. [11/200702/2012] PhD student, Laboratory for Foundations of Computer Science (LFCS), University of Edinburgh. For more information about me, have a look at my short CV (last update: 19th December 2013).
Recent Events/Talks:
[01/03/2014] I started my new PostDoc at the Computer Laboratory, University of Cambridge. [02/02/2014] I'm visiting the Automata Theory Group of the University of Warsaw. [29/11/2013] I'm giving a talk at LIAFA, Université Paris Diderot [slides here]. [13/11/2013] I'm giving a talk at the Software Modeling and Verification group of RWTH Aachen University [slides here]. [20/10/201307/11/2013] I'm visiting the Automata Theory Group of the University of Warsaw. [17/10/2013] I'm giving a talk at Chocola seminar (ENS Lyon) on my recent work on quantitative logics (slides here) [12/09/2013] Invited speaker at ISTAustria, Thomas Henzinger's group (slides PDF). [03/09/2013] Ackermann Lecture at CSL 2013 (slides PDF). [01/09/2013] I'm presenting the paper "Łukasiewicz μcalculus" (EPTCS) at the FICS 2013 workshop.
[14/06/2013] I am the recipient of the EACSL Ackermann Award 2013, for my PhD thesis work.
My Research
I'm interested in temporal logics for expressing properties of probabilistic concurrent systems (PLTS's). Most of my research concerned: theoretical investigations on fixedpoint logics (μcalculi) for PLTS's; design of (sequent calculus style) proofsystems for (humanaided) verification of properties of PLTS's; research on twoplayer stochastic games.
PhD Thesis: "Game Semantics for Probabilistic μCalculi", University of Edinburgh, 2012. (Last revision: March 2012. PDF, PS, DVI, URL)
>> EACSL Ackermann Award 2013 "Outstanding Dissertation Award for Logic in Computer Science" (Official report: link).
A 10 pages description of the thesis is available at this link.
 M. Mio, "UpperExpectation Bisimilarity and Łukasiewicz μcalculus", to appear in proceedings of FoSSaCS 2014. (Preprint).
 M. Mio, A. Simpson, "A Proof System for Compositional Verification
of Probabilistic Concurrent Processes", proceedings of FoSSaCS 2013. (Springer, Preprint)
 M. Mio, "Probabilistic Modal μCalculus with Independent Product", in Logical Methods in Computer Science, Volume 8, Issue 4, 2012. (ArXiv:1211.1511)
>> Journal version of my FoSSaCS 2011 paper.
 M. Mio, "On the Equivalence of Game and Denotational Semantics for the Probabilistic μCalculus", in Logical Methods in Computer Science,
Volume 8, Issue 2, 2012. (ArXiv:1205.0126)
>> Journal version of my FICS 2010 paper.
 M. Mio, "Probabilistic Modal μCalculus with Independent Product", proceedings of FoSSaCS 2011. (Springer, Preprint)
>> ETAPS 2011 best student paper award. Read more.
 S. Crafa, M. Miculan, M. Mio, C. Piazza, and S. Rossi, "PiCNIC  Pi Calculus Non Interference Checker", Proceeding of ACSD 2008. (IEEE, Preprint).
Workshop papers:
 M. Mio, Alex Simpson, "Łukasiewicz μcalculus", FICS Workshop, 2013. (EPTCS)
 M. Mio, "The Equivalence of Game and Denotational Semantics for the Probabilistic μCalculus", FICS Workshop, 2010 (PDF)
 M. Mio, "Product and CoProduct of TwoPlayer Stochastic Games", GPMFV Workshop, Brno (Czech Republic), 2010. (PDF)
 M. Mio, "A Proof System for Reasoning About Probabilistic Concurrent Processes", PSPL Workshop, Edinburgh (Scotland, UK), 2010. (PDF)
Drafts/Preprints/Papers under Review: M. Mio and A. Simpson, "Łukasiewicz μcalculus", in Fundamenta Informaticae, invited contribution submitted to special issue on selected papers from the FICS 2013 workshop, 2014 (PDF). A draft about my recent work on mathematical foundations of probabilistic nondeterministic systems based on Function Analysis is available in the arXiv [arXiv:1310.0768]. A shorter version will appear in the proceedings of FoSSaCS 2014 (see my Conference papers above).

