Skip to main content
Article thumbnail
Location of Repository

On Observing Dynamic Prioritised Actions in SOC

By Rosario Pugliese, Francesco Tiezzi and Nobuko Yoshida

Abstract

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

Topics: QA75 Electronic computers. Computer science
Publisher: Springer
Year: 2009
DOI identifier: 10.1007/978-3-642-02930-1_46
OAI identifier: oai:eprints.imtlucca.it:405

Suggested articles

Citations

  1. (2007). A calculus for orchestration of web services. doi
  2. (1999). A Practical Approach to Implementing Real-Time Semantics.
  3. (2001). A Real-Time Process Algebra with Open Intervals and Maximal Progress.
  4. (2007). A theory for observational fault tolerance. doi
  5. (1991). An Object Calculus for Asynchronous Communication. doi
  6. (1992). Barbed Bisimulation. doi
  7. (2007). Disciplining Orchestration and Conversation doi
  8. (2001). On Barbed Equivalences in pi-Calculus. doi
  9. (1998). On Bisimulations for the Asynchronous piCalculus. doi
  10. (1995). On Reduction-Based Process Semantics. doi
  11. (2009). Specification and Analysis of Service-Oriented Applications.

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.