English
Related papers

Related papers: Monitoring Bounded LTL Properties Using Interval A…

200 papers

Signal temporal logic (STL) was introduced for monitoring temporal properties of continuous-time signals for continuous and hybrid systems. Differential dynamic logic (dL) was introduced to reason about the end states of a hybrid program.…

Logic in Computer Science · Computer Science 2021-03-17 Hammad Ahmad , Jean-Baptiste Jeannin

In this paper we present an algorithm for performing runtime verification of a bounded temporal logic over timed runs. The algorithm consists of three elements. First, the bounded temporal formula to be verified is translated into a monadic…

Logic in Computer Science · Computer Science 2007-06-01 Henrik Reif Andersen , Kaare J. Kristoffersen

Hyperproperties allow one to specify properties of systems that inherently involve not single executions of the system, but several of them at once: observational determinism and non-inference are two examples of such properties used to…

Logic in Computer Science · Computer Science 2025-12-02 Samuel Graepler , Benjamin Monmege , Jean-Marc Talbot

This paper describes a technique for inferring temporal-logic properties for sets of finite data streams. Such data streams arise in many domains, including server logs, program testing, and financial and marketing data; temporal-logic…

Logic in Computer Science · Computer Science 2020-06-09 Samuel Huang , Rance Cleaveland

Signal Temporal Logic (STL) is a convenient formalism to express bounded horizon properties of autonomous critical systems. STL extends LTL to real-valued signals and associates a non-singleton bound interval to each temporal operators. In…

Logic in Computer Science · Computer Science 2023-11-17 Céline Bellanger , Pierre-Loïc Garoche , Matthieu Martel , Célia Picard

Model checking allows one to automatically verify a specification of the expected properties of a system against a formal model of its behaviour (generally, a Kripke structure). Point-based temporal logics, such as LTL, CTL, and CTL*, that…

Logic in Computer Science · Computer Science 2019-02-07 Alberto Molinari , Angelo Montanari , Adriano Peron

This paper presents a transformational approach for model checking two important classes of metric temporal logic (MTL) properties, namely, bounded response and minimum separation, for nonhierarchical object-oriented Real-Time Maude…

Logic in Computer Science · Computer Science 2010-09-23 Daniela Lepri , Peter Csaba Ölveczky , Erika Ábrahám

We present a hierarchical framework for analysing propositional linear-time temporal logic (PTL) to obtain standard results such as a small model property, decision procedures and axiomatic completeness. Both finite time and infinite time…

Logic in Computer Science · Computer Science 2007-05-23 Ben Moszkowski

We consider temporal logic verification of (possibly nonlinear) dynamical systems evolving over continuous state spaces. Our approach combines automata-based verification and the use of so-called barrier certificates. Automata-based…

Formal Languages and Automata Theory · Computer Science 2014-03-17 Tichakorn Wongpiromsarn , Ufuk Topcu , Andrew Lamperski

This paper proposes a novel distributed interval observer design for linear time-invariant (LTI) discrete-time systems subject to bounded disturbances. In the proposed observer algorithm, each agent in a networked group exchanges…

Systems and Control · Electrical Eng. & Systems 2022-09-07 Mohammad Khajenejad , Scott Brown , Sonia Martinez

This paper introduces operators, semantics, characterizations, and solution-independent conditions to guarantee temporal logic specifications for hybrid dynamical systems. Hybrid dynamical systems are given in terms of differential…

Systems and Control · Electrical Eng. & Systems 2020-06-17 Hyejin Han , Ricardo G. Sanfelice

Runtime verification of temporal properties is essential for ensuring the correctness and reliability of real-time systems, particularly in cyber-physical systems. A significant challenge in this domain is the effective prediction of…

Formal Languages and Automata Theory · Computer Science 2025-07-30 Alessandro Cimatti , Thomas M. Grosen , Kim G. Larsen , Stefano Tonetta , Martin Zimmermann

Signal Temporal Logic monitoring over numerical simulation traces has emerged as an effective approach to approximate verification of continuous and hybrid systems. In this report we explore an exact verification procedure for STL…

Logic in Computer Science · Computer Science 2020-08-18 Thomas Wright , Ian Stark

Metric Temporal Logic (MTL) is a popular formalism to specify temporal patterns with timing constraints over the behavior of cyber-physical systems with application areas ranging in property-based testing, robotics, optimization, and…

Logic in Computer Science · Computer Science 2026-03-11 Dogan Ulus

Verification of large and complicated concurrent programs is an important issue in the software world. Stateless model checking is an appropriate method for systematically and automatically testing of large programs, which has proved its…

Programming Languages · Computer Science 2016-03-14 Elaheh Ghassabani , Mohammad Abdollahi Azgomi

Temporal logic inference is the process of extracting formal descriptions of system behaviors from data in the form of temporal logic formulas. The existing temporal logic inference methods mostly neglect uncertainties in the data, which…

Artificial Intelligence · Computer Science 2021-06-01 Nasim Baharisangari , Jean-Raphaël Gaglione , Daniel Neider , Ufuk Topcu , Zhe Xu

In formal verification, runtime monitoring consists of observing the execution of a system in order to decide as quickly as possible whether or not it satisfies a given property. We consider monitoring in a distributed setting, for…

Software Engineering · Computer Science 2024-10-02 Léo Henry , Thierry Jéron , Nicolas Markey , Victor Roussanaly

A new logic for verification of security policies is proposed. The logic, HyperLTL, extends linear-time temporal logic (LTL) with connectives for explicit and simultaneous quantification over multiple execution paths, thereby enabling…

Logic in Computer Science · Computer Science 2013-07-10 Masoud Koleini , Michael R. Clarkson , Kristopher K. Micinski

Not all properties are monitorable. This is a well-known fact, and it means there exist properties that cannot be fully verified at runtime. However, given a non-monitorable property, a monitor can still be synthesised, but it could end up…

Logic in Computer Science · Computer Science 2022-11-22 Luca Ciccone , Francesco Dagnino , Angelo Ferrando

Max-Plus Linear (MPL) systems are an algebraic formalism with practical applications in transportation networks, manufacturing and biological systems. In this paper, we investigate the problem of automatically analyzing the properties of…

Formal Languages and Automata Theory · Computer Science 2023-08-22 Muhammad Syifa'ul Mufid , Andrea Micheli , Alessandro Abate , Alessandro Cimatti