Models 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

Nielsen, M.

Sassone, V.

Winskel, G.

English

Southampton (e-Prints Soton)

A Classiﬁcation of Models for Concurrency.

A Structural Approach to Operational Semantics.

A Trace Semantics for Petri Nets.

Algebraic Theory of Processes.

Basic Notions of Trace Theory.

Categories for the Working Mathematician.

Categories of Asynchronous Transition Systems.

Communicating Sequential Processes. Englewood Cliﬀs,

Communication and Concurrency. Englewood Cliﬀs,

Concurrent Machines.

Concurrent Transition Systems.

Deterministic Behavioural Models for Concurrency.

Event Structure Semantics of CCS and Related Languages.

Event Structures.

Formal Veriﬁcation of Parallel Programs.

Modeling Concurrency with Partial Orders.

Models for Concurrency. To appear in the Handbook of Logic in Computer Science. A draft appears as technical report

On Partial Languages. Fundamenta Informaticae,

Petri nets, Event Structures and Domains, part 1.

Synchronization Trees.

The Equational Theory of Pomsets.

Traces and Semiwords.

Relationships between Models for Concurrency

Relationships between Models for Concurrency

Abstract

Similar works

Full text

Available Versions

Southampton (e-Prints Soton)