default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMatteo Mio
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2022
[j8]Christophe Lucas, Matteo Mio:
Proof Theory of Riesz Spaces and Modal Riesz Spaces. Log. Methods Comput. Sci. 18(1) (2022)- 2020
- [j7]Robert Furber
, Radu Mardare, Matteo Mio:
Probabilistic logics based on Riesz spaces. Log. Methods Comput. Sci. 16(1) (2020) - 2018
- [j6]Matteo Mio, Michal Skrzypczak, Henryk Michalewski:
Monadic Second Order Logic with Measure and Category Quantifiers. Log. Methods Comput. Sci. 14(2) (2018) - 2017
- [j5]Matteo Mio:
Regular Languages of Infinite Trees and Probability. FLAP 4(10): 3505-3516 (2017) - [j4]Matteo Mio, Alex Simpson:
Łukasiewicz μ-calculus. Fundam. Informaticae 150(3-4): 317-346 (2017) - [j3]Tomasz Gogacz, Henryk Michalewski, Matteo Mio, Michal Skrzypczak:
Measure properties of regular sets of trees. Inf. Comput. 256: 108-130 (2017) - 2012
- [j2]Matteo Mio:
On the equivalence of game and denotational semantics for the probabilistic mu-calculus. Log. Methods Comput. Sci. 8(2) (2012) - [j1]Matteo Mio:
Probabilistic modal μ-calculus with independent product. Log. Methods Comput. Sci. 8(4) (2012)
Conference and Workshop Papers
- 2022
- [c19]Matteo Mio, Ralph Sarkis, Valeria Vignudelli:
Beyond Nonexpansive Operations in Quantitative Algebraic Reasoning. LICS 2022: 52:1-52:13 - 2021
- [c18]Christophe Lucas, Matteo Mio:
Free Modal Riesz Spaces are Archimedean: A Syntactic Proof. RAMiCS 2021: 275-291 - [c17]Matteo Mio, Ralph Sarkis, Valeria Vignudelli:
Combining Nondeterminism, Probability, and Termination: Equational and Metric Reasoning. LICS 2021: 1-14 - 2020
- [c16]Matteo Mio, Valeria Vignudelli:
Monads and Quantitative Equational Theories for Nondeterminism and Probability. CONCUR 2020: 28:1-28:18 - 2019
- [c15]Christophe Lucas, Matteo Mio:
Towards a Structural Proof Theory of Probabilistic \mu -Calculi. FoSSaCS 2019: 418-435 - 2018
- [c14]Matteo Mio:
Riesz Modal Logic with Threshold Operators. LICS 2018: 710-719 - 2017
- [c13]Matteo Mio, Robert Furber, Radu Mardare:
Riesz Modal logic for Markov processes. LICS 2017: 1-12 - 2016
- [c12]Henryk Michalewski, Matteo Mio:
Measure Quantifier in Monadic Second Order Logic. LFCS 2016: 267-282 - [c11]Henryk Michalewski, Matteo Mio, Mikolaj Bojanczyk:
On the Regular Emptiness Problem of Subzero Automata. ICE 2016: 1-23 - 2015
- [c10]Henryk Michalewski, Matteo Mio:
On the Problem of Computing the Probability of Regular Sets of Trees. FSTTCS 2015: 489-502 - [c9]Henryk Michalewski, Matteo Mio:
Baire Category Quantifier in Monadic Second Order Logic. ICALP (2) 2015: 362-374 - 2014
- [c8]Matteo Mio:
Upper-Expectation Bisimilarity and Łukasiewicz μ-Calculus. FoSSaCS 2014: 335-350 - [c7]Tomasz Gogacz, Henryk Michalewski, Matteo Mio, Michal Skrzypczak:
Measure Properties of Game Tree Languages. MFCS (1) 2014: 303-314 - 2013
- [c6]Matteo Mio, Alex Simpson:
A Proof System for Compositional Verification of Probabilistic Concurrent Processes. FoSSaCS 2013: 161-176 - [c5]Matteo Mio, Alex Simpson:
Łukasiewicz mu-Calculus. FICS 2013: 87-104 - 2011
- [c4]Matteo Mio:
Probabilistic Modal μ-Calculus with Independent Product. FoSSaCS 2011: 290-304 - 2010
- [c3]Matteo Mio:
The Equivalence of Game and Denotational Semantics for the Probabilistic mu-Calculus. FICS 2010: 53-59 - [c2]Matteo Mio:
A Proof System for Reasoning about Probabilistic Concurrent Processes. PSPL@LICS 2010: 8-11 - 2008
- [c1]Silvia Crafa, Matteo Mio, Marino Miculan, Carla Piazza, Sabina Rossi:
PicNIc - Pi-calculus non-interference checker. ACSD 2008: 33-38
Editorship
- 2015
- [e1]Ralph Matthes, Matteo Mio:
Proceedings Tenth International Workshop on Fixed Points in Computer Science, FICS 2015, Berlin, Germany, September 11-12, 2015. EPTCS 191, 2015 [contents]
Informal and Other Publications
- 2023
- [i10]Matteo Mio, Ralph Sarkis, Valeria Vignudelli:
Universal Algebra for Generalised Metric Spaces. CoRR abs/2304.14361 (2023) - 2022
- [i9]Matteo Mio, Ralph Sarkis, Valeria Vignudelli:
Beyond Nonexpansive Operations in Quantitative Algebraic Reasoning. CoRR abs/2201.09087 (2022) - 2020
- [i8]Christophe Lucas, Matteo Mio:
Proof Theory of Riesz Spaces and Modal Riesz Spaces. CoRR abs/2004.11185 (2020) - [i7]Matteo Mio, Valeria Vignudelli:
Monads and Quantitative Equational Theories for Nondeterminism and Probability. CoRR abs/2005.07509 (2020) - [i6]Matteo Mio, Ralph Sarkis, Valeria Vignudelli:
Combining nondeterminism, probability, and termination: equational and metric reasoning. CoRR abs/2012.00382 (2020) - 2019
- [i5]Robert Furber, Radu Mardare, Matteo Mio:
Probabilistic logics based on Riesz spaces. CoRR abs/1903.09463 (2019) - 2017
- [i4]Henryk Michalewski, Matteo Mio, Michal Skrzypczak:
Monadic Second Order Logic with Measure and Category Quantifiers. CoRR abs/1702.04769 (2017) - 2015
- [i3]Matteo Mio, Alex K. Simpson:
Łukasiewicz μ-calculus. CoRR abs/1510.00797 (2015) - [i2]Henryk Michalewski, Matteo Mio:
On the Problem of Computing the Probability of Regular Sets of Trees. CoRR abs/1510.01640 (2015) - 2013
- [i1]Matteo Mio:
Upper-Expectation Bisimilarity and Real-valued Modal Logics. CoRR abs/1310.0768 (2013)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
