Models for Concurrency

Winskel, Glynn; Nielsen, Mogens

doi:10.7146/dpb.v21i429.6743

Cited by 145 publications

(303 citation statements)

References 0 publications

Supporting

Mentioning

303

Contrasting

Order By: Relevance

“…[WN94], but this one will suffice for our purposes. Note that a morphism from T 1 to T 2 is guaranteed to take runs of T 1 into runs of T 2 .…”

Section: Introductionmentioning

confidence: 99%

Controller synthesis for bisimulation equivalence

Tabuada¹

2008

Systems & Control Letters

View full text Add to dashboard Cite

Abstract. The objective of this paper is to solve the controller synthesis problem for bisimulation equivalence in a wide variety of scenarios including discrete-event systems, nonlinear control systems, behavioral systems, hybrid systems and many others. This will be accomplished by showing that the arguments underlying proofs of existence and methods for the construction of controllers are extraneous to the particular class of systems being considered and thus can be presented in greater generality.

show abstract

“…[WN94], but this one will suffice for our purposes. Note that a morphism from T 1 to T 2 is guaranteed to take runs of T 1 into runs of T 2 .…”

Section: Introductionmentioning

confidence: 99%

Controller synthesis for bisimulation equivalence

Tabuada¹

2008

Systems & Control Letters

View full text Add to dashboard Cite

show abstract

“…A good survey of some of these models using a categorical approach can be found in [WN95]. We will instead give an overview of one of the pioneering (asynchronous) process calculi, Communicating Sequential Processes (CSP), and its trace semantic model [Hoa80], often called Hoare traces.…”

Section: Asynchronymentioning

confidence: 99%

On the Compositionality of Round Abstraction

Ghica

Menaa

2010

CONCUR 2010 - Concurrency Theory

View full text Add to dashboard Cite

Game Semantics is an approach to denotational semantics that has been successful in providing accurate, fully abstract models for various programming languages. It has thereafter been applied, amongst other things, to model checking, access control analysis, information flow analysis, and recently, hardware synthesis.While the roots of modern Game Semantics are sequential, several game models of asynchronous concurrency have since been devised. However, synchronous concurrency has not been considered hitherto.This thesis studies synchronous concurrency in game-like models. The central idea is to investigate deriving such synchronous models from their asynchronous counterparts using round abstraction-a technique that allows aggregating a sequence of computational steps to form a larger, more abstract macro-step.We define round abstraction within a trace-semantic setting that generalises game semantic models. We note that, in general, round abstraction is not compositional. We then identify sufficient conditions to guarantee correct composition, thereby proposing a framework for round abstraction that is sound when applied to synchronous and asynchronous behaviours.

show abstract

“…and these give rise to a fairly unsurprising definition [16] of morphism for asynchronous transition systems. However, we observe a peculiarity in the category of resource graphs.…”

Section: F : G----~ G'mentioning

confidence: 99%

“…We recall, from [16], the definition of the category of transition systems, 3"S and describe the subcategory, AT,S, of asynchronous transition systems, as eharacterised by Selinger. Composition of morphisms is given by pairwise (partial) function composition and the identity morphisms are simply pairs of identity functions on the respective sets.…”

Section: Asynchronous Systemsmentioning

confidence: 99%

Resource based models for asynchrony

Rathke

1998

Lecture Notes in Computer Science

View full text Add to dashboard Cite

We propose a new graph-based approach to modelling asynchronous languages and show how the new model can be dewed as a collapse of the standard transition system model for asynchronous behaviour by utilising the commuting properties of asynchronous transitions.The motivation behind these new models stems from the issue of regularity for asynchronous processes. We note that the class of regular processes fails to contain many useful asynchronous processes and we identify a larger subclass of BPP ~cordingly. We call this new class asynchrononsly regular processes.Using the new models we provide two appealing abstract chaxacterisatious of asynchronous bisimulation equivalence, namely, as spans of open maps and as a winning strategies for a bisimulation game. Also, by exploiting the coincidence of finite graphs with regular processes we see that bisimulation is polynomial time decidable over our class of asynchronously regular processes.

show abstract

Models for Concurrency

Cited by 145 publications

References 0 publications

Controller synthesis for bisimulation equivalence

Controller synthesis for bisimulation equivalence

On the Compositionality of Round Abstraction

Resource based models for asynchrony

Contact Info

Product

Resources

About