Sergio Giro

Quantitative Model Checking Revisited: Neither Decidable Nor Approximable

Pedro R. D'Argenio, Sergio Giro, P. D’Argenio, 2007, FORMATS.

Workflow Verification : a New Tower of Babel

Sergio Giro, 2007 .

An algorithmic approximation of the infimum reachability probability for Probabilistic Finite Automata pdf

Sergio Giro, Sergio Giro, 2010, ArXiv.

Partial Order Reduction for Probabilistic Systems: A Revision for Distributed Schedulers

Pedro R. D'Argenio, Luis María Ferrer Fioriti, Sergio Giro, 2009, CONCUR.

Distributed probabilistic input/output automata: Expressiveness, (un)decidability and algorithms

Pedro R. D'Argenio, Luis María Ferrer Fioriti, Sergio Giro, 2014, Theor. Comput. Sci..

Verification of Partial-Information Probabilistic Systems Using Counterexample-Guided Refinements

Markus N. Rabe, Sergio Giro, Sergio Giro, 2012, ATVA.

Undecidability Results for Distributed Probabilistic Systems

Sergio Giro, Sergio Giro, 2009, SBMF.