#### Filter Results:

#### Publication Year

1993

2002

#### Co-author

#### Key Phrase

#### Publication Venue

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)

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)

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)

- ‹
- 1
- ›