Lax probabilistic bisimulation
Probabilistic bisimulation is a widely studied equivalence relation for stochastic systems. However, it requires the behavior of the states to match on actions with matching labels. This does not allow bisimulation to capture symmetries in the system. In this thesis we define lax probabilistic bisim...
Main Author: | Taylor, Jonathan, 1981- |
---|---|
Format: | Others |
Language: | en |
Published: |
McGill University
2008
|
Subjects: | |
Online Access: | http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=111546 |
Similar Items
-
An Efficient Algorithm to Determine Probabilistic Bisimulation
by: Jan Friso Groote, et al.
Published: (2018-09-01) -
Learning bisimulation
by: Shenkenfelder, Warren
Published: (2008) -
Recognition of multiple sequences by subgroups of autonomous probabilistic automata
by: Alsu Rafailovna Nurutdinova, et al.
Published: (2020-12-01) -
Asymptotic behavior of stochastic systems possessing Markovian realizations
by: Meyn, S. P. (Sean P.)
Published: (1987) -
Simulation Based Algorithms For Markov Decision Process And Stochastic Optimization
by: Abdulla, Mohammed Shahid
Published: (2010)