Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

12

MFCS
1993
Springer

favoriteEmaildiscussreport

70views Theoretical Computer Science» more MFCS 1993»

Deterministic Behavioural Models for Concurrency

13 years 9 months ago

Deterministic Behavioural Models for Concurrency

Download eprints.ecs.soton.ac.uk

Abstract This paper oﬀers three candidates for a deterministic, noninterleaving, behaviour model which generalizes Hoare traces to the noninterleaving situation. The three models are all proved equivalent in the rather strong sense of being equivalent as categories. The models are: deterministic labelled event structures, generalized trace languages in which the independence relation is context-dependent, and deterministic languages of pomsets.

Vladimiro Sassone, Mogens Nielsen, Glynn Winskel

Real-time Traffic

Deterministic Labelled Event | Deterministic Languages | Hoare Traces | MFCS 1993 | Theoretical Computer Science |

claim paper

Related Content

» A Conformance Testing Method for Communication Protocols Modeled as Concurrent DFSMs

» Relationships Between Models of Concurrency

» Modelling deterministic concurrent IO

» A deterministic multiway rendezvous library for haskell

» Finding safety errors with ACO

» Celling SHIM compiling deterministic concurrency to a heterogeneous multicore

» Parametric Performance Contracts for Software Components with Concurrent Behaviour

» BackForth Equivalences for Design of Concurrent Systems

» Modelling Remote Concurrency with Ada

Post Info
More Details (n/a)

Added	10 Aug 2010
Updated	10 Aug 2010
Type	Conference
Year	1993
Where	MFCS
Authors	Vladimiro Sassone, Mogens Nielsen, Glynn Winskel

Comments (0)