Giorgio Bacci, Giovanni Bacci, Kim G Larsen & Radu Mardare (2013):
Computing Behavioral Distances, Compositionally.
In: Proc. MFCS'13.
Springer,
pp. 74–85,
doi:10.1007/978-3-642-40313-2_9.
Falk Bartels (2002):
GSOS for probabilistic transition systems.
In: Proc. CMCS'02,
ENTCS 65.
Elsevier,
pp. 29–53,
doi:10.1016/S1571-0661(04)80358-X.
Falk Bartels (2004):
On Generalised Coinduction and Probabilistic Specification Formats.
VU University Amsterdam.
Bard Bloom, Wan Fokkink & Rob J. 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,
pp. 232–268,
doi:10.1145/200836.200876.
Franck van Breugel & James Worrell (2005):
A Behavioural Pseudometric for Probabilistic Transition Systems.
TCS 331(1),
pp. 115–142,
doi:10.1016/j.tcs.2004.09.035.
Franck van Breugel & James Worrell (2006):
Approximating and computing behavioural distances in probabilistic transition systems.
TCS 360(1),
pp. 373–385,
doi:10.1016/j.tcs.2006.05.021.
Konstantinos Chatzikokolakis, Daniel Gebler, Catuscia Palamidessi & Lili Xu:
Generalized bisimulation metrics.
In: Proc. CONCUR'14,
LNCS.
Springer, To appear.
Pedro R. D'Argenio, Daniel Gebler & Matias David Lee (2014):
Axiomatizing Bisimulation Equivalences and Metrics from Probabilistic SOS Rules.
In: Proc. FoSSaCS'14,
LNCS 8412.
Springer,
pp. 289–303,
doi:10.1007/978-3-642-54830-7_19.
Pedro R. D'Argenio & Matias David 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.
L. De Alfaro, M. Faella & M. Stoelinga (2004):
Linear and Branching Metrics for Quantitative Transition Systems.
In: Proc. ICALP'04,
LNCS 3142.
Springer,
pp. 97–109,
doi:10.1007/978-3-540-27836-8_11.
L. De Alfaro, R. Majumdar, V. Raman & M. Stoelinga (2007):
Game relations and metrics.
In: Proc. LICS'07.
IEEE,
pp. 99–108,
doi:10.1109/LICS.2007.22.
Yuxin Deng, Tom Chothia, Catuscia Palamidessi & Jun Pang (2006):
Metrics for Action-labelled Quantitative Transition Systems.
ENTCS 153(2),
pp. 79–96,
doi:10.1016/j.entcs.2005.10.033.
Yuxin Deng & Wenjie Du (2011):
Logical, Metric, and Algorithmic Characterisations of Probabilistic Bisimulation.
Technical Report CMU-CS-11-110.
CMU.
Josée Desharnais, Vineet Gupta, Radha Jagadeesan & Prakash Panangaden (2004):
Metrics for Labelled Markov Processes.
TCS 318(3),
pp. 323–354,
doi:10.1016/j.tcs.2003.09.013.
Josée Desharnais, Radha Jagadeesan, Vineet Gupta & Prakash Panangaden (2002):
The Metric Analogue of Weak Bisimulation for Probabilistic Processes.
In: Proc. LICS'02.
IEEE,
pp. 413–422,
doi:10.1109/LICS.2002.1029849.
Josée Desharnais, Francois Laviolette & Mathieu Tracol (2008):
Approximate Analysis of Probabilistic Processes: Logic, Simulation and Games.
In: Proc. QEST'08.
IEEE,
pp. 264–273,
doi:10.1109/QEST.2008.42.
Wan Fokkink, Rob J. van Glabbeek & Paulien de Wind (2006):
Compositionality of Hennessy-Milner logic by structural operational semantics.
TCS 354,
pp. 421–440,
doi:10.1016/j.tcs.2005.11.035.
Wan Fokkink, Rob J. van Glabbeek & Paulien de Wind (2006):
Divide and Congruence Applied to η-Bisimulation.
ENTCS 156,
pp. 97–113,
doi:10.1016/j.entcs.2005.10.029.
Wan Fokkink, Rob J. van Glabbeek & Paulien de Wind (2006):
Divide and Congruence: From Decomposition of Modalities to Preservation of Branching Bisimulation.
In: Proc. FMCO'05,
LNCS 4111.
Springer,
pp. 195–218,
doi:10.1007/11804192_10.
Wan Fokkink, Rob J. van Glabbeek & Paulien de Wind (2012):
Divide and congruence: From decomposition of modal formulas to preservation of branching and η-bisimilarity.
I&C 214,
pp. 59–85,
doi:10.1016/j.ic.2011.10.011.
Maciej Gazda & Wan Fokkink (2010):
Congruence from the Operator's Point of View: Compositionality Requirements on Process Semantics.
In: Proc. SOS'10,
EPTCS 32,
pp. 15–25,
doi:10.4204/EPTCS.32.2.
Daniel Gebler & Wan Fokkink (2012):
Compositionality of Probabilistic Hennessy-Milner Logic through Structural Operational Semantics.
In: Proc. CONCUR'12,
LNCS 7454.
Springer,
pp. 395–409,
doi:10.1007/978-3-642-32940-1_28.
Daniel Gebler & Simone Tini (2013):
Compositionality of Approximate Bisimulation for Probabilistic Systems.
In: Proc. EXPRESS/SOS'13,
EPTCS 120.
OPA,
pp. 32–46,
doi:10.4204/EPTCS.120.4.
Alessandro Giacalone, Chi-Chang Jou & Scott A. Smolka (1990):
Algebraic Reasoning for Probabilistic Concurrent Systems.
In: Proc. IFIP TC2 Working Conf. on Prog. Concepts and Methods,
pp. 443–458.
Jan Friso Groote (1993):
Transition System Specifications with Negative Premises.
TCS 118(2),
pp. 263–299,
doi:10.1016/0304-3975(93)90111-6.
Ruggero Lanotte & Simone Tini (2009):
Probabilistic Bisimulation as a Congruence.
ACM TOCL 10,
pp. 1–48,
doi:10.1145/1462179.1462181.
Kim G. Larsen & Arne Skou (1991):
Bisimulation Through Probabilistic Testing.
I&C 94,
pp. 1–28,
doi:10.1016/0890-5401(91)90030-6.
Matias David Lee, Daniel Gebler & Pedro 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.
Roberto Segala (1995):
Modeling and Verification of Randomized Distributed Real-Time Systems.
MIT.
Simone Tini (2010):
Non-expansive ε-bisimulations for Probabilistic Processes.
TCS 411,
pp. 2202–2222,
doi:10.1016/j.tcs.2010.01.027.
Mathieu Tracol, Josée Desharnais & Abir Zhioua (2011):
Computing Distances between Probabilistic Automata.
In: Proc. QAPL'11,
EPTCS 57,
pp. 148–162,
doi:10.4204/EPTCS.57.11.
Mingsheng Ying (2002):
Bisimulation indexes and their applications.
TCS 275(1),
pp. 1–68,
doi:10.1016/S0304-3975(01)00124-4.