Abstract. Service oriented applications feature interactions among several participants over the network. Mechanisms such as correlation sets and two-party sessions have been propo...
A technique is proposed for computing the weakest sufficient (wsc) and strongest necessary (snc) conditions for formulas in an expressive fragment of first-order logic using quant...
Patrick Doherty, Witold Lukaszewicz, Andrzej Szala...
We propose a process calculus to study the behavioural theory of Mobile Ad Hoc Networks. The operational semantics of our calculus is given both in terms of a Reduction Semantics ...
Exploiting linear type structure, we introduce a new theory bisimilarity for the π-calculus in which we abstract away not only τ-actions but also non-τ actions which do not aff...
Subbisimilarity is proposed as a general tool to classify the relative expressive power of process calculi. The expressiveness of several variants of CCS is compared in terms of t...