L. Aceto, W. Fokkink & C. Verhoef (2001):
Conservative Extension in Structural Operational Semantics.
In: Current Trends in Theoretical Computer Science,
pp. 504–524,
doi:10.1142/9789812810403_0004.
L. Aceto, W. Fokkink & C. Verhoef (2001):
Structural operational semantics.
In: Handbook of Process Algebra.
Elsevier,
pp. 197–292,
doi:10.1016/B978-044482830-9/50021-7.
C. Baier (1998):
On Algorithmics Verification Methods for Probabilistic Systems.
Habilitation thesis.
University of Mannheim.
F. Bartels (2002):
GSOS for Probabilistic Transition Systems.
Electr. Notes Theor. Comput. Sci. 65(1),
pp. 29–53,
doi:10.1016/S1571-0661(04)80358-X.
F. Bartels (2004):
On Generalised Coinduction and Probabilistic Specification Formats.
VU University Amsterdam.
B. Bloom, S. Istrail & A.R. Meyer (1995):
Bisimulation can't be traced.
J. ACM 42,
pp. 232–268,
doi:10.1145/200836.200876.
R. Bol & J.F. Groote (1996):
The meaning of negative premises in transition system specifications.
J. ACM 43,
pp. 863–914,
doi:10.1145/234752.234756.
P.R. D'Argenio & M.D. Lee (2012):
Probabilistic Transition System Specification: Congruence and Full Abstraction of Bisimulation.
In: Proc. FoSSaCS'12,
LNCS 7213.
Springer,
pp. 452–466,
doi:10.1007/978-3-642-28729-9_30.
P.R. D'Argenio, P. Sánchez Terraf & N. Wolovick (2012):
Bisimulations for non-deterministic labelled Markov processes.
Mathematical Structures in Computer Science 22(1),
pp. 43–68,
doi:10.1017/S0960129511000454.
W. Fokkink (2000):
Rooted Branching Bisimulation as a Congruence.
J. Comput. Syst. Sci. 60(1),
pp. 13–37,
doi:10.1006/jcss.1999.1663.
W. Fokkink & C. Verhoef (1998):
A Conservative Look at Operational Semantics with Variable Binding.
Inf. Comput. 146(1),
pp. 24–54,
doi:10.1006/inco.1998.2729.
R.J. van Glabbeek (2004):
The meaning of negative premises in transition system specifications II.
J. Log. Algebr. Program. 60-61,
pp. 229–258,
doi:10.1016/j.jlap.2004.03.007.
J.F. Groote (1993):
Transition system specifications with negative premises.
Theoretical Computer Science 118(2),
pp. 263–299,
doi:10.1016/0304-3975(93)90111-6.
J.F. Groote & F.W. Vaandrager (1992):
Structured Operational Semantics and Bisimulation as a Congruence.
Inf. Comput. 100(2),
pp. 202–260,
doi:10.1016/0890-5401(92)90013-6.
H. Hermanns, A. Parma, R. Segala, B. Wachter & L. Zhang (2011):
Probabilistic Logical Characterization.
Inf. Comput. 209(2),
pp. 154–172,
doi:10.1016/j.ic.2010.11.024.
R. Lanotte & S. Tini (2005):
Probabilistic Congruence for Semistochastic Generative Processes.
In: Foundations of Software Science and Computational Structures, 8th International Conference, FOSSACS 2005.,
pp. 63–78,
doi:10.1007/978-3-540-31982-5_4.
R. Lanotte & S. Tini (2009):
Probabilistic bisimulation as a congruence.
ACM Trans. Comput. Log. 10(2),
doi:10.1145/1462179.1462181.
K.G. Larsen & A/ Skou (1991):
Bisimulation through Probabilistic Testing.
Inf. Comput. 94(1),
pp. 1–28,
doi:10.1016/0890-5401(91)90030-6.
M.D. Lee & E. de Vink (2015):
Rooted branching bisimulation as a congruence for probabilistic transition systems.
In: Proc. QAPL'15,
EPTCS.
To appear.
M.D. Lee, D. Gebler & P.R. D'Argenio (2012):
Tree Rules in Probabilistic Transition System Specifications with Negative and Quantitative Premises.
In: Proc. EXPRESS/SOS'12,
EPTCS 89,
pp. 115–130,
doi:10.4204/EPTCS.89.9.
R. Milner (1989):
Communication and Concurrency.
Prentice-Hall.
M.R. Mousavi, M.A. Reniers & J.F. Groote (2007):
SOS formats and meta-theory: 20 years after.
Theor. Comput. Sci. 373(3),
pp. 238–272,
doi:10.1016/j.tcs.2006.12.019.
G. Plotkin (1981):
A structural approach to operational semantics.
Report DAIMI FN-19.
Aarhus University,
doi:doi:10.1016/j.jlap.2004.05.001.
Reprinted in J. Log. Algebr. Program., 60-61:17-139, 2004.
R. Segala (1995):
Modeling and Verification of Randomized Distributed Real-Time Systems.
MIT.
S. Tini (2010):
Non-expansive ε-bisimulations for probabilistic processes.
Theor. Comput. Sci. 411(22-24),
pp. 2202–2222,
doi:10.1016/j.tcs.2010.01.027.
eptcs@eptcs.org