AbstractA formulation of semantic theories for processes which does not rely on the notion of observables or convergence is studied. The new construction is based solely on a reduction relation and equational reasoning, but can induce meaningful theories for processes, both in weak and strong settings. The resulting theories in many cases coincide with, and sometimes generalise, observation-based formulation of behavioural equivalence. The basic construction of reduction-based theories is studied, taking a simple name passing calculus (called ν-calculus) and its extensions as an example. Results concerning the application of our construction to other calculi are also briefly discussed
Introduction Process algebras, such as CCS [Mil89], CSP [Hoa85], and ACP [JJ85], were developed orig...
Algebraic Theory of Processes provides the first general and systematic introduction to the semantic...
Abstract ory of concurrency; the symbol; represents We present a simple process algebra which suppor...
AbstractA formulation of semantic theories for processes which does not rely on the notion of observ...
Abstract. A formulation of semantic theories for processes which is based on reduction relation and ...
AbstractThis talk offers a survey of negative results on the existence of finite equational axiomati...
This paper presents a general technique for obtaining new results pertaining to the non-finite axiom...
AbstractA general approach for defining behavioral preorders over process terms as the maximal preco...
AbstractA poweful paradigm is presented for defining semantics of data types which can assign sensib...
AbstractThis paper develops a mathematical framework to describe and reason about semantic theories ...
In this paper a process is viewed as a labeled graph modulo bisimulation equivalence. Three topics a...
AbstractThe semantics of process calculi has traditionally been specified by labelled transition sys...
The semantics of process calculi has traditionally been specified by labelled transition systems (LT...
The focus of process calculi is interaction rather than computation, and for this very reason: (i) t...
The semantics of process calculi has traditionally been specified by labelled transition systems (LT...
Introduction Process algebras, such as CCS [Mil89], CSP [Hoa85], and ACP [JJ85], were developed orig...
Algebraic Theory of Processes provides the first general and systematic introduction to the semantic...
Abstract ory of concurrency; the symbol; represents We present a simple process algebra which suppor...
AbstractA formulation of semantic theories for processes which does not rely on the notion of observ...
Abstract. A formulation of semantic theories for processes which is based on reduction relation and ...
AbstractThis talk offers a survey of negative results on the existence of finite equational axiomati...
This paper presents a general technique for obtaining new results pertaining to the non-finite axiom...
AbstractA general approach for defining behavioral preorders over process terms as the maximal preco...
AbstractA poweful paradigm is presented for defining semantics of data types which can assign sensib...
AbstractThis paper develops a mathematical framework to describe and reason about semantic theories ...
In this paper a process is viewed as a labeled graph modulo bisimulation equivalence. Three topics a...
AbstractThe semantics of process calculi has traditionally been specified by labelled transition sys...
The semantics of process calculi has traditionally been specified by labelled transition systems (LT...
The focus of process calculi is interaction rather than computation, and for this very reason: (i) t...
The semantics of process calculi has traditionally been specified by labelled transition systems (LT...
Introduction Process algebras, such as CCS [Mil89], CSP [Hoa85], and ACP [JJ85], were developed orig...
Algebraic Theory of Processes provides the first general and systematic introduction to the semantic...
Abstract ory of concurrency; the symbol; represents We present a simple process algebra which suppor...