Probabilistic bisimulation

Prakash PanangadenCambridge 2011 · DOI · OpenAlex

Abstract

The history of bisimulation is well documented in earlier chapters of this book. In this chapter we will look at a major non-trivial extension of the theory of labelled transition systems: probabilistic transition systems. There are many possible extensions of theoretical and practical interest: real-time, quantitative, independence, spatial and many others. Probability is the best theory we have for handling uncertainty in all of science, not just computer science. It is not an idle extension made for the purpose of exploring what is theoretically possible. Non-determinism is, of course, important, and arises in computer science because sometimes we just cannot do any better or because we lack quantitative data from which to make quantitative predictions. However, one does not find any use of non-determinism in a quantitative science like physics, though it appears in sciences like biology where we have not yet reached a fundamental understanding of the nature of systems.
BibTeX
@inproceedings{panangaden2011probabilistic,
  author = {Prakash Panangaden},
  title = {{Probabilistic bisimulation}},
  booktitle = {Cambridge},
  year = {2011},
  doi = {10.1017/cbo9780511792588.008},
}

Loading related content...

Figure