z-logo
open-access-imgOpen Access
Relationships between Models of Concurency
Author(s) -
Mogens Nielsen,
Vladimiro Sassone,
Glynn Winskel
Publication year - 1993
Publication title -
daimi pb
Language(s) - English
Resource type - Journals
eISSN - 2245-9316
pISSN - 0105-8517
DOI - 10.7146/dpb.v22i456.6929
Subject(s) - interleaving , concurrency , abstraction , branching (polymer chemistry) , semantics (computer science) , computer science , theoretical computer science , mathematics , programming language , epistemology , philosophy , materials science , composite material , operating system
Models for concurrency can be classified with respect to the 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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here