Three-valued asynchronous distributed runtime verification
Torben Scheffel,Malte Schmitz +1 more
- 20 Nov 2014
- Vol. 12, pp 52-61
TL;DR: The aim of this new procedure is to increase the amount of monitorable properties compared to the properties monitorable with ptDTL, which has been implemented on LEGO Mindstorms NXT robots communicating via Bluetooth.
read more
Abstract: This paper studies runtime verification of distributed asynchronous systems and presents a moni- tor generation procedure for this purpose, which allows three-valued monitoring. The properties used in the monitors are specified in a logic that was newly created for this purpose and is called Distributed Temporal Logic (DTL). DTL combines the three-valued Linear Temporal Logic (LTL3) with the past-time Distributed Temporal Logic (ptDTL), which allows to mark subfor- mulas for remote evaluation. The monitor generation presented in this paper is based on an adopted version of the LTL3 monitor generation, which integrates the ptDTL monitor construction. The aim of this new pro- cedure is to increase the amount of monitorable prop- erties compared to the properties monitorable with ptDTL. Runtime verification using this new monitoring has been implemented on LEGO Mindstorms NXT robots communicating via Bluetooth.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Distributed runtime verification by past-CTL and the field calculus
TL;DR: In this article , the authors introduce the past-CTLTL logic, an extension of past-LTL able to express a variety of properties concerning the knowable past of an event, and formally define a procedure to derive monitors that can be distributed on each device and whose collective behaviour verifies the validity of the formula at runtime across space and time.
16
A Monitoring Tool for Linear-Time μHML
Luca Aceto,Antonis Achilleos,Duncan Paul Attard,Léo Exibard,Adrian Francalanza,Anna Ingólfsdóttir +5 more
- 01 Jan 2022
TL;DR: The implementation of a prototype tool that run-time checks specifications written in a maximally-expressive safety fragment of the linear-time modal μ -calculus called maxHML, which is used to generate executable monitors for Erlang, a general-purpose programming language.
10
Efficient Decentralized LTL Monitoring Framework Using Tableau Technique
TL;DR: In this article, the authors present a framework for decentralized monitoring of linear temporal logic (LTL) formulas, under the situation where processes are synchronous and the formula is represented as a tableau.
10
•Posted Content
Multilevel Modelling and Domain-Specific Languages.
TL;DR: This thesis presents a MLM and Multilevel MT approach which tackles open issues in the field and compares it with the state of the art through literature review and experiments, providing its formalisation and its implementation in the tool MultEcore, together with case studies.
9
Runtime Verification for Linear-Time Temporal Logic
Martin Leucker
- 28 Mar 2016
TL;DR: This paper recalls the idea of runtime verification, gives ideas about specification languages for runtime verification and develops a solid theory for linear-time temporal logic, which is explained based on this logic.
9
References
Time, clocks, and the ordering of events in a distributed system
TL;DR: In this article, the concept of one event happening before another in a distributed system is examined, and a distributed algorithm is given for synchronizing a system of logical clocks which can be used to totally order the events.
Time, clocks, and the ordering of events in a distributed system
TL;DR: In this paper, the concept of one event happening before another in a distributed system is examined, and a distributed algorithm is given for synchronizing a system of logical clocks which can be used to totally order the events.
The temporal logic of programs
Amir Pnueli
- 30 Sep 1977
TL;DR: A unified approach to program verification is suggested, which applies to both sequential and parallel programs, and the main proof method is that of temporal reasoning in which the time dependence of events is the basic concept.
5.8K
Distributed snapshots: determining global states of distributed systems
K. Mani Chandy,Leslie Lamport +1 more
TL;DR: An algorithm by which a process in a distributed system determines a global state of the system during a computation, which helps to solve an important class of problems: stable property detection.
An automata-theoretic approach to linear temporal logic
Moshe Y. Vardi
- 01 Apr 1996
TL;DR: The automata-theoretic approach to linear temporal logic as discussed by the authors uses the theory of automata as a unifying paradigm for program specification, verification, and synthesis Both programs and specifications are in essence descriptions of computations These computations can be viewed as words over some alphabet.