Name
Abstract | ||
|---|---|---|
Runtime Verification is a lightweight method for monitoring the formal specification of a system (usually in some form of temporal logics) at execution time. In a setting, where a set of distributed monitors have only a partial view of a large system and may be subject to different types of faults, the literature of runtime verification falls short in answering many fundamental questions. Examples include techniques to reason about the soundness and consistency of the collective set of verdicts computed by the set of distributed monitors. In this paper, we discuss open research problems on fault-tolerant distributed monitoring that stem from different design choices and implementation platforms. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1007/978-3-319-47169-3_27 | Lecture Notes in Computer Science |
Field | DocType | Volume |
Open research,Computer science,Intelligent verification,Formal specification,Runtime verification,Fault tolerance,Execution time,Soundness,Distributed computing | Conference | 9953 |
ISSN | Citations | PageRank |
0302-9743 | 3 | 0.39 |
References | Authors | |
10 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Borzoo Bonakdarpour | 1 | 490 | 45.02 |
| Pierre Fraigniaud | 2 | 2849 | 220.78 |
| Sergio Rajsbaum | 3 | 1367 | 115.89 |
| Corentin Travers | 4 | 371 | 26.30 |