On Observing Dynamic Prioritised Actions in SOC
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.
Unable to display preview. Download preview PDF.
- 4.Cleaveland, R., Lüttgen, G., Natarajan, V.: Priorities in process algebra. In: Handbook of Process Algebra, pp. 391–424 (2001)Google Scholar
- 9.Lanese, I., et al.: Disciplining Orchestration and Conversation in Service-Oriented Computing. In: SEFM, pp. 305–314. IEEE, Los Alamitos (2007)Google Scholar
- 13.Tiezzi, F.: Specification and Analysis of Service-Oriented Applications. PhD Thesis, Univ. Florence (2009); http://rap.dsi.unifi.it/cows/theses/tiezzi_phdthesis.pdf