11 citations · 22 across the 3 of their papers we have counts for
3 papers
cs.LO2009★ 11 cited
Computation Tree Logic with Deadlock Detection
Rob van Glabbeek, Bas Luttik, Nikola Trcka
We study the equivalence relation on states of labelled transition systems of satisfying the same formulas in Computation Tree Logic without the next state modality (CTL-X). This r…
cs.LO2009★ 10 cited
Strong, Weak and Branching Bisimulation for Transition Systems and Markov Reward Chains: A Unifying Matrix Approach
Nikola Trčka
We first study labeled transition systems with explicit successful termination. We establish the notions of strong, weak, and branching bisimulation in terms of boolean matrix theo…
cs.LO2008★ 1 cited
Branching Bisimilarity with Explicit Divergence
Rob van Glabbeek, Bas Luttik, Nikola Trcka
We consider the relational characterisation of branching bisimilarity with explicit divergence. We prove that it is an equivalence and that it coincides with the original definitio…