English
Related papers

Related papers: A Temporal Logic for Asynchronous Hyperproperties

200 papers

Since the topic emerged several years ago, work on regular model checking has mostly been devoted to the verification of state reachability and safety properties. Though it was known that linear temporal properties could also be checked…

Logic in Computer Science · Computer Science 2009-01-27 Ahmed Bouajjani , Axel Legay , Pierre Wolper

Temporal logic specifications play an important role in a wide range of software analysis tasks, such as model checking, automated synthesis, program comprehension, and runtime monitoring. Given a set of positive and negative examples,…

Software Engineering · Computer Science 2025-01-03 Changjian Zhang , Parv Kapoor , Ian Dardik , Leyi Cui , Romulo Meira-Goes , David Garlan , Eunsuk Kang

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,…

Logic in Computer Science · Computer Science 2017-07-19 David Basin , Felix Klaedtke , Eugen Zălinescu

Many modern autonomous systems, particularly multi-agent systems, are time-critical and need to be robust against timing uncertainties. Previous works have studied left and right time robustness of signal temporal logic specifications by…

Systems and Control · Electrical Eng. & Systems 2023-06-09 Alëna Rodionova , Lars Lindemann , Manfred Morari , George J. Pappas

Timed automata (TAs) are a common formalism for modeling timed systems. Bounded model checking (BMC) is a verification method that searches for runs violating a property using a SAT or SMT solver. MITL is a real-time extension of the linear…

Logic in Computer Science · Computer Science 2013-04-29 Roland Kindermann , Tommi Junttila , Ilkka Niemelä

We settle the complexity of satisfiability, finite-state satisfiability, and model-checking for several fragments of second-order HyperLTL, which extends HyperLTL with quantification over sets of traces: they are all in the analytical…

Logic in Computer Science · Computer Science 2025-09-17 Gaëtan Regaud , Martin Zimmermann

Networks are difficult to configure correctly, and tricky to debug. These problems are accentuated by temporal and stateful behavior. Static verification, while useful, is ineffectual for detecting behavioral deviations induced by hardware…

Networking and Internet Architecture · Computer Science 2016-07-18 Tim Nelson , Nicholas DeMarinis , Timothy Adam Hoff , Rodrigo Fonseca , Shriram Krishnamurthi

In this paper, we study the model-checking and parameter synthesis problems of the logic TCTL over discrete-timed automata where parameters are allowed both in the model (timed automaton) and in the property (temporal formula). Our results…

Logic in Computer Science · Computer Science 2017-01-11 Veronique Bruyere , Jean-Francois Raskin

The heterogeneity of tools that support temporal logic formulae poses several challenges in terms of interoperability. In particular, a standard syntax for temporal logic on finite traces, despite similar to the one for infinite traces, is…

Logic in Computer Science · Computer Science 2021-06-09 Marco Favorito

Trajectory planning is a critical process that enables autonomous systems to safely navigate complex environments. Signal temporal logic (STL) specifications are an effective way to encode complex temporally extended objectives for…

Systems and Control · Electrical Eng. & Systems 2024-03-20 Parv Kapoor , Eunsuk Kang , Romulo Meira-Goes

In runtime verification, pattern matching, which searches for occurrences of a specific pattern within a word, provides more information than a simple violation detection of the monitored property, by locating concrete evidence of the…

Formal Languages and Automata Theory · Computer Science 2025-07-17 Masaki Waga , Étienne André

Model checking linear-time properties expressed in first-order logic has non-elementary complexity, and thus various restricted logical languages are employed. In this paper we consider two such restricted specification logics, linear…

Logic in Computer Science · Computer Science 2019-03-14 Michael Benedikt , Rastislav Lenhardt , James Worrell

The Internet-of-Things, complex sensor networks, multi-agent cyber-physical systems are all examples of spatially distributed systems that continuously evolve in time. Such systems generate huge amounts of spatio-temporal data, and system…

Machine Learning · Computer Science 2021-06-17 Sara Mohammadinejad , Jyotirmy V. Deshmukh , Laura Nenzi

We consider an extension of linear-time temporal logic (LTL) with both local and remote data constraints interpreted over a concrete domain. This extension is a natural extension of constraint LTL and the Temporal Logic of Repeating Values,…

Logic in Computer Science · Computer Science 2022-06-06 Ashwin Bhaskar

One of the advantages of adopting a Model Based Development (MBD) process is that it enables testing and verification at early stages of development. However, it is often desirable to not only verify/falsify certain formal system…

Logic in Computer Science · Computer Science 2017-02-07 Bardh Hoxha , Adel Dokhanchi , Georgios Fainekos

Temporal logics (TLs) have been widely used to formalize interpretable tasks for cyber-physical systems. Time Window Temporal Logic (TWTL) has been recently proposed as a specification language for dynamical systems. In particular, it can…

Formal Languages and Automata Theory · Computer Science 2023-04-14 Ahmad Ahmad , Cristian-Ioan Vasile , Roberto Tron , Calin Belta

In this paper, we investigate the problem of synthesizing strategies for linear temporal logic (LTL) specifications that are interpreted over finite traces -- a problem that is central to the automated construction of controllers, robot…

Logic in Computer Science · Computer Science 2018-09-03 Alberto Camacho , Meghyn Bienvenu , Sheila A. McIlraith

Temporal Equilibrium Logic (TEL) is a promising framework that extends the knowledge representation and reasoning capabilities of Answer Set Programming with temporal operators in the style of LTL. To our knowledge it is the first…

Logic in Computer Science · Computer Science 2015-03-03 Laura Bozzelli , David Pearce

The expressive power of interval temporal logics (ITLs) makes them one of the most natural choices in a number of application domains, ranging from the specification and verification of complex reactive systems to automated planning.…

Logic in Computer Science · Computer Science 2023-06-22 Laura Bozzelli , Alberto Molinari , Angelo Montanari , Adriano Peron , Pietro Sala

We consider here Linear Temporal Logic (LTL) formulas interpreted over \emph{finite} traces. We denote this logic by LTLf. The existing approach for LTLf satisfiability checking is based on a reduction to standard LTL satisfiability…

Logic in Computer Science · Computer Science 2014-03-10 Jianwen Li , Lijun Zhang , Geguang Pu , Moshe Y. Vardi , Jifeng He