activity
20142019
most citedLinear Distances between Markov Chains

6 citations · 10 across the 5 of their papers we have counts for

collaborators

7 papers

cs.SE2019

Compositional Specifications for ioco Testing

Przemyslaw Daca, Thomas A. Henzinger, Willibald Krenn +1

Model-based testing is a promising technology for black-box software and hardware testing, in which test cases are generated automatically from high-level specifications. Nowadays,…

eess.SY2017★ 3 cited

Value Iteration for Long-run Average Reward in Markov Decision Processes

Pranav Ashok, Krishnendu Chatterjee, Przemyslaw Daca +2

Markov decision processes (MDPs) are standard models for probabilistic systems with non-deterministic behaviours. Long-run average rewards provide a mathematically elegant formalis…

cs.FL2016★ 6 cited

Linear Distances between Markov Chains

Przemysław Daca, Thomas A. Henzinger, Jan Křetínský +1

We introduce a general class of distances (metrics) between Markov chains, which are based on linear behaviour. This class encompasses distances given topologically (such as the to…

cs.FL2016

Array Folds Logic

Przemysław Daca, Thomas A. Henzinger, Andrey Kupriyanov

We present an extension to the quantifier-free theory of integer arrays which allows us to express counting. The properties expressible in Array Folds Logic (AFL) include statement…

cs.LO2015★ 1 cited

Abstraction-driven Concolic Testing

Przemysław Daca, Ashutosh Gupta, Thomas A. Henzinger

Concolic testing is a promising method for generating test suites for large programs. However, it suffers from the path-explosion problem and often fails to find tests that cover d…

cs.LO2015

Faster Statistical Model Checking for Unbounded Temporal Properties

Przemysław Daca, Thomas A. Henzinger, Jan Křetínský +1

We present a new algorithm for the statistical model checking of Markov chains with respect to unbounded temporal properties, such as reachability and full linear temporal logic. T…

cs.LO2014

CEGAR for Qualitative Analysis of Probabilistic Systems

Krishnendu Chatterjee, Martin Chmelik, Przemyslaw Daca

We consider Markov decision processes (MDPs) which are a standard model for probabilistic systems. We focus on qualitative properties for MDPs that can express that desired behavio…