Generic Forward and Backward Simulations II: Probabilistic Simulation
Jonsson and Larsen’s notion of probabilistic simulation is studied from a coalgebraic perspective. The notion is compared with two generic coalgebraic definitions of simulation: Hughes and Jacobs’ one, and the one introduced previously by the author. We show that the first almost coincides with the second, and that the second is a special case of the last. We investigate implications of this characterization; notably the Jonsson-Larsen simulation is shown to be sound, i.e. its existence implies trace inclusion.
Unable to display preview. Download preview PDF.
- 6.Hasuo, I.: Tracing Anonymity with Coalgebras. PhD thesis, Radboud Univ. Nijmegen (2008)Google Scholar
- 7.Hasuo, I.: Generic forward and backward simulations II: Probabilistic simulations. To appear in RIMS Preprints (June 2010) (Extended version)Google Scholar
- 8.Hasuo, I., Jacobs, B., Sokolova, A.: Generic trace semantics via coinduction. Logical Methods in Comp. Sci. 3(4:11) (2007)Google Scholar
- 11.Jacobs, B.: Introduction to coalgebra. In: Towards mathematics of states and observations, Draft of a book (2005), www.cs.ru.nl/B.Jacobs/PAPERS
- 12.Jonsson, B., Larsen, K.G.: Specification and refinement of probabilistic processes. In: LICS, pp. 266–277. IEEE Computer Society, Los Alamitos (1991)Google Scholar
- 18.Segala, R.: Modeling and verification of randomized distributed real-time systems. PhD thesis. MIT, Cambridge (1995)Google Scholar
- 19.Sokolova, A.: Coalgebraic Analysis of Probabilistic Systems. PhD thesis, Techn. Univ. Eindhoven (2005)Google Scholar