Failure semantics

In distributed computing, failure semantics is used to describe and classify errors that distributed systems can experience.
Wikipedia

Topic mentions per year

Topic mentions per year

1986-2017
024619862017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
With the aim to preserve deadlock freedom, we define a new refinement preorder for modal transition systems (MTSs), using an MTS… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2008
2008
In a Service-Oriented Architecture (SOA), services publish descriptions to permit their composition into larger services. There… (More)
Is this relevant?
2005
2005
We present a finite ω-complete axiomatization for the process algebra BCCSP modulo failure semantics, in case of a finite… (More)
  • figure 1
Is this relevant?
2002
2002
Refinement in bisimulation semantics is defined differently from refinement in failure semantics: in bisimulation semantics… (More)
  • figure 1
  • figure 2
  • table 1
  • table 2
  • figure 3
Is this relevant?
2000
2000
Recently mobile agent technology has been recognised as a potential tool for realising distributed network fault management. The… (More)
  • figure 1
  • table 1
  • table 2
  • table 3
  • table 4
Is this relevant?
1997
1997
Within the framework of concurrent systems, several veriication approaches require as a preliminary step the complete derivation… (More)
Is this relevant?
1994
1994
To optimize performance in Q fault-tolerant distributed system, it is often necessary to enforce different failure semantics f o… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
1993
1993
Modem manufacturing systems require a very high degree of user confidence in their ability to survive various system failures in… (More)
  • table 1
  • figure 2
  • figure 3
  • table 2
  • figure 4
Is this relevant?
Highly Cited
1991
Highly Cited
1991
March 1, 1991 Many computer-supported applications are of long duration and consist of multiple steps that are executed over… (More)
  • figure 1
  • figure 2
Is this relevant?
1987
1987
A basic question in the theory of communicating processes is “When should two processes be considered equivalent?”. Attempts to… (More)
  • figure 2
  • figure 3
Is this relevant?