This note collects some of the author's favourite results in classic process algebra, broadly construed, and points to some open problems in the field. It is hoped that this piece will offer a modest contribution to the healthy development of this area of researc
In this paper a process is viewed as a labeled graph modulo bisimulation equivalence. Three topics a...
... this paper, we present Equational Semantics, a formalism largely inspired by attribute grammars ...
The problem of designing a system which in a given environment C should satisfy a given specificatio...
This paper studies nested simulation and nested trace semantics over the language BCCSP, a basic for...
This paper studies nested simulation and nested trace semantics over the language BCCSP, a basic for...
AbstractOne of the criteria that has been put forward for studying the mathematical tractability of ...
AbstractThis paper studies nested simulation and nested trace semantics over the language BCCSP, a b...
Van Glabbeek (1990) presented the linear time/branching time spectrum of behavioral equivalences for...
Abstract. Van Glabbeek (1990) presented the linear time/branching time spectrum of behavioral equiva...
AbstractSeveral types of trees are proposed in the literature to model the behaviour of nondetermini...
AbstractWe extend Robin Milner's sequential process calculus to tree process calculus in a way simil...
This thesis is concerned with the algebraic theory of finite state processes. The processes we focus...
In this paper, we present a number of closely related models of process algebra, called finite-graph...
We present a direct translation from a sub-logic of µ-calculus to non-deterministic binary automata ...
We study languages of nested trees—structures obtained by augmenting trees with sets of nested jump-...
In this paper a process is viewed as a labeled graph modulo bisimulation equivalence. Three topics a...
... this paper, we present Equational Semantics, a formalism largely inspired by attribute grammars ...
The problem of designing a system which in a given environment C should satisfy a given specificatio...
This paper studies nested simulation and nested trace semantics over the language BCCSP, a basic for...
This paper studies nested simulation and nested trace semantics over the language BCCSP, a basic for...
AbstractOne of the criteria that has been put forward for studying the mathematical tractability of ...
AbstractThis paper studies nested simulation and nested trace semantics over the language BCCSP, a b...
Van Glabbeek (1990) presented the linear time/branching time spectrum of behavioral equivalences for...
Abstract. Van Glabbeek (1990) presented the linear time/branching time spectrum of behavioral equiva...
AbstractSeveral types of trees are proposed in the literature to model the behaviour of nondetermini...
AbstractWe extend Robin Milner's sequential process calculus to tree process calculus in a way simil...
This thesis is concerned with the algebraic theory of finite state processes. The processes we focus...
In this paper, we present a number of closely related models of process algebra, called finite-graph...
We present a direct translation from a sub-logic of µ-calculus to non-deterministic binary automata ...
We study languages of nested trees—structures obtained by augmenting trees with sets of nested jump-...
In this paper a process is viewed as a labeled graph modulo bisimulation equivalence. Three topics a...
... this paper, we present Equational Semantics, a formalism largely inspired by attribute grammars ...
The problem of designing a system which in a given environment C should satisfy a given specificatio...