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

Lukasiewicz logic and Riesz spaces

We initiate a deep study of {\em Riesz MV-algebras} which are MV-algebras endowed with a scalar multiplication with scalars from $[0,1]$. Extending Mundici's equivalence between MV-algebras and $\ell$-groups, we prove that Riesz MV-algebras are categorically equivalent with unit intervals in Riesz spaces with strong unit. Moreover, the subclass of norm-complete Riesz MV-algebras is equivalent with the class of commutative unital C$^*$-algebras. The propositional calculus ${\mathbb R}{\cal L}$ that has Riesz MV-algebras as models is a conservative extension of \L ukasiewicz $\infty$-valued propositional calculus and it is complete with respect to evaluations in the standard model $[0,1]$. We prove a normal form theorem for this logic, extending McNaughton theorem for \L ukasiewicz logic. We define the notions of quasi-linear combination and quasi-linear span for formulas in ${\mathbb R}{\cal L}$ and we relate them with the analogue of de Finetti's coherence criterion for ${\mathbb R}{\cal L}$.Comment: To appear in Soft Computin

Quantified Propositional Gödel Logics

It is shown that Gqp↑, the quantified propositional Gödel logic based on the truth-value set V↑ = {1 - 1/n : n≥1}∪{1}, is decidable. This result is obtained by reduction to Büchi's theory S1S. An alternative proof based on elimination of quantifiers is also given, which yields both an axiomatization and a characterization of Gqp↑ as the intersection of all finite-valued quantified propositional Gödel logics