default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLuis María Ferrer Fioriti
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
[j3]Hassan Hatefi, Ralf Wimmer
, Bettina Braitling, Luis María Ferrer Fioriti, Bernd Becker, Holger Hermanns:
Cost vs. time in stochastic games and Markov automata. Formal Aspects Comput. 29(4): 629-649 (2017)- 2016
- [j2]Luis María Ferrer Fioriti, Vahid Hashemi, Holger Hermanns, Andrea Turrini:
Deciding probabilistic automata weak bisimulation: theory and practice. Formal Aspects Comput. 28(1): 109-143 (2016) - [c10]Gilles Barthe, Thomas Espitau, Luis María Ferrer Fioriti, Justin Hsu:
Synthesizing Probabilistic Invariants via Doob's Decomposition. CAV (1) 2016: 43-61 - [c9]Rayna Dimitrova, Luis María Ferrer Fioriti, Holger Hermanns, Rupak Majumdar:
Probabilistic CTL*: The Deductive Way. TACAS 2016: 280-296 - [i1]Gilles Barthe, Thomas Espitau, Luis María Ferrer Fioriti, Justin Hsu:
Synthesizing Probabilistic Invariants via Doob's Decomposition. CoRR abs/1605.02765 (2016) - 2015
- [c8]Luis María Ferrer Fioriti, Holger Hermanns:
Probabilistic Termination: Soundness, Completeness, and Compositionality. POPL 2015: 489-501 - [c7]Hassan Hatefi, Bettina Braitling, Ralf Wimmer, Luis María Ferrer Fioriti, Holger Hermanns, Bernd Becker:
Cost vs. Time in Stochastic Games and Markov Automata. SETTA 2015: 19-34 - [c6]Bettina Braitling, Luis María Ferrer Fioriti, Hassan Hatefi, Ralf Wimmer, Bernd Becker, Holger Hermanns:
Abstraction-Based Computation of Reward Measures for Markov Automata. VMCAI 2015: 172-189 - 2014
- [j1]Sergio Giro, Pedro R. D'Argenio, Luis María Ferrer Fioriti:
Distributed probabilistic input/output automata: Expressiveness, (un)decidability and algorithms. Theor. Comput. Sci. 538: 84-102 (2014) - [c5]Bettina Braitling, Luis María Ferrer Fioriti, Hassan Hatefi, Ralf Wimmer, Bernd Becker, Holger Hermanns:
MeGARA: Menu-based Game Abstraction and Abstraction Refinement of Markov Automata. QAPL 2014: 48-63 - 2012
- [c4]Luis María Ferrer Fioriti, Ernst Moritz Hahn, Holger Hermanns, Björn Wachter:
Variable Probabilistic Abstraction Refinement. ATVA 2012: 300-316 - [c3]Luis María Ferrer Fioriti, Holger Hermanns:
Heuristics for Probabilistic Timed Automata with Abstraction Refinement. MMB/DFT 2012: 151-165 - 2011
- [c2]Jonathan Bogdoll, Luis María Ferrer Fioriti, Arnd Hartmanns, Holger Hermanns:
Partial Order Methods for Statistical Model Checking and Simulation. FMOODS/FORTE 2011: 59-74
2000 – 2009
- 2009
- [c1]Sergio Giro, Pedro R. D'Argenio, Luis María Ferrer Fioriti:
Partial Order Reduction for Probabilistic Systems: A Revision for Distributed Schedulers. CONCUR 2009: 338-353
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 22:50 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:
