Learn More
In [25] a straightforward extension of the process algebra £ CRL was proposed to explicitly deal with time. The process algebra £ CRL has been especially designed to deal with data in a process algebraic context. Using the features for data, only a minor extension of the language was needed to obtain a very expressive variant of time. But [25] contains(More)
In [9], a straightforward extension of the process algebra µCRL was proposed to explicitly deal with time. The process algebra µCRL has been designed especially to deal with data in a process algebraic context. Using the features for data, only a minor extension of the language was needed to obtain a very expressive variant of time. But [9] contains syntax,(More)
A general basis for the deenition of a nite but unbounded number of parallel processes is the equation S(n; dt) = P (0; get (0; dt))/ eq (n; 0) .(P (n; get (n; dt)) k S(n ? 1; dt)). In this formula eq(n; 0) is an equality test, and get (n; dt) denotes the n-th data element in table dt. We derive a linear process equation with the same behaviour as S(n; dt),(More)
We present the formal speciication and veriication of a lip synchronisation algorithm using the real-time model checker UPPAAL. A number of speciications of this algorithm can be found in the literature, but this is the rst automatic veriication. We take a published speciication of the algorithm, code it up in the UPPAAL timed automata notation and then(More)
Preface Computer software and network protocols are increasingly important in daily life. At the same time the complexity of software has rocketed, so that its correctness is at stake. New methodologies and disciplines are being developed to bring structure to the ever growing jungle of computer technology. (Semi-)automated manipulation has become an(More)