#### Filter Results:

#### Publication Year

1993

2002

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

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)

An extension of process algebra for modelling processes with backtracking is introduced. This extension is semantically based on processes that transform data because, in our view, backtracking is the undoing of the eeects caused by a process in some initial data-state if this process fails. The data-states are given by a data environment, which is a… (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 study three simple hybrid control systems in timed µCRL [6]. A temperature regulation system, a bottle filling system and a railway gate control system are specified component-wise and expanded to linear process equations. Some basic properties of the systems are analysed and a few correctness requirements are proven to be satisfied. Although not… (More)

- Jos van Wamel
- 1998

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)

- Wan Fokkink, Jos Baeten, Luca Aceto, Jos van Wamel, Steven Klusener, Bas Luttik +1 other
- 2000

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)

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)