Failure semantics

With the aim to preserve deadlock freedom, we define a new refinement preorder for modal transition systems (MTSs), using an MTS… (More)

In a Service-Oriented Architecture (SOA), services publish descriptions to permit their composition into larger services. There… (More)

We present a finite ω-complete axiomatization for the process algebra BCCSP modulo failure semantics, in case of a finite… (More)

Refinement in bisimulation semantics is defined differently from refinement in failure semantics: in bisimulation semantics… (More)

Recently mobile agent technology has been recognised as a potential tool for realising distributed network fault management. The… (More)

Within the framework of concurrent systems, several veriication approaches require as a preliminary step the complete derivation… (More)

To optimize performance in Q fault-tolerant distributed system, it is often necessary to enforce different failure semantics f o… (More)

Modem manufacturing systems require a very high degree of user confidence in their ability to survive various system failures in… (More)

March 1, 1991 Many computer-supported applications are of long duration and consist of multiple steps that are executed over… (More)

A basic question in the theory of communicating processes is “When should two processes be considered equivalent?”. Attempts to… (More)