Publications

Export 16 results:
Sort by: Author Title Type [ Year (Desc)]
Filters: Author is Pedro R. D'Argenio  [Clear All Filters]
2015
C. E. Budde, P. R. D'Argenio, and H. Hermanns, “Rare Event Simulation with Fully Automated Importance Splitting”, in Computer Performance Engineering - 12th European Workshop, {EPEW} 2015, Madrid, Spain, August 31 - September 1, 2015, Proceedings, vol. 9272, M. Beltrán, W. J. Knottenbelt, and J. T. Bradley, Eds. 2015, p. 275–290.
P. R. D'Argenio, A. Legay, S. Sedwards, and L. - M. Traonouez, “Smart sampling for lightweight verification of Markov decision processes”, {STTT}, vol. 17, p. 469–484, 2015.
P. R. D'Argenio, M. D. Lee, and D. Gebler, “{SOS} rule formats for convex and abstract probabilistic bisimulations”, in Proceedings of the Combined 22th International Workshop on Expressiveness in Concurrency and 12th Workshop on Structural Operational Semantics, and 12th Workshop on Structural Operational Semantics, {EXPRESS/SOS} 2015, Madrid, Spain, 31st August 2015., vol. 190, S. Crafa and D. Gebler, Eds. 2015, p. 31–45.
2014
P. R. D'Argenio, D. Gebler, and M. D. Lee, “Axiomatizing Bisimulation Equivalences and Metrics from Probabilistic SOS Rules”, in Foundations of Software Science and Computation Structures - 17th International Conference, FOSSACS 2014, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2014, Grenoble, France, April 5-13, 2014, Proceedings, 2014.
S. Giro, P. R. D'Argenio, and L. M. Ferrer Fioriti, “Distributed probabilistic input/output automata: Expressiveness, (un)decidability and algorithms”, Theoretical Computer Science, vol. 538, p. 84-102, 2014.
C. E. Budde, P. R. D'Argenio, P. Sánchez Terraf, and N. Wolovick, “A Theory for the Semantics of Stochastic and Non-deterministic Continuous Systems”, in Stochastic Model Checking. Rigorous Dependability Analysis Using Model Checking Techniques for Stochastic Systems - International Autumn School, {ROCKS} 2012, Vahrn, Italy, October 22-26, 2012, Advanced Lectures, vol. 8453, A. Remke and M. Stoelinga, Eds. 2014, p. 67–86.
2013
CONCUR 2013 - Concurrency Theory - 24th International Conference, CONCUR 2013, Buenos Aires, Argentina, August 27-30, 2013. Proceedings”, Lecture Notes in Computer Science, vol. 8052. 2013.
H. Hermanns and A. Turrini, “Cost Preserving Bisimulations for Probabilistic Automata”, in CONCUR 2013 - Concurrency Theory - 24th International Conference, CONCUR 2013, Buenos Aires, Argentina, August 27-30, 2013. Proceedings, 2013, vol. 8052, p. 349-363.
C. Eisentraut, H. Hermanns, J. Krämer, A. Turrini, and L. Zhang, “Deciding Bisimilarities on Distributions”, in Quantitative Evaluation of Systems - 10th International Conference, QEST 2013, Buenos Aires, Argentina, August 27-30, 2013. Proceedings, 2013, vol. 8054, p. 72-88.
Quantitative Evaluation of Systems - 10th International Conference, QEST 2013, Buenos Aires, Argentina, August 27-30, 2013. Proceedings”, Lecture Notes in Computer Science, vol. 8054. 2013.
D. N. Jansen, L. Song, and L. Zhang, “Revisiting Weak Simulation for Substochastic Markov Chains”, in Quantitative Evaluation of Systems - 10th International Conference, QEST 2013, Buenos Aires, Argentina, August 27-30, 2013. Proceedings, 2013, vol. 8054, p. 209-224.
S. S. Pelozo and P. R. D'Argenio, “Security Analysis in Probabilistic Distributed Protocols via Bounded Reachability”, in Trustworthy Global Computing, vol. 8191, C. Palamidessi and M. D. Ryan, Eds. 2013, p. 182-197.
2012
P. R. D'Argenio, P. Sánchez Terraf, and N. Wolovick, “Bisimulations for non-deterministic labelled Markov processes”, Mathematical Structures in Computer Science, vol. 22, no. 1, p. 43-68, 2012.
P. R. D'Argenio and M. D. Lee, “Probabilistic Transition System Specification: Congruence and Full Abstraction of Bisimulation”, in Foundations of Software Science and Computational Structures - 15th International Conference, FOSSACS 2012, 2012, vol. 7213, p. 452-466.
J. Markovski, P. R. D'Argenio, J. C. M. Baeten, and E. P. de Vink, “Reconciling real and stochastic time: the need for probabilistic refinement”, Formal Aspects of Computing, vol. 24, p. 497-518, 2012.
M. D. Lee, D. Gebler, and P. R. D'Argenio, “Tree rules in probabilistic transition system specifications with negative and quantitative premises”, Electronic Proceedings in Theoretical Computer Science, vol. 89, p. 115 - 130, 2012.