On Observing Dynamic Prioritised Actions in SOC

Authors:
Rosario Pugliese;Francesco Tiezzi;Nobuko Yoshida
Affiliations:
Dipartimento di Sistemi e Informatica, Università degli Studi di Firenze,;Dipartimento di Sistemi e Informatica, Università degli Studi di Firenze,;Department of Computing, Imperial College London,
Venue:
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Year:
2009

Citing 10
Cited 2

On reduction-based process semantics

Selected papers of the thirteenth conference on Foundations of software technology and theoretical computer science
On bisimulations of the asynchronous &pgr;-calculus

Theoretical Computer Science
A practical approach to implementing real-time semantics

Annals of Software Engineering
An Object Calculus for Asynchronous Communication

ECOOP '91 Proceedings of the European Conference on Object-Oriented Programming
Barbed Bisimulation

ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
On Barbed Equivalences in pi-Calculus

CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
A real-time process algebra with open intervals and maximal progress

Nordic Journal of Computing
Disciplining Orchestration and Conversation in Service-Oriented Computing

SEFM '07 Proceedings of the Fifth IEEE International Conference on Software Engineering and Formal Methods
A calculus for orchestration of web services

ESOP'07 Proceedings of the 16th European conference on Programming
Multiparty sessions in SOC

COORDINATION'08 Proceedings of the 10th international conference on Coordination models and languages

Behavioral theory for session-oriented calculi

Rigorous software engineering for service-oriented systems
The SENSORIA approach applied to the finance case study

Rigorous software engineering for service-oriented systems

Quantified Score

Hi-index	0.00

Visualization

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.