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. © 2009 Springer Berlin Heidelberg.
CITATION STYLE
Pugliese, R., Tiezzi, F., & Yoshida, N. (2009). On observing dynamic prioritised actions in SOC. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5556 LNCS, pp. 558–570). https://doi.org/10.1007/978-3-642-02930-1_46
Mendeley helps you to discover research relevant for your work.