D. Austry & G. Boudol (1984):
Algèbre de processus et synchronisations.
Theoretical Computer Science 30(1),
pp. 91–131,
doi:10.1016/0304-3975(84)90067-7.
P. Baldan, A. Bracciali & R. Bruni (2007):
A semantic framework for open processes.
Theoretical Computer Science 389(3),
pp. 446–483,
doi:10.1016/j.tcs.2007.09.004.
J.A. Bergstra & J.W. Klop (1984):
The algebra of recursively defined processes and the algebra of regular processes.
In: J. Paredaens: Proceedings 11th ICALP, Antwerpen,
LNCS 172.
Springer,
pp. 82–94,
doi:10.1007/3-540-13345-3_7.
E. Bres, R.J. van Glabbeek & P. Höfner (2016):
A Timed Process Algebra for Wireless Networks with an Application in Routing.
Technical Report 9145.
NICTA.
Available at http://arxiv.org/abs/1606.03663.
Extended abstract in P. Thiemann, editor: Programming Languages and Systems: Proceedings 25th European Symposium on Programming, ESOP'16; held as part of the European Joint Conferences on Theory and Practice of Software, ETAPS'16, LNCS 9632, Springer, 2016, pp. 95-122.
S.D. Brookes, C.A.R. Hoare & A.W. Roscoe (1984):
A theory of communicating sequential processes.
Journal of the ACM 31(3),
pp. 560–599,
doi:10.1145/828.833.
W.J. Fokkink (2000):
Introduction to Process Algebra.
Texts in Theoretical Computer Science, An EATCS Series.
Springer,
doi:10.1007/978-3-662-04293-9.
W.J. Fokkink, R.J. van Glabbeek & B. Luttik (2017):
Divide and Congruence III: Stability & Divergence.
In: R. Meyer & U. Nestmann: Proceedings 28th International Conference on Concurrency Theory, CONCUR'17,
Leibniz International Proceedings in Informatics (LIPIcs) 85.
Schloss Dagstuhl–Leibniz-Zentrum für Informatik,
Dagstuhl, Germany,
pp. 15:1–15:16,
doi:10.4230/LIPIcs.CONCUR.2017.15.
Available at http://theory.stanford.edu/~rvg/abstracts.html#124.
F. Gadducci & U. Montanari (2000):
The tile model.
In: G.D. Plotkin, C. Stirling & M. Tofte: Proof, Language, and Interaction, Essays in Honour of Robin Milner.
The MIT Press,
pp. 133–166.
R.J. van Glabbeek (1993):
Full abstraction in structural operational semantics (extended abstract).
In: M. Nivat, C. Rattray, T. Rus & G. Scollo: Proceedings 3rd International Conference on Algebraic Methodology and Software Technology, AMAST'93, Twente, The Netherlands, June l993,
Workshops in Computing.
Springer,
pp. 77–84.
Available at http://theory.stanford.edu/~rvg/abstracts.html#28.
R.J. van Glabbeek (1994):
On the expressiveness of ACP (extended abstract).
In: A. Ponse, C. Verhoef & S.F.M. van Vlijmen: Proceedings First Workshop on the Algebra of Communicating Processes, ACP94,
Workshops in Computing.
Springer,
pp. 188–217,
doi:10.1007/978-1-4471-2120-6_8.
Available at http://theory.stanford.edu/~rvg/abstracts.html#31.
R.J. van Glabbeek (2017):
Lean and Full Congruence Formats for Recursion.
In: Proceedings 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS'17, Reykjavik, Iceland, 2017.
IEEE Computer Society Press,
doi:10.1109/LICS.2017.8005142.
Available at https://arxiv.org/abs/1704.03160.
R.J. van Glabbeek (2018):
A Theory of Encodings and Expressiveness.
In: C. Baier & U. Dal Lago: Proceeding 21st International Conference on Foundations of Software Science and Computational Structures, FoSSaCS'18; held as part of the European Joint Conferences on Theory and Practice of Software, ETAPS'18,
LNCS 10803.
Springer,
pp. 183–202,
doi:10.1007/978-3-319-89366-2_10.
J.F. Groote (1993):
Transition System Specifications with Negative Premises.
Theoretical Computer Science 118,
pp. 263–299,
doi:10.1016/0304-3975(93)90111-6.
J.F. Groote & F.W. Vaandrager (1992):
Structured Operational Semantics and Bisimulation as a Congruence.
Information and Computation 100(2),
pp. 202–260,
doi:10.1016/0890-5401(92)90013-6.
K.G. Larsen & X. Liu (1991):
Compositionality through an Operational Semantics of Contexts.
Journal of Logic and Computation 1(6),
pp. 761–795,
doi:10.1093/logcom/1.6.761.
N.A. Lynch & F.W. Vaandrager (1996):
Action Transducers and Timed Automata.
Formal Aspects of Computing 8(5),
pp. 499–538,
doi:10.1007/BF01211907.
Y.I. Manin (1977):
A Course in Mathematical Logic.
Graduate Texts in Mathematics 53.
Springer,
doi:10.1007/978-1-4757-4385-2.
R. Milner (1983):
Calculi for synchrony and asynchrony.
Theoretical Computer Science 25(3),
pp. 267–310,
doi:10.1016/0304-3975(83)90114-7.
R. Milner (1990):
Operational and algebraic semantics of concurrent processes.
In: J. van Leeuwen: Handbook of Theoretical Computer Science, chapter 19.
Elsevier Science Publishers B.V. (North-Holland),
pp. 1201–1242.
Alternatively see Communication and Concurrency, Prentice-Hall, Englewood Cliffs, 1989, of which an earlier version appeared as A Calculus of Communicating Systems, LNCS 92, Springer, 1980.
G.D. Plotkin (2004):
A Structural Approach to Operational Semantics.
Journal of Logic and Algebraic Programming 60–61,
pp. 17–139,
doi:10.1016/j.jlap.2004.05.001.
Originally appeared in 1981.
A. Rensink (2000):
Bisimilarity of Open Terms.
Information and Computation 156(1-2),
pp. 345–385,
doi:10.1006/inco.1999.2818.
R. de Simone (1985):
Higher-level synchronising devices in Meije-SCCS.
Theoretical Computer Science 37,
pp. 245–267,
doi:10.1016/0304-3975(85)90093-3.
eptcs@eptcs.org