J. C. M. Baeten, P. J. L. Cuijpers & P. J. A. van Tilburg (2008):
A Context-Free Process as a Pushdown Automaton.
In: Franck van Breugel & Marsha Chechik: CONCUR 2008 - Concurrency Theory.
Springer Berlin Heidelberg,
Berlin, Heidelberg,
pp. 98–113,
doi:10.1007/978-3-540-85361-9_11.
Christian J. Bell (2013):
Certifiably sound parallelizing transformations.
In: Georges Gonthier & Michael Norrish: Certified Programs and Proofs 8307.
Springer International Publishing,
pp. 227–242,
doi:10.1007/978-3-319-03545-1_15.
Benjamin Bisping (2019):
Isabelle/HOL proof and Apache Flink program for TACAS 2019 paper: Computing Coupled Similarity,
doi:10.6084/m9.figshare.7831382.v1.
Benjamin Bisping & Uwe Nestmann (2019):
Computing coupled similarity.
In: Proceedings of TACAS,
LNCS.
Springer,
pp. 244–261,
doi:10.1007/978-3-030-17462-0_14.
Benjamin Bisping & Uwe Nestmann (2021):
A Game for Linear-time–Branching-time Spectroscopy.
In: Jan Friso Groote & Kim Guldstrand Larsen: Tools and Algorithms for the Construction and Analysis of Systems.
Springer International Publishing,
Cham,
pp. 3–19,
doi:10.1007/978-3-030-72016-2_1.
Benjamin Bisping, Uwe Nestmann & Kirstin Peters (2020):
Coupled similarity: the first 32 years.
Acta Informatica 57(3),
pp. 439–463,
doi:10.1007/s00236-019-00356-4.
Xin Chen & Yuxin Deng (2008):
Game characterizations of process equivalences.
In: G. Ramalingam: Programming Languages and Systems 5356.
Springer Berlin Heidelberg,
pp. 107–121,
doi:10.1007/978-3-540-89330-1_8.
David De Frutos Escrig, Jeroen J. A. Keiren & Tim A. C. Willemse (2017):
Games for bisimulations and abstraction.
Logical Methods in Computer Science 13(4),
pp. 1–40,
doi:10.23638/LMCS-13(4:15)2017.
Cédric Fournet & Georges Gonthier (2005):
A hierarchy of equivalences for asynchronous calculi.
The Journal of Logic and Algebraic Programming 63(1),
pp. 131–173,
doi:10.1016/j.jlap.2004.01.006.
Rob J. van Glabbeek (1993):
The linear time–branching time spectrum II.
In: International Conference on Concurrency Theory.
Springer,
pp. 66–81,
doi:10.1007/3-540-57208-2_6.
Rob J. van Glabbeek (2001):
The linear time–branching time spectrum I. The semantics of concrete, sequential processes.
In: Handbook of Process Algebra.
Elsevier,
pp. 3–99,
doi:10.1016/B978-044482830-9/50019-9.
Erich Grädel (2007):
Finite model theory and descriptive complexity.
In: Finite Model Theory and its Applications.
Springer,
pp. 125–230,
doi:10.1007/3-540-68804-8_3.
Hans Hüttel & Sandeep Shukla (1996):
On the Complexity of Deciding Behavioural Equivalences and Preorders. A Survey.
BRICS Report Series 3(39),
doi:10.7146/brics.v3i39.20021.
Robin Milner (1989):
Communication and Concurrency.
PHI Series in computer science.
Prentice Hall Englewood Cliffs.
Joachim Parrow & Peter Sjödin (1994):
The complete axiomatization of Cs-congruence.
In: Annual Symposium on Theoretical Aspects of Computer Science.
Springer,
pp. 555–568,
doi:10.1007/3-540-57785-8_171.
Kirstin Peters & Rob J. van Glabbeek (2015):
Analysing and Comparing Encodability Criteria.
In: Proceedings of the Combined 22th International Workshop on Expressiveness in Concurrency and 12th Workshop on Structural Operational Semantics, and 12th Workshop on Structural Operational Semantics, EXPRESS/SOS,
pp. 46–60,
doi:10.4204/EPTCS.190.4.
Kirstin Peters & Rob J. van Glabbeek (2015):
Analysing and Comparing Encodability Criteria for Process Calculi.
Archive of Formal Proofs.
https://isa-afp.org/entries/Encodability_Process_Calculi.html, Formal proof development.
Colin Stirling (1999):
Bisimulation, modal logic and model checking games.
Logic Journal of IGPL 7(1),
pp. 103–124,
doi:10.1093/jigpal/7.1.103.
Marc Voorhoeve & Sjouke Mauw (2001):
Impossible futures and determinism.
Information Processing Letters 80(1),
pp. 51–58,
doi:10.1016/S0020-0190(01)00217-4.