L. de Alfaro, T. A. Henzinger & R. Majumdar (2003):
Discounting the Future in Systems Theory.
In: ICALP 2003,
LNCS 2719.
Springer,
pp. 1022–1037,
doi:10.1007/3-540-45061-0_79.
L. de Alfaro, R. Majumdar, V. Raman & M. Stoelinga (2007):
Game Relations and Metrics.
In: LICS 2007.
IEEE Computer Society,
pp. 99–108,
doi:10.1109/LICS.2007.22.
F. van Breugel (2005):
A Behavioural Pseudometric for Metric Labelled Transition Systems.
In: CONCUR 2005,
LNCS 3653.
Springer,
pp. 141–155,
doi:10.1007/11539452_14.
F. van Breugel & J. Worrell (2005):
A behavioural pseudometric for probabilistic transition systems.
Theoretical Computer Science 331(1),
pp. 115–142,
doi:10.1016/j.tcs.2004.09.035.
P. Cerný, T. A. Henzinger & A. Radhakrishna (2010):
Quantitative Simulation Games.
In: EMAP 2010,
pp. 42–60,
doi:10.1007/978-3-642-13754-9_3.
P. Cerný, T. A. Henzinger & A. Radhakrishna (2010):
Simulation Distances.
In: CONCUR 2010,
pp. 253–268,
doi:10.1007/978-3-642-15375-4_18.
D. Della Monica, V. Goranko, A. Montanari & G. Sciavicco (2011):
Interval Temporal Logics: a Journey.
Bulletin of the EATCS 105.
J. Desharnais, V. Gupta, R. Jagadeesan & P. Panangaden (2004):
Metrics for labelled Markov processes.
Theoretical Computer Science 318(3),
pp. 323–354,
doi:10.1016/j.tcs.2003.09.013.
J. Desharnais, F. Laviolette & M. Tracol (2008):
Approximate Analysis of Probabilistic Processes: Logic, Simulation and Games.
In: QEST 2008.
IEEE Computer Society,
pp. 264–273,
doi:10.1109/QEST.2008.42.
U. Fahrenberg, C. R. Thrane & K. G. Larsen (2011):
Distances for Weighted Transition Systems: Games and Properties.
In: QAPL 2011,
pp. 134–147,
doi:10.4204/EPTCS.57.10.
N. Ferns, P. Panangaden & D. Precup (2011):
Bisimulation Metrics for Continuous Markov Decision Processes.
SIAM J. Comput. 40(6),
pp. 1662–1714,
doi:10.1137/10080484X.
K. G. Larsen, U. Nyman & A. Wasowski (2007):
Modal I/O Automata for Interface and Product Line Theories.
In: ESOP 2007,
LNCS 4421.
Springer,
pp. 64–79,
doi:10.1007/978-3-540-71316-6_6.
G. Lüttgen & W. Vogler (2013):
Modal Interface Automata.
Logical Methods in Computer Science 9(3),
doi:10.2168/LMCS-9(3:4)2013.
R. Milner (1989):
Communication and concurrency.
Prentice Hall.
D.M.R. Park (1981):
Concurrency and automata on infinite sequences.
In: Theoretical Computer Science, 5th Gl-Conference,
LNCS 104.
Springer,
pp. 167–183,
doi:10.1007/BFb0017309.
J.-B. Raclet, E. Badouel, A. Benveniste, B.ît Caillaud, A. Legay & R. Passerone (2011):
A Modal Interface Theory for Component-based Design.
Fundam. Inform. 108(1-2),
pp. 119–149,
doi:10.3233/FI-2011-416.
D. Romero-Hernández & D. de Frutos-Escrig (2012):
Defining Distances for All Process Semantics.
In: FMOODS/FORTE 2012,
pp. 169–185,
doi:10.1007/978-3-642-30793-5_11.
D. Romero-Hernández & D. de Frutos-Escrig (2012):
Distances between Processes: A Pure Algebraic Approach.
In: WADT 2012,
pp. 265–282,
doi:10.1007/978-3-642-37635-1_16.
D. Romero-Hernández & D. de Frutos-Escrig (2014):
Coinductive Definition of Distances between Processes: Beyond Bisimulation Distances.
In: FORTE 2014,
pp. 249–265,
doi:10.1007/978-3-662-43613-4_16.
Davide Sangiorgi (2009):
On the origins of bisimulation and coinduction.
ACM Trans. Program. Lang. Syst. 31(4),
doi:10.1145/1516507.1516510.
C. Stirling (1998):
The Joys of Bisimulation.
In: MFCS 1998,
LNCS 1450.
Springer,
pp. 142–151,
doi:10.1007/BFb0055763.
eptcs@eptcs.org