Publications

Filters: Author is Andrea Turrini [Clear All Filters]

2015

A. Turrini and H. Hermanns, “Polynomial time decision algorithms for probabilistic automata”, Inf. Comput., vol. 244, p. 134–171, 2015.

2014

A. Turrini and H. Hermanns, “Cost Preserving Bisimulations for Probabilistic Automata”, Logical Methods in Computer Science, vol. 10, 2014.

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.

V. Hashemi, H. Hermanns, and A. Turrini, “On the Efficiency of Deciding Probabilistic Automata Weak Bisimulation”, {ECEASST}, vol. 66, 2013.

C. Eisentraut, H. Hermanns, J. Schuster, A. Turrini, and L. Zhang, “The Quest for Minimal Quotients for Probabilistic Automata”, in Tools and Algorithms for the Construction and Analysis of Systems - 19th International Conference, TACAS 2013, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2013, Rome, Italy, March 16-24, 2013. Proceedings, 2013, vol. 7795, p. 16-31.

2012

D. Gebler, V. Hashemi, and A. Turrini, “Computing Behavioral Relations for Probabilistic Concurrent Systems”, in {ROCKS}, 2012.

H. Hermanns and A. Turrini, “Deciding Probabilistic Automata Weak Bisimulation in Polynomial Time”, in IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2012, December 15-17, 2012, Hyderabad, India, 2012, vol. 18, p. 435-447.