Add to ORKGWe develop a 2-categorical theory for recursively defined domains. In particular, we generalise the traditional approach based on order-theoretic structures to categorytheoretic ones. A motivation for this development is the need of a domain theory for concurrency, with an account of bisimulation. Indeed, the leading examples throughout the paper are provided by recursively defined presheaf models for concurrent process calculi. Further, we use the framework to study (open-map) bisimulation
In this paper sets of labelled partial orders are employed as fundamental mathematical entities for ...
AbstractSome basic topics in the theory of concurrency are studied from the point of view of denotat...
AbstractWe generalise the traditional approach of Smyth and Plotkin to the solution of recursive dom...
We develop a 2-categorical theory for recursively defined domains.In particular, we generalise the t...
AbstractA simple domain theory for concurrency is presented. Based on a categorical model of linear ...
A simple domain theory for concurrency is presented. Based on a categorical model of linear logic an...
A simple domain theory for concurrency is presented. Based on a categorical model of linear logic an...
AbstractWe give four domains for concurrency in a uniform way by means of domain equations. The doma...
AbstractA simple domain theory for concurrency is presented. Based on a categorical model of linear ...
A framework allowing a unified and rigorous definition of the semantics of concurrency is proposed. ...
The paper defines a taxonomy of concurrent models. Concurrent models are seen as categories and pass...
In this paper we study a higher-order process calculus, a restriction of one due to Boudol, and deve...
. We give an axiomatic category theoretic account of bisimulation in process algebras based on the i...
AbstractThe concept of bisimulation from concurrency theory is used to reason about recursively defi...
This report surveys a range of models for parallel computation to include interleaving models like t...
In this paper sets of labelled partial orders are employed as fundamental mathematical entities for ...
AbstractSome basic topics in the theory of concurrency are studied from the point of view of denotat...
AbstractWe generalise the traditional approach of Smyth and Plotkin to the solution of recursive dom...
We develop a 2-categorical theory for recursively defined domains.In particular, we generalise the t...
AbstractA simple domain theory for concurrency is presented. Based on a categorical model of linear ...
A simple domain theory for concurrency is presented. Based on a categorical model of linear logic an...
A simple domain theory for concurrency is presented. Based on a categorical model of linear logic an...
AbstractWe give four domains for concurrency in a uniform way by means of domain equations. The doma...
AbstractA simple domain theory for concurrency is presented. Based on a categorical model of linear ...
A framework allowing a unified and rigorous definition of the semantics of concurrency is proposed. ...
The paper defines a taxonomy of concurrent models. Concurrent models are seen as categories and pass...
In this paper we study a higher-order process calculus, a restriction of one due to Boudol, and deve...
. We give an axiomatic category theoretic account of bisimulation in process algebras based on the i...
AbstractThe concept of bisimulation from concurrency theory is used to reason about recursively defi...
This report surveys a range of models for parallel computation to include interleaving models like t...
In this paper sets of labelled partial orders are employed as fundamental mathematical entities for ...
AbstractSome basic topics in the theory of concurrency are studied from the point of view of denotat...
AbstractWe generalise the traditional approach of Smyth and Plotkin to the solution of recursive dom...