4 papers
Probabilistic Model Checking via Families of Deterministic and Unambiguous Finite Automata
Christel Baier, Sascha Klüppelholz, Timm Spork
Families of deterministic finite automata (FDFA) have been introduced as a concise automaton model that characterizes -regular languages by processing their ultimately periodic…
Approximate Probabilistic Bisimulation for Continuous-Time Markov Chains
Timm Spork, Christel Baier, Joost-Pieter Katoen +2
We introduce -bisimulation, a novel type of approximate probabilistic bisimulation for continuous-time Markov chains. In contrast to related notions, $(\varepsilo…
Model Checking Linear Temporal Logic with Standpoint Modalities
Rajab Aghamov, Christel Baier, Toghrul Karimov +4
Standpoint linear temporal logic () is a recently introduced extension of classical linear temporal logic () with standpoint modalities. Intuitively, these modalities al…
A Spectrum of Approximate Probabilistic Bisimulations
Timm Spork, Christel Baier, Joost-Pieter Katoen +2
This paper studies various notions of approximate probabilistic bisimulation on labeled Markov chains (LMCs). We introduce approximate versions of weak and branching bisimulation,…