AbstractWe give four domains for concurrency in a uniform way by means of domain equations. The domains are intended for modelling the four possible combinations of linear time versus branching time, and of interleaving versus noninterleaving concurrency. We use the linear time, noninterleaved domain to give operational and denotational semantics for a simple concurrent language with recursion, and prove that O = D
In this paper sets of labelled partial orders are employed as fundamental mathematical entities for ...
AbstractThis paper develops a truly concurrent semantical approach, whereby concurrency is notionall...
AbstractTransition systems as proposed by Hennessy and Plotkin are defined for a series of three lan...
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 framework allowing a unified and rigorous definition of the semantics of concurrency is proposed. ...
We develop a 2-categorical theory for recursively defined domains. In particular, we generalise the ...
A simple domain theory for concurrency is presented. Based on a categorical model of linear logic an...
We present a variety of denotational linear time semantics for a language with recursion and true co...
We define for a simple concurrent rmperat~ve language both operational and denotat~onal semantic mod...
AbstractWe consider two ways of assigning semantics to a class of statements built from a set of ato...
textabstractWe study the semantics of a simple language with concurrency and recursion. Our semantic...
We consider two ways of assigning semantics to a class of statements built from a set of atomic acti...
AbstractModels for concurrency can be classified with respect to three relevant parameters: behaviou...
Models for concurrency can be classified with respect to three relevant parameters: behaviour/system...
In this paper sets of labelled partial orders are employed as fundamental mathematical entities for ...
AbstractThis paper develops a truly concurrent semantical approach, whereby concurrency is notionall...
AbstractTransition systems as proposed by Hennessy and Plotkin are defined for a series of three lan...
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 framework allowing a unified and rigorous definition of the semantics of concurrency is proposed. ...
We develop a 2-categorical theory for recursively defined domains. In particular, we generalise the ...
A simple domain theory for concurrency is presented. Based on a categorical model of linear logic an...
We present a variety of denotational linear time semantics for a language with recursion and true co...
We define for a simple concurrent rmperat~ve language both operational and denotat~onal semantic mod...
AbstractWe consider two ways of assigning semantics to a class of statements built from a set of ato...
textabstractWe study the semantics of a simple language with concurrency and recursion. Our semantic...
We consider two ways of assigning semantics to a class of statements built from a set of atomic acti...
AbstractModels for concurrency can be classified with respect to three relevant parameters: behaviou...
Models for concurrency can be classified with respect to three relevant parameters: behaviour/system...
In this paper sets of labelled partial orders are employed as fundamental mathematical entities for ...
AbstractThis paper develops a truly concurrent semantical approach, whereby concurrency is notionall...
AbstractTransition systems as proposed by Hennessy and Plotkin are defined for a series of three lan...
DOI
Add to ORKG