J. C. M. Baeten
J. A. Bergstra
J. W. Klop
1987
On the consistency of Koomen's Fair Abstraction Rule
Theoretical Computer Science
51
1–2
129 – 176
10.1016/0304-3975(87)90052-1
Jos C. M. Baeten
Twan Basten
Michel A. Reniers
2010
Process algebra: equational theories of communicating processes
50
Cambridge University Press
10.1017/CBO9781139195003
Jos C. M. Baeten
Bas Luttik
Paul van Tilburg
2013
Reactive Turing Machines
Inform. Comput.
231
143–166
10.1016/j.ic.2013.08.010
Twan Basten
1996
Branching Bisimilarity is an Equivalence Indeed!
Inf. Process. Lett.
58
3
141–147
10.1016/0020-0190(96)00034-8
Mikolaj Bojanczyk
Bartek Klin
Slawomir Lasota
Szymon Torunczyk
2013
Turing Machines with Atoms
28th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2013, New Orleans, LA, USA, June 25-28, 2013
IEEE Computer Society
183–192
10.1109/LICS.2013.24
Nadia Busi
Maurizio Gabbrielli
Gianluigi Zavattaro
2009
On the expressive power of recursion, replication and iteration in process calculi
Mathematical Structures in Computer Science
19
06
1191–1222
10.1017/S096012950999017X
Eugene Eberbach
2007
The $-calculus process algebra for problem solving: A paradigmatic shift in handling hard computational problems
Theoretical Computer Science
383
2
200–243
10.1016/j.tcs.2007.04.012
Yuxi Fu
2014
Theory of Interaction
http://basics.sjtu.edu.cn/~yuxi/
Yuxi Fu
Hao Lu
2010
On the expressiveness of interaction
Theoretical Computer Science
411
11–13
1387 – 1451
10.1016/j.tcs.2009.11.011
R. J. van Glabbeek
W. Peter Weijland
1996
Branching time and abstraction in bisimulation semantics
Journal of the ACM (JACM)
43
3
555–600
10.1145/233551.233556
Rob J. van Glabbeek
1993
The linear time — branching time spectrum II
CONCUR'93
Springer
66–81
10.1007/3-540-57208-2_6
Rob J. van Glabbeek
Bas Luttik
Nikola Trčka
2009
Branching bisimilarity with explicit divergence
Fundamenta Informaticae
93
4
371–392
10.3233/FI-2009-109
Daniele Gorla
2010
Towards a unified approach to encodability and separation results for process calculi
Inf. Comput.
208
9
1031–1053
10.1016/j.ic.2010.05.002
Robin Milner
1990
Functions as processes
Michael S. Paterson
Automata, Languages and Programming
Lecture Notes in Computer Science
443
Springer Berlin Heidelberg
167–180
10.1007/BFb0032030
Robin Milner
Joachim Parrow
David Walker
1992
A calculus of mobile processes, I & II
Information and computation
100
1
1–77
10.1016/0890-5401(92)90008-4
C. A. Petri
1962
Kommunikation mit Automaten.
Bonn: Institut für Instrumentelle Mathematik, Schriften des IIM Nr. 2
I. C. C. Phillips
1993
A Note on Expressiveness of Process Algebra
G. L. Burn
S. Gay
M. D. Ryan
Proceedings of the First Imperial College Department of Computing Workshop on Theory and Formal Methods
Workshops in Computing
Springer-Verlag
260–264
10.1007/978-1-4471-3503-6_20
Davide Sangiorgi
David Walker
2001
The Pi-Calculus - a theory of mobile processes
Cambridge University Press
Alan Mathison Turing
1936
On computable numbers, with an application to the Entscheidungsproblem
J. of Math
58
345–363