Rob J. van Glabbeek

Learn More
In comparative concurrency semantics, one usually distinguishes between <italic>linear time</italic> and <italic>branching time</italic> semantic equivalences. Milner's notion of <italic>observatin equivalence</italic> is often mentioned as the standard example of a branching time equivalence. In this paper we investigate whether observation equivalence(More)
We study an operator for refinement of actions to be used in the design of concurrent systems. Actions on a given level of abstraction are replaced by more complicated processes on a lower level. This is done in such a way that the behaviour of the refined system may be inferred compositionally from the behaviour of the original system and from the(More)
12a. DISTRIBUTION / AVAILABILITY STATEMENT 12b. DISTRIBUTION CODE 13. ABSTRACT (Maximum 200 words) We introduce three models of probabilistic processes, namely, reactive, generative and stratified. These models are investigated within the context of PCCS, an extension of Milner's SCCS in which each summand of a process summation expression is guarded by a(More)
In this paper we discuss the issue of interleaving semantics versus True concurrency in an algebraic setting. We present various equivalence notions on Petri nets which can be used in the construction of algebraic models: (a) the occurrence net equivalence of Nielsen, Plotkin & Winskel; (b) bisimulation equivalence, which leads to a model which is(More)
This paper reviews several methods to associate transition relations to transition system specifications with negative premises in Plotkin’s structural operational style. Besides a formal comparison on generality and relative consistency, the methods are also evaluated on their taste in determining which specifications are meaningful and which are not.(More)
In 1992 Wang &amp; Larsen extended the may- and must preorders of De Nicola and Hennessy to processes featuring probabilistic as well as nondeterministic choice. They concluded with two problems that have remained open throughout the years, namely to find complete axiomatisations and alternative characterisations for these preorders. This paper solves both(More)
In this paper I compare the expressive power of several models of concurrency based on their ability to represent causal dependence. To this end, I translate these models, in behaviour preserving ways, into the model of higher dimensional automata, which is the most expressive model under investigation. In particular, I propose four different translations(More)