Dr. Andrea Turrini

We consider bisimulation and weak bisimulation relations in the context of the labeled Markov chains of Hansson and Jonsson, the concurrent labeled Markov chains of Philippou, Lee, and Sokolsky, and the probabilistic automata of Segala. We identify a taxonomy of bisimulation relations that captures the existing definitions for each one of the three models, and we compare the relations within each model and across models. The comparison across models is given according to a notion of embedding, where we order the three models by generality and we view objects in less general models as objects of more general models.

1 January 2015

Book Chapter

QPMC: A Model Checker for Quantum Programs and Protocols

Yuan Feng

Ernst Moritz Hahn

Andrea Turrini

Lijun Zhang

About Me

Andrea Turrini received the M.Sc. and Ph.D. degrees in computer science from the University of Verona, Italy in 2005 and 2009, respectively. He was first a postdoctoral researcher in Verona and then at Saarland University, Saarbrücken, Germany. He then moved to the Institute of Software, Chinese Academy of Sciences, Beijing, China as an associate research professor in the group of Lijun Zhang. His research interests include the formal analysis of probabilistic and quantum systems, with a particular focus on system minimization and verification of omega regular properties. He is also interested in omega regular automata, including learning-based algorithms for automata operations.

Dr. Andrea Turrini

Dr. Andrea Turrini

Research Focus & Metrics

Academic Career Length

Publication Type Breakdown

Representative Publications

About Me