Abstract
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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Baier, C., Katoen, J.P., Hermanns, H., Wolf, V.: Comparative branching-time semantics for markov chains. Inf. & Comp. 200(2), 149–214 (2005)
Durbin, R., Eddy, S.R., Krogh, A., Mitchison, G.: Biological Sequence Analysis. Cambridge Univ. Press, Cambridge (1998)
van Glabbeek, R.J.: The linear time–branching time spectrum I; the semantics of concrete, sequential processes. In: Bergstra, J.A., Ponse, A., Smolka, S.A. (eds.) Handbook of Process Algebra, ch. 1, pp. 3–99. Elsevier, Amsterdam (2001)
van Glabbeek, R.J., Smolka, S.A., Steffen, B.: Reactive, generative, and stratified models of probabilistic processes. Inf. & Comp. 121, 59–80 (1995)
Hasuo, I.: Generic forward and backward simulations. In: Baier, C., Hermanns, H. (eds.) CONCUR 2006. LNCS, vol. 4137, pp. 406–420. Springer, Heidelberg (2006)
Hasuo, I.: Tracing Anonymity with Coalgebras. PhD thesis, Radboud Univ. Nijmegen (2008)
Hasuo, I.: Generic forward and backward simulations II: Probabilistic simulations. To appear in RIMS Preprints (June 2010) (Extended version)
Hasuo, I., Jacobs, B., Sokolova, A.: Generic trace semantics via coinduction. Logical Methods in Comp. Sci. 3(4:11) (2007)
Hasuo, I., Kawabe, Y., Sakurada, H.: Probabilistic anonymity via coalgebraic simulations. Theor. Comp. Sci. 411(22-24), 2239–2259 (2010)
Hughes, J., Jacobs, B.: Simulations in coalgebra. Theor. Comp. Sci. 327(1-2), 71–108 (2004)
Jacobs, B.: Introduction to coalgebra. In: Towards mathematics of states and observations, Draft of a book (2005), www.cs.ru.nl/B.Jacobs/PAPERS
Jonsson, B., Larsen, K.G.: Specification and refinement of probabilistic processes. In: LICS, pp. 266–277. IEEE Computer Society, Los Alamitos (1991)
Klin, B.: Bialgebraic methods and modal logic in structural operational semantics. Inf. & Comp. 207(2), 237–257 (2009)
Kulkarni, V.G.: Modeling and Analysis of Stochastic Systems. Chapman & Hall, Boca Raton (1995)
Larsen, K.G., Skou, A.: Bisimulation through probabilistic testing. Inf. & Comp. 94(1), 1–28 (1991)
Lynch, N., Vaandrager, F.: Forward and backward simulations. I. Untimed systems. Inf. & Comp. 121(2), 214–233 (1995)
Rutten, J.J.M.M.: Universal coalgebra: a theory of systems. Theor. Comp. Sci. 249, 3–80 (2000)
Segala, R.: Modeling and verification of randomized distributed real-time systems. PhD thesis. MIT, Cambridge (1995)
Sokolova, A.: Coalgebraic Analysis of Probabilistic Systems. PhD thesis, Techn. Univ. Eindhoven (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hasuo, I. (2010). Generic Forward and Backward Simulations II: Probabilistic Simulation. In: Gastin, P., Laroussinie, F. (eds) CONCUR 2010 - Concurrency Theory. CONCUR 2010. Lecture Notes in Computer Science, vol 6269. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15375-4_31
Download citation
DOI: https://doi.org/10.1007/978-3-642-15375-4_31
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15374-7
Online ISBN: 978-3-642-15375-4
eBook Packages: Computer ScienceComputer Science (R0)