Quantitative Model Checking Revisited: Neither Decidable Nor Approximable. - Sergio Giro; Pedro R. D'Argenio (FORMATS, 2007)

Partial Order Reduction for Probabilistic Systems: A Revision for Distributed Schedulers. - Sergio Giro; Pedro R. D'Argenio; Luis María Ferrer Fioriti (CONCUR, 2009)

On the verification of probabilistic I/O automata with unspecified rates. - Sergio Giro; Pedro R. D'Argenio (SAC, 2009)

Undecidability Results for Distributed Probabilistic Systems. - Sergio Giro (SBMF, 2009)

On the Expressive Power of Schedulers in Distributed Probabilistic Systems. - Sergio Giro; Pedro R. D'Argenio (QAPL, 2009)

An algorithmic approximation of the infimum reachability probability for Probabilistic Finite Automata - Sergio Giro (CoRR, 2010)

Verification of Partial-Information Probabilistic Systems Using Counterexample-Guided Refinements. - Sergio Giro; Markus N. Rabe (ATVA, 2012)

Efficient computation of exact solutions for quantitative model checking - Sergio Giro (QAPL, 2012)

Optimal schedulers vs optimal bases: An approach for efficient exact solving of Markov decision processes. - Sergio Giro (Theor. Comput. Sci., 2014)

Distributed probabilistic input/output automata: Expressiveness, (un)decidability and algorithms. - Sergio Giro; Pedro R. D'Argenio; Luis María Ferrer Fioriti (Theor. Comput. Sci., 2014)