From Propositional to First-Order Monitoring

Bauer, Andreas; Küster, Jan-Christoph; Vegliach, Gil

doi:10.1007/978-3-642-40787-1_4

Cited by 57 publications

(42 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Ideally, for a monitoring procedure to be practical, we require that it be trace-length independent [5] in the sense that the total space requirement should not depend on the length of the input trace. With this objective in mind, the principal difficulty in monitoring MTL[U, S] is that it allows unbounded intervals and nesting of future and past operators, and hence the truth value of a formula at some point may depend on the truth values of its subformulas arbitrarily far in the future or past.…”

Section: Metric Temporal Logic With Both Forwards and Backwards Tempomentioning

confidence: 99%

Online Monitoring of Metric Temporal Logic

Ouaknine

Worrell

2014

Runtime Verification

View full text Add to dashboard Cite

Abstract. Current approaches to monitoring real-time properties suffer either from unbounded space requirements or lack of expressiveness. In this paper, we adapt a separation technique enabling us to rewrite arbitrary MTL formulas into LTL formulas over a set of atoms comprising bounded MTL formulas. As a result, we obtain the first trace-length independent online monitoring procedure for full MTL.

show abstract

Section: Metric Temporal Logic With Both Forwards and Backwards Tempomentioning

confidence: 99%

Online Monitoring of Metric Temporal Logic

Ouaknine

Worrell

2014

Runtime Verification

View full text Add to dashboard Cite

show abstract

“…Summary structures (future formulas) précis no online yes no reduce [4] yes offline no no Chomicki [8,9] no online yes no Krukow et al [10] Bauer et al [11] yes online yes no Basin et al [5,7] no online yes yes Basin et al [6] yes online yes yes Bauer et al [19] no online (automata)* (automata)* Table 1: Comparison of design choices in précis and prior work using first-order temporal logic for privacy compliance. *Automata-based approaches have no explicit notion of summary structures.…”

Section: Implementation and Evaluationmentioning

confidence: 99%

“…We do not insist on these restrictions. In further development, Bauer et al [19], propose an automata-based, incomplete monitoring algorithm for a fragment of FOTL called LTL FO . They consider non-safety policies (unbounded future operators), which we do not consider.…”

Section: Related Workmentioning

confidence: 99%

Temporal Mode-Checking for Runtime Monitoring of Privacy Policies

Chowdhury

Jia

Garg³

et al. 2014

Computer Aided Verification

View full text Add to dashboard Cite

Fragments of first-order temporal logic are useful for representing many practical privacy and security policies. Past work has proposed two strategies for checking event trace (audit log) compliance with policies: online monitoring and offline audit. Although online monitoring is space-and timeefficient, existing techniques insist that satisfying instances of all subformulas of the policy be amenable to caching, which limits expressiveness when some subformulas have infinite support. In contrast, offline audit is brute force and can handle more policies but is not as efficient. This paper proposes a new online monitoring algorithm that caches satisfying instances when it can, and falls back to the brute force search when it cannot. Our key technical insight is a new flowand time-sensitive static check of variable groundedness, called the temporal mode check, which determines subformulas for which such caching is feasible and those for which it is not and, hence, guides our algorithm. We prove the correctness of our algorithm and evaluate its performance over synthetic traces and realistic policies.

show abstract

“…As runtime verification is per definition concerned with the concrete behavior of the real system, it is not surprising that there have been attempts to lift the property specification languages in runtime verification from propositional temporal logics to first-order versions. For example, in [BKV13], the authors describe a runtime monitoring approach that is able to detect violation or compliance of monitored action sequences with respect to properties formulated in a first-order variant of LTL. The monitor construction algorithm uses an automaton type the authors call spawning automaton that extends is constructed similar to the generalized Büchi automaton (GBA) that is typically used as a monitor for LTL.…”

Section: Related Workmentioning

confidence: 99%

Simulation and Statistical Model Checking of Logic-Based Multi-Agent System Models

Kroiß

2014

Advances in Intelligent Systems and Computing

View full text Add to dashboard Cite

This thesis presents SALMA (Simulation and Analysis of Logic-Based MultiAgent Models), a new approach for simulation and statistical model checking of multi-agent system models.Statistical model checking is a relatively new branch of model-based approximative verification methods that help to overcome the well-known scalability problems of exact model checking. In contrast to existing solutions, SALMA specifies the mechanisms of the simulated system by means of logical axioms based upon the well-established situation calculus. Leveraging the resulting first-order logic structure of the system model, the simulation is coupled with a statistical model-checker that uses a first-order variant of time-bounded linear temporal logic (LTL) for describing properties. This is combined with a procedural and process-based language for describing agent behavior. Together, these parts create a very expressive framework for modeling and verification that allows direct fine-grained reasoning about the agents' interaction with each other and with their (physical) environment.SALMA extends the classical situation calculus and linear temporal logic (LTL) with means to address the specific requirements of multi-agent simulation models. In particular, cyber-physical domains are considered where the agents interact with their physical environment. Among other things, the thesis describes a generic situation calculus axiomatization that encompasses sensing and information transfer in multi agent systems, for instance sensor measurements or inter-agent messages. The proposed model explicitly accounts for real-time constraints and stochastic effects that are inevitable in cyber-physical systems.In order to make SALMA's statistical model checking facilities usable also for more complex problems, a mechanism for the efficient on-the-fly evaluation of first-order LTL properties was developed. In particular, the presented algorithm uses an interval-based representation of the formula evaluation state together with several other optimization techniques to avoid unnecessary computation.Altogether, the goal of this thesis was to create an approach for simulation and statistical model checking of multi-agent systems that builds upon well-proven logical and statistical foundations, but at the same time takes a pragmatic software engineering perspective that considers factors like usability, scalability, and extensibility. In fact, experience gained during several small to mid-sized experiments that are presented in this thesis suggest that the SALMA approach seems to be able to live up to these expectations.

show abstract

From Propositional to First-Order Monitoring

Cited by 57 publications

References 23 publications

Online Monitoring of Metric Temporal Logic

Online Monitoring of Metric Temporal Logic

Temporal Mode-Checking for Runtime Monitoring of Privacy Policies

Simulation and Statistical Model Checking of Logic-Based Multi-Agent System Models

Contact Info

Product

Resources

About