9,443 research outputs found
Runtime Monitoring of Metric First-order Temporal Properties
We introduce a novel approach to the runtime monitoring of complex
system properties. In particular, we present an online algorithm for
a safety fragment of metric first-order temporal logic that
is considerably more expressive than the logics supported by prior
monitoring methods. Our approach, based on automatic structures,
allows the unrestricted use of negation, universal and existential
quantification over infinite domains, and the arbitrary nesting of
both past and bounded future operators. Moreover, we show how
to optimize our approach for the common case where
structures consist of only finite relations, over possibly infinite
domains. Under an additional restriction, we prove that the space
consumed by our monitor is polynomially bounded by the cardinality
of the data appearing in the processed prefix of the temporal
structure being monitored
On-Line Monitoring for Temporal Logic Robustness
In this paper, we provide a Dynamic Programming algorithm for on-line
monitoring of the state robustness of Metric Temporal Logic specifications with
past time operators. We compute the robustness of MTL with unbounded past and
bounded future temporal operators MTL over sampled traces of Cyber-Physical
Systems. We implemented our tool in Matlab as a Simulink block that can be used
in any Simulink model. We experimentally demonstrate that the overhead of the
MTL robustness monitoring is acceptable for certain classes of practical
specifications
Early Verification of Legal Compliance via Bounded Satisfiability Checking
Legal properties involve reasoning about data values and time. Metric
first-order temporal logic (MFOTL) provides a rich formalism for specifying
legal properties. While MFOTL has been successfully used for verifying legal
properties over operational systems via runtime monitoring, no solution exists
for MFOTL-based verification in early-stage system development captured by
requirements. Given a legal property and system requirements, both formalized
in MFOTL, the compliance of the property can be verified on the requirements
via satisfiability checking. In this paper, we propose a practical, sound, and
complete (within a given bound) satisfiability checking approach for MFOTL. The
approach, based on satisfiability modulo theories (SMT), employs a
counterexample-guided strategy to incrementally search for a satisfying
solution. We implemented our approach using the Z3 SMT solver and evaluated it
on five case studies spanning the healthcare, business administration, banking
and aviation domains. Our results indicate that our approach can efficiently
determine whether legal properties of interest are met, or generate
counterexamples that lead to compliance violations
Runtime Verification of Temporal Properties over Out-of-order Data Streams
We present a monitoring approach for verifying systems at runtime. Our
approach targets systems whose components communicate with the monitors over
unreliable channels, where messages can be delayed or lost. In contrast to
prior works, whose property specification languages are limited to
propositional temporal logics, our approach handles an extension of the
real-time logic MTL with freeze quantifiers for reasoning about data values. We
present its underlying theory based on a new three-valued semantics that is
well suited to soundly and completely reason online about event streams in the
presence of message delay or loss. We also evaluate our approach
experimentally. Our prototype implementation processes hundreds of events per
second in settings where messages are received out of order.Comment: long version of the CAV 2017 pape
An Efficient Algorithm for Monitoring Practical TPTL Specifications
We provide a dynamic programming algorithm for the monitoring of a fragment
of Timed Propositional Temporal Logic (TPTL) specifications. This fragment of
TPTL, which is more expressive than Metric Temporal Logic, is characterized by
independent time variables which enable the elicitation of complex real-time
requirements. For this fragment, we provide an efficient polynomial time
algorithm for off-line monitoring of finite traces. Finally, we provide
experimental results on a prototype implementation of our tool in order to
demonstrate the feasibility of using our tool in practical applications
- …