Add to ORKGModels for concurrency can be classified with respect to three relevant parameters: behaviour/system, interleaving/noninterleaving, linear/branching time. When modelling a process, a choice concerning such parameters corresponds to choosing the level of abstraction of the resulting semantics. The classifications are formalized through the medium of category theory
We study models of concurrency based on labelled transition systems where abstractions are induced ...
A flexible abstraction mechanism for models of concurrency, which allows systems which "look the sam...
AbstractA simple domain theory for concurrency is presented. Based on a categorical model of linear ...
Models for concurrency can be classified with respect to the three relevant parameters: behaviour/s...
Models for concurrency can be classified with respect to the three relevant parameters: behaviour/sy...
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...
Abstract. Models for concurrency can be classified with respect to three rel-evant parameters: behav...
Revised version of DAIMI PB-429 This is, we believe, the final version of a chapter for the Handboo...
This paper offers three candidates for a deterministic, noninterleaving, behaviour model which gener...
CHIARA BODEI Dipartimento di Informatica, Universit`a di Pisa Corso Italia, 40, I-56125 Pisa, Italy...
The paper defines a taxonomy of concurrent models. Concurrent models are seen as categories and pass...
A simple domain theory for concurrency is presented. Based on a categorical model of linear logic an...
This paper retraces, collects, and summarises contributions of the authors --- in collaboration with...
Fairness in a non-interleaving semantic model for concurrency has been investigated. In contrast to ...
We study models of concurrency based on labelled transition systems where abstractions are induced ...
A flexible abstraction mechanism for models of concurrency, which allows systems which "look the sam...
AbstractA simple domain theory for concurrency is presented. Based on a categorical model of linear ...
Models for concurrency can be classified with respect to the three relevant parameters: behaviour/s...
Models for concurrency can be classified with respect to the three relevant parameters: behaviour/sy...
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...
Abstract. Models for concurrency can be classified with respect to three rel-evant parameters: behav...
Revised version of DAIMI PB-429 This is, we believe, the final version of a chapter for the Handboo...
This paper offers three candidates for a deterministic, noninterleaving, behaviour model which gener...
CHIARA BODEI Dipartimento di Informatica, Universit`a di Pisa Corso Italia, 40, I-56125 Pisa, Italy...
The paper defines a taxonomy of concurrent models. Concurrent models are seen as categories and pass...
A simple domain theory for concurrency is presented. Based on a categorical model of linear logic an...
This paper retraces, collects, and summarises contributions of the authors --- in collaboration with...
Fairness in a non-interleaving semantic model for concurrency has been investigated. In contrast to ...
We study models of concurrency based on labelled transition systems where abstractions are induced ...
A flexible abstraction mechanism for models of concurrency, which allows systems which "look the sam...
AbstractA simple domain theory for concurrency is presented. Based on a categorical model of linear ...