Luca Aceto
Matthew Hennessy
1992
Termination, deadlock, and divergence
Journal of the ACM (JACM)
39
1
147–187
10.1145/147508.147527
Jos Baeten
Twan Basten
Michel Reniers
2010
Process algebra: equational theories of communicating processes
Cambridge Tracts in Theoretical Computer Science
50
Cambridge University Press
10.1017/CBO9781139195003
Jos Baeten
Jan Bergstra
Jan Klop
1993
Decidability of bisimulation equivalence for processes generating context-free languages
J. ACM
40
3
653–682
10.1145/174130.174141
Jos Baeten
Pieter Cuijpers
Paul van Tilburg
2008
A context-free process as a pushdown automaton
International Conference on Concurrency Theory
Springer
98–113
10.1007/978-3-540-85361-9_11
Jos Baeten
Bas Luttik
Paul van Tilburg
2013
Reactive Turing Machines
Inform. Comput.
231
143–166
10.1016/j.ic.2013.08.010
Jos Baeten
Bas Luttik
Fei Yang
2017
Sequential composition in the presence of intermediate termination
CoRR
abs/1706.08401
http://arxiv.org/abs/1706.08401
Jos C. M. Baeten
Pieter J. L. Cuijpers
Bas Luttik
P. J. A. van Tilburg
2009
A process-theoretic look at automata
Farhad Arbab
Marjan Sirjani
Fundamentals of Software Engineering, Third IPM International Conference, FSEN 2009, Kish Island, Iran, April 15-17, 2009, Revised Selected Papers
Lecture Notes in Computer Science
5961
Springer
1–33
10.1007/978-3-642-11623-0_1
Jos C. M. Baeten
Bas Luttik
Tim Muller
Paul van Tilburg
2016
Expressiveness modulo bisimilarity of regular expressions with parallel composition
Mathematical Structures in Computer Science
26
933–968
10.1017/S0960129514000309
Jos C. M. Baeten
Bas Luttik
Paul van Tilburg
2011
Computations and interaction
Raja Natarajan
Adegboyega K. Ojo
ICDCIT
Lecture Notes in Computer Science
6536
Springer
35–54
10.1007/978-3-642-19056-8_3
Jos C. M. Baeten
Bas Luttik
Paul van Tilburg
2012
Turing Meets Milner
Maciej Koutny
Irek Ulidowski
CONCUR
Lecture Notes in Computer Science
7454
Springer
1–20
10.1007/978-3-642-32940-1_1
Jan Bergstra
Inge Bethke
Alban Ponse
1994
Process algebra with iteration and nesting
The Computer Journal
37
4
243–258
10.1093/comjnl/37.4.243
Jan Bergstra
Alban Ponse
2001
Non-regular iterators in process algebra
Theoretical Computer Science
269
1
203–229
10.1016/S0304-3975(00)00413-8
Bard Bloom
1994
When is partial trace equivalence adequate?
Formal Aspects of Computing
6
3
317–338
10.1007/BF01215409
Wan Fokkink
Rob van Glabbeek
Bas Luttik
2017
Divide and congruence III: stability & divergence
Proceedings 28th International Conference on Concurrency Theory (CONCUR 2017)
Leibniz International Proceedings in Informatics (LIPIcs)
85
11:1–11:15
Rob van Glabbeek
Bas Luttik
Nikola Trčka
2009
Branching bisimilarity with explicit divergence
Fundamenta Informaticae
93
4
371–392
10.3233/FI-2009-109
Rob J. van Glabbeek
1993
The linear time - branching time spectrum II
Eike Best
CONCUR '93, 4th International Conference on Concurrency Theory, Hildesheim, Germany, August 23-26, 1993, Proceedings
Lecture Notes in Computer Science
715
Springer
66–81
10.1007/3-540-57208-2_6
Rob J. van Glabbeek
2004
The meaning of negative premises in transition system specifications II
J. Log. Algebr. Program.
60-61
229–258
10.1016/j.jlap.2004.03.007
Rob J. van Glabbeek
Bas Luttik
Nikola Trčka
2009
Computation Tree Logic with deadlock detection
Logical Methods in Computer Science
5
4
10.2168/LMCS-5(4:5)2009
Bas Luttik
Fei Yang
2015
Executable behaviour and the π-calculus (extended abstract)
Sophia Knight
Ivan Lanese
Alberto Lluch-Lafuente
Hugo Torres Vieira
Proceedings 8th Interaction and Concurrency Experience, ICE 2015, Grenoble, France, 4-5th June 2015.
EPTCS
189
37–52
10.4204/EPTCS.189.5
Bas Luttik
Fei Yang
2016
On the executability of interactive computation
Arnold Beckmann
Laurent Bienvenu
Natasa Jonoska
Pursuit of the Universal - 12th Conference on Computability in Europe, CiE 2016, Paris, France, June 27 - July 1, 2016, Proceedings
Lecture Notes in Computer Science
9709
Springer
312–322
10.1007/978-3-319-40189-8_32
Robin Milner
1989
Communication and concurrency
PHI Series in computer science
Prentice Hall
Faron Moller
1996
Infinite results
Ugo Montanari
Vladimiro Sassone
CONCUR '96, Concurrency Theory, 7th International Conference, Pisa, Italy, August 26-29, 1996, Proceedings
Lecture Notes in Computer Science
1119
Springer
195–216
10.1007/3-540-61604-7_56
David Park
1981
Concurrency and automata on infinite sequences
P. Deussen
Theoretical Computer Science
Lectures Notes in Computer Science
104
Springer
167–183
10.1007/BFb0017309
Alan Turing
1937
On Computable Numbers, with an Application to the Entscheidungsproblem
Proceedings of the London Mathematical Society
s2-42
1
230–265
10.1112/plms/s2-42.1.230