Process algebras with data, such as LOTOS, PSF, FDR, and mCRL2, are very suitable to model and analyse combinatorial problems. Contrary to more traditional mathematics, many of these problems can very directly be formulated in process algebra. Using a wide range of techniques, such as behavioural reductions, model checking, and visualisation, the problems can subsequently be easily solved. With the advent of probabilistic process algebras this also extends to problems where probabilities play a role. In this paper we model and analyse a number of very well-known – yet tricky – problems and show the elegance of behavioural analysis.
|Title of host publication||ModelEd, TestEd, TrustEd|
|Subtitle of host publication||Essays Dedicated to Ed Brinksma on the Occasion of His 60th Birthday|
|Editors||Joost-Pieter Katoen, Rom Langerak, Arend Rensink|
|Place of Publication||Cham|
|Number of pages||16|
|Publication status||Published - 2017|
|Name||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|