Jos C. M. Baeten, Jan A. Bergstra & Scott A. Smolka (1995):
Axiomatizing Probabilistic Processes: ACP with Generative Probabilities.
Inf. Comput. 121(2),
pp. 234–255,
doi:10.1006/inco.1995.1135.
Falk Bartels (2004):
On Generalised Coinduction and Probabilistic Specification Formats.
Vrije Universiteit.
Bard Bloom, Wan Fokkink & Rob van Glabbeek (2004):
Precongruence formats for decorated trace semantics.
ACM TOCL 5,
pp. 26–78,
doi:10.1145/963927.963929.
Bard Bloom, Sorin Istrail & Albert R. Meyer (1995):
Bisimulation Can't be Traced.
J. ACM 42(1),
pp. 232–268,
doi:10.1145/200836.200876.
Roland Bol & Jan Friso Groote (1996):
The meaning of negative premises in transition system specifications.
J. ACM 43(5),
pp. 863–914,
doi:10.1145/234752.234756.
Pedro R. D'Argenio & Matias David Lee (2012):
Probabilistic Transition System Specification: Congruence and Full Abstraction of Bisimulation.
In: FoSSaCS,
LNCS 7213.
Springer,
pp. 452–466,
doi:10.1007/978-3-642-28729-9_30.
Wan Fokkink (1997):
Unification for infinite sets of equations between finite terms.
Information Processing Letters 62(4),
pp. 183 – 188,
doi:10.1016/S0020-0190(97)00063-X.
Wan Fokkink & Rob J. van Glabbeek (1996):
Ntyft/Ntyxt Rules Reduce to Ntree Rules.
Inf. Comput. 126(1),
pp. 1–10,
doi:10.1006/inco.1996.0030.
Daniel Gebler & Wan Fokkink (2012):
Compositionality of Probabilistic Hennessy-Milner Logic through Structural Operational Semantics.
In: Proc. CONCUR 2012,
LNCS 7454.
Springer,
pp. 395–409.
Rob 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.
Rob J. van Glabbeek, Scott A. Smolka & Bernhard Steffen (1995):
Reactive, Generative and Stratified Models of Probabilistic Processes.
Inf. Comput. 121(1),
pp. 59–80,
doi:10.1006/inco.1995.1123.
Jan Friso Groote (1993):
Transition system specifications with negative premises.
Theor. Comput. Sci. 118(2),
pp. 263–299,
doi:10.1016/0304-3975(93)90111-6.
Jan Friso Groote & Frits 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.
Bartek Klin & Vladimiro Sassone (2008):
Structural operational semantics for stochastic process calculi.
In: FoSSaCS,
LNCS 4962.
Springer,
pp. 428–442,
doi:10.1007/978-3-540-78499-9_30.
Ruggero Lanotte & Simone Tini (2009):
Probabilistic bisimulation as a congruence.
ACM Trans. Comput. Log. 10(2),
doi:10.1145/1462179.1462181.
Kim Guldstrand Larsen & Arne Skou (1991):
Bisimulation through Probabilistic Testing.
Inf. Comput. 94(1),
pp. 1–28,
doi:10.1016/0890-5401(91)90030-6.
Mohammad Reza Mousavi, Michel A. Reniers & Jan Friso 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.
Gordon D. Plotkin (1981):
A structural approach to operational semantics.
Report DAIMI FN-19.
Aarhus University,
doi:10.1016/j.jlap.2004.05.001.
Reprinted in J. Log. Algebr. Program., 60-61:17-139, 2004.
Roberto Segala (1995):
Modeling and Verification of Randomized Distributed Real-Time Systems.
MIT.
eptcs@eptcs.org