Deterministic Behavioural Models for Concurrency

Abstract This paper offers 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.

• Type: Conference
• Year: 1993
• Where: MFCS
• Authors: Vladimiro Sassone, Mogens Nielsen, Glynn Winskel
• Keywords: Deterministic Labelled Event, Deterministic Languages, Hoare Traces, MFCS 1993, Theoretical Computer Science