activity
20122026
most citedDeciding Probabilistic Automata Weak Bisimulation in Polynomial Time

6 citations · 17 across the 16 of their papers we have counts for

collaborators
Showing cs.LOShow all

5 papers · 1 filter

cs.LO2023★ 1 cited

Scenario Approach for Parametric Markov Models

Ying Liu, Andrea Turrini, Moritz Hahn +2

In this paper, we propose an approximating framework for analyzing parametric Markov models. Instead of computing complex rational functions encoding the reachability probability a…

cs.LO2023

A Symbolic Algorithm for the Case-Split Rule in Solving Word Constraints with Extensions (Technical Report)

Yu-Fang Chen, Vojtěch Havlena, Ondřej Lengál +1

Case split is a core proof rule in current decision procedures for the theory of string constraints. Its use is the primary cause of the state space explosion in string constraint…

cs.LO2016★ 2 cited

Compositional Reasoning for Interval Markov Decision Processes

Vahid Hashemi, Holger Hermanns, Andrea Turrini

Model checking probabilistic CTL properties of Markov decision processes with convex uncertainties has been recently investigated by Puggelli et al. Such model checking algorithms…

cs.LO2016★ 1 cited

Synthesising Strategy Improvement and Recursive Algorithms for Solving 2.5 Player Parity Games

Ernst Moritz Hahn, Sven Schewe, Andrea Turrini +1

2.5 player parity games combine the challenges posed by 2.5 player reachability games and the qualitative analysis of parity games. These two types of problems are best approached…

cs.LO2016

An Efficient Synthesis Algorithm for Parametric Markov Chains Against Linear Time Properties

Yong Li, Wanwei Liu, Andrea Turrini +2

In this paper, we propose an efficient algorithm for the parameter synthesis of PLTL formulas with respect to parametric Markov chains. The PLTL formula is translated to an almost…