#### Filter Results:

- Full text PDF available (14)

#### Publication Year

1993

2007

- This year (0)
- Last 5 years (0)
- Last 10 years (1)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Michel A. Reniers, Jan Friso Groote, Mark van der Zwaag, Jos van Wamel
- Fundam. Inform.
- 2002

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 syntax,… (More)

- Jan Friso Groote, Jos van Wamel
- Theor. Comput. Sci.
- 2001

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)

- Loe M. G. Feijs, Frans A. C. Meijs, Jean R. Moonen, Jos van Wamel
- IWTCS
- 1998

- Jan Friso Groote, Jos van Wamel
- Sci. Comput. Program.
- 2001

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)

- Jos van Wamel
- Theor. Comput. Sci.
- 1997

An axiom system ACP lm is presented as a variant of the process algebra ACP (Algebra of Communicating Processes). The acronym ACP lm stands for ACP with abstraction, extended with operators and axioms for language matching. Language matching is a technique based on trace information for labelling and cutting oo process terms that do not match some given… (More)

In this paper a thorough treatment of elementary data types is given in the speciication language CRL, which integrates data speciication with process speciication. Data speciication in CRL is directly based on the theory of algebraic data types, which is an equational theory, extended with a rule for constructor induction. Speciications of the following… (More)

- Jan A. Bergstra, Alban Ponse, Jos van Wamel
- REX School/Symposium
- 1993

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)

Timed CRL is a process algebra-based formalism for the speciication and veriication of parallel, communicating systems with explicit time 6, 9]. In this paper various basic results are presented, such as theorems for basic forms, the expansion of terms with operators for parallelism, elimination of parallelism, and commutativity of the merge and… (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)