R.J. Aumann (1961):
Borel Structures for function Spaces.
Illinois Journal of Mathematics 5(4),
pp. 614–630,
doi:10.1215/ijm/1255631584.
J.C.M. Baeten & W.P. Weijland (1990):
Process algebra.
Cambridge tracts in theoretical computer science 18.
Cambridge University Press,
doi:10.1017/CBO978051162419.
R. van Beusekom, B. de Jonge, P. Hoogendijk & J. Nieuwenhuizen (2021):
Dezyne: Paving the Way to Practical Formal Software Engineering.
EPTCS 338,
pp. 19–30,
doi:10.4204/EPTCS.338.4.
Proceedings of the 6th Workshop on Formal Integrated Development, F-IDE2021.
Guy H. Broadfoot (2005):
ASD Case Notes: Costs and Benefits of Applying Formal Methods to Industrial Control Software.
In: John S. Fitzgerald, Ian J. Hayes & Andrzej Tarlecki: FM 2005: Formal Methods, International Symposium of Formal Methods Europe, Newcastle, UK, July 18-22, 2005, Proceedings,
Lecture Notes in Computer Science 3582.
Springer,
pp. 548–551,
doi:10.1007/11526841_39.
J.F. Groote & J. Lanik (2011):
Semantics, bisimulation and congruence results for a general stochastic process operator.
Computer Science Report 11/05.
Department of Mathematics and Computer Science, Eindhoven University of Technology.
Available at https://pure.tue.nl/ws/files/3214338/712142.pdf.
J.F. Groote & M.R. Mousavi (2014):
Modeling and Analysis of Communicating Systems.
MIT Press,
doi:10.7551/mitpress/9946.001.0001.
J.F. Groote & E.P. de Vink (2017):
Problem Solving Using Process Algebra Considered Insightful.
In: J.-P. Katoen, R. Langerak & A. Rensink: ModelEd, TestEd, TrustEd - Essays Dedicated to Ed Brinksma on the Occasion of His 60th Birthday,
Lecture Notes in Computer Science 10500.
Springer,
pp. 48–63,
doi:10.1007/978-3-319-68270-9_3.
J.F. Groote, F. Wiedijk & H. Zantema (2016):
A Probabilistic Analysis of the Game of the Goose.
SIAM Rev. 58(1),
pp. 143–155,
doi:10.1137/140983781.
A. Hartmanns & H. Hermanns (2014):
The Modest Toolset: An Integrated Environment for Quantitative Modelling and Verification.
In: E. Ábrahám & K. Havelund: Tools and Algorithms for the Construction and Analysis of Systems - 20th International Conference, TACAS 2014, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2014, Grenoble, France, April 5-13, 2014. Proceedings,
Lecture Notes in Computer Science 8413.
Springer,
pp. 593–598,
doi:10.1007/978-3-642-54862-8_51.
M.Z. Kwiatkowska, G. Norman & D. Parker (2011):
PRISM 4.0: Verification of Probabilistic Real-Time Systems.
In: G. Gopalakrishnan & S. Qadeer: Computer Aided Verification - 23rd International Conference, CAV 2011, Snowbird, UT, USA, July 14-20, 2011. Proceedings,
Lecture Notes in Computer Science 6806.
Springer,
pp. 585–591,
doi:10.1007/978-3-642-22110-1_47.
S.P. Luttik (2003):
On the expressiveness of choice quantification.
Ann. Pure Appl. Log. 121(1),
pp. 39–87,
doi:10.1016/S0168-0072(02)00082-9.
R. Milner (1973):
An approach to the semantics of parallel programs.
In: Convegno di Informatica Teorica, Pisa,
pp. 283–302.
R. Milner (1973):
A mathematical model of computing agents.
In: H.E. Rose & J.C. Shepherdson: Proceedings Logic Colloquium.
North-Holland,
pp. 283–302.
R. Milner (1980):
A Calculus of Communicating Systems.
Lecture Notes in Computer Science 92.
Springer,
doi:10.1007/3-540-10235-3.
W. Ott & J.A. Yorke (2005):
Prevalence.
Bulletin of the American Mathematical Society 42(3),
pp. 263–290,
doi:10.1090/S0273-0979-05-01060-8.
eptcs@eptcs.org