×

On observing dynamic prioritised actions in SOC. (English) Zbl 1248.68099

Albers, Susanne (ed.) et al., Automata, languages and programming. 36th international colloquium, ICALP 2009, Rhodes, Greece, July 5–12, 2009. Proceedings, Part II. Berlin: Springer (ISBN 978-3-642-02929-5/pbk). Lecture Notes in Computer Science 5556, 558-570 (2009).
Summary: We study the impact on observational semantics for SOC of priority mechanisms which combine dynamic priority with local pre-emption. We define manageable notions of strong and weak labelled bisimilarities for COWS, a process calculus for SOC, and provide alternative characterisations in terms of open barbed bisimilarities. These semantics show that COWS’s priority mechanisms partially recover the capability to observe receive actions (that could not be observed in a purely asynchronous setting) and that high priority primitives for termination impose specific conditions on the bisimilarities.
For the entire collection see [Zbl 1166.68002].

MSC:

68M14 Distributed systems
68W15 Distributed algorithms

Software:

COWS
PDFBibTeX XMLCite
Full Text: DOI Link