Strong, Weak and Branching Bisimulation for Transition Systems and Markov Reward Chains: A Unifying Matrix Approach - Computer Science > Logic in Computer ScienceReport as inadecuate




Strong, Weak and Branching Bisimulation for Transition Systems and Markov Reward Chains: A Unifying Matrix Approach - Computer Science > Logic in Computer Science - Download this document for free, or read online. Document in PDF available to download.

Abstract: We first study labeled transition systems with explicit successfultermination. We establish the notions of strong, weak, and branchingbisimulation in terms of boolean matrix theory, introducing thus a novel andpowerful algebraic apparatus. Next we consider Markov reward chains which arestandardly presented in real matrix theory. By interpreting the obtained matrixconditions for bisimulations in this setting, we automatically obtain thedefinitions of strong, weak, and branching bisimulation for Markov rewardchains. The obtained strong and weak bisimulations are shown to coincide withsome existing notions, while the obtained branching bisimulation is new, butits usefulness is questionable.



Author: Nikola TrĨka Eindhoven University of Technology

Source: https://arxiv.org/







Related documents