Verification of PCTL properties of MDPs with convex uncertainties has been investigated recently by Puggelli et al. However, model checking algorithms typically suffer from state space explosion. In this paper, we address probabilistic bisimulation to reduce the size of such an MDPs while preserving PCTL properties it satisfies. We discuss different interpretations of uncertainty in the models ...

Generalizing Jones’s notion of a planar algebra, we have previously introduced an A2-planar algebra capturing the structure contained in the double complex pertaining to the subfactor for a finite SU(3) ADE graph with a flat cell system. We now introduce the notion of modules over an A2-planar algebra, and describe certain irreducible Hilbert A2-TL-modules. We construct an A2-graph planar algeb...

Most mobile robots follow a modular sense-plan-act system architecture that can lead to poor performance or even catastrophic failure for visual inertial navigation systems due trajectories devoid of feature matches. Planning in belief space provides unified approach tightly couple the perception, planning and control modules, leading are robust noisy measurements disturbances. However, existin...

This paper presents a novel technique for state space reduction of probabilistic specifications, based on a newly developed notion of confluence for probabilistic automata. We prove that this reduction preserves branching probabilistic bisimulation and can be applied on-the-fly. To support the technique, we introduce a method for detecting confluent transitions in the context of a probabilistic...

This paper presents a novel technique for state space reduction of probabilistic specifications, based on a newly developed notion of confluence for probabilistic automata. We prove that this reduction preserves branching probabilistic bisimulation and can be applied on-the-fly. To support the technique, we introduce a method for detecting confluent transitions in the context of a probabilistic...