Probabilistic Transition System Specification: Congruence and Full Abstraction of Bisimulation
暂无分享,去创建一个
[1] Luca Aceto,et al. Conservative Extension in Structural Operational Semantics , 1999, Bull. EATCS.
[2] Falk Bartels,et al. GSOS for Probabilistic Transition Systems , 2002, CMCS.
[3] Bartek Klin,et al. Bialgebras for structural operational semantics: An introduction , 2011, Theor. Comput. Sci..
[4] Robin Milner,et al. Communication and concurrency , 1989, PHI Series in computer science.
[5] Gordon D. Plotkin,et al. Towards a mathematical operational semantics , 1997, Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science.
[6] Jan A. Bergstra,et al. Process Algebra with a Zero Object , 1990, CONCUR.
[7] Jan Friso Groote,et al. Transition System Specifications with Negative Premises , 1993, Theor. Comput. Sci..
[8] Jan A. Bergstra,et al. Axiomatizing Probabilistic Processes: ACP with Generative Probabilities , 1995, Inf. Comput..
[9] Gordon D. Plotkin,et al. A structural approach to operational semantics , 2004, J. Log. Algebraic Methods Program..
[10] Jan Friso Groote,et al. The Meaning of Negative Premises in Transition System Specifications , 1991, ICALP.
[11] Jan Friso Groote,et al. Structured Operational Semantics and Bisimulation as a Congruence , 1992, Inf. Comput..
[12] Chris Verhoef,et al. A General Conservative Extension Theorem in Process Algebra , 1994, PROCOMET.
[13] Ian Stark,et al. Free-Algebra Models for the pi-Calculus , 2005, FoSSaCS.
[14] Roberto Segala,et al. Modeling and verification of randomized distributed real-time systems , 1996 .
[15] Wang Yi,et al. Probabilistic Extensions of Process Algebras , 2001, Handbook of Process Algebra.
[16] Kim G. Larsen,et al. Bisimulation through Probabilistic Testing , 1991, Inf. Comput..
[17] F. Bartels,et al. On Generalised Coinduction and Probabilistic Specification Formats , 2004 .
[18] Bernhard Steffen,et al. Reactive, generative, and stratified models of probabilistic processes , 1990, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science.
[19] Rob J. van Glabbeek,et al. The meaning of negative premises in transition system specifications II , 1996, J. Log. Algebraic Methods Program..
[20] Albert R. Meyer,et al. Bisimulation can't be traced , 1988, POPL '88.
[21] Simone Tini,et al. Probabilistic bisimulation as a congruence , 2009, TOCL.
[22] Simone Tini,et al. Probabilistic Congruence for Semistochastic Generative Processes , 2005, FoSSaCS.
[23] Jan Friso Groote,et al. SOS formats and meta-theory: 20 years after , 2007, Theor. Comput. Sci..
[24] Wan Fokkink,et al. Ntyft/Ntyxt Rules Reduce to Ntree Rules , 1996, Inf. Comput..