Andrea Turrini

Learn More
We study simulation relations for probabilistic automata that require transitions to be matched up to negligible sets provided that computation lengths are polynomially bounded. These relations are meant to provide rigorous grounds to parts of correctness proofs for cryptographic protocols that are usually carried out by semi-formal arguments. We illustrate(More)
Deciding in an efficient way weak probabilistic bisimulation in the context of probabilistic automata is an open problem for about a decade. In this work we close this problem by proposing a procedure that checks in polynomial time the existence of a weak combined transition satisfying the step condition of the bisimulation. This enables us to arrive at a(More)
Probabilistic automata (PA) are a prominent compositional concurrency model. As a way to justify property-preserving abstractions, in the last years, bisimulation relations over probability distributions have been proposed both in the strong and the weak setting. Different to the usual bisimulation relations, which are defined over states, an algorithmic(More)
The bottleneck in the quantitative analysis of Markov chains and Markov decision processes against specifications given in LTL or as some form of nondeterministic Büchi automata is the inclusion of a determinisation step of the automaton under consideration. Such determinisation constructions are notoriously difficult and cumbersome to implement. In this(More)
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,(More)
We introduce the web-based model checker ISCASMC for probabilistic systems (see http://iscasmc.ios.ac.cn/IscasMC). This Java application offers an easy-to-use web interface for the evaluation of Markov chains and decision processes against PCTL and PCTL∗ specifications. Compared to PRISM or MRMC, ISCASMC is particularly efficient in evaluating the(More)
One of the prevailing ideas in applied concurrency theory and verification is the concept of automata minimization with respect to strong or weak bisimilarity. The minimal automata can be seen as canonical representations of the behaviour modulo the bisimilarity considered. Together with congruence results wrt. process algebraic operators, this can be(More)
We introduce a novel modal logic, namely the doxastic μ-calculus with error control (DμCEC), and propose a formalization of probabilistic anonymity and oblivious transfer in the logic, and the validation of these formalizations on implementations formalized in probabilistic CCS. The distinguishing feature of our logic is to provide a combination of dynamic(More)
Probabilistic automata constitute a versatile and elegant model for concurrent probabilistic systems. They are equipped with a compositional theory supporting abstraction, enabled by weak probabilistic bisimulation serving as the reference notion for summarising the effect of abstraction. This paper considers probabilistic automata augmented with costs. It(More)