52 citations · 146 across the 41 of their papers we have counts for
6 papers · 1 filter
Minimisation of Multiplicity Tree Automata
Stefan Kiefer, Ines Marusic, James Worrell
We consider the problem of minimising the number of states in a multiplicity tree automaton over the field of rational numbers. We give a minimisation algorithm that runs in polyno…
The Odds of Staying on Budget
Christoph Haase, Stefan Kiefer
Given Markov chains and Markov decision processes (MDPs) whose transitions are labelled with non-negative integer costs, we study the computational complexity of deciding whether t…
On the Total Variation Distance of Labelled Markov Chains
Taolue Chen, Stefan Kiefer
Labelled Markov chains (LMCs) are widely used in probabilistic verification, speech recognition, computational biology, and many other fields. Checking two LMCs for equivalence is…
Stability and Complexity of Minimising Probabilistic Automata
Stefan Kiefer, Björn Wachter
We consider the state-minimisation problem for weighted and probabilistic automata. We provide a numerically stable polynomial-time minimisation algorithm for weighted automata, wi…
Zero-Reachability in Probabilistic Multi-Counter Automata
Tomáš Brázdil, Stefan Kiefer, Antonín Kučera +2
We study the qualitative and quantitative zero-reachability problem in probabilistic multi-counter systems. We identify the undecidable variants of the problems, and then we concen…
Analysis of Probabilistic Basic Parallel Processes
Rémi Bonnet, Stefan Kiefer, Anthony W. Lin
Basic Parallel Processes (BPPs) are a well-known subclass of Petri Nets. They are the simplest common model of concurrent programs that allows unbounded spawning of processes. In t…