Fault tolerance in distributed computing is a wide area with a significant body of literature
that is vastly diverse in methodology and terminology. This paper aims at structuring the …

This chapter surveys runtime verification research related to distributed systems. We report
solutions that study how to monitor system with some distributed characteristic, solutions that …

In this paper, we propose an effective method to recognize human actions from 3D positions
of body joints. With the release of RGBD sensors and associated SDK, human body joints …

The paper shows that characterizing the causal relationship between significant events is an
important but non-trivial aspect for understanding the behavior of distributed programs. An …

Distributed Algorithms for Message-Passing Systems Page 1 Michel Raynal Distributed Algorithms
for Message-Passing Systems Page 2 Distributed Algorithms for Message-Passing Systems Page …

Many important problems in distributed computing admit solutions that contain a phase
where some global property needs to be detected. This subproblem can be seen as an …

Runtime verification is an area of formal methods that studies the dynamic analysis of
execution traces against formal specifications. Typically, the two main activities in runtime …

This paper discusses detection of global predicates in a distributed program. Earlier
algorithms for detection of global predicates proposed by Chandy and Lamport (1985) work …

We show that the problem of predicate detection in distributed systems is NP-complete. In
the past, efficient algorithms have been developed for special classes of predicates such as …

Very early runtime verification systems focused on monitoring what we can refer to as
propositional events: just names of events. For this, finite state machines, standard regular …