English
Related papers

Related papers: Verifying Asynchronous Hyperproperties in Reactive…

200 papers

Bounded model checking (BMC) is an effective technique for hunting bugs by incrementally exploring the state space of a system. To reason about infinite traces through a finite structure and to ultimately obtain completeness, BMC…

Logic in Computer Science · Computer Science 2023-01-31 Tzu-Han Hsu , César Sánchez , Sarai Sheinvald , Borzoo Bonakdarpour

We investigate the task and motion planning problem for dynamical systems under signal temporal logic (STL) specifications. Existing works on STL control synthesis mainly focus on generating plans that satisfy properties over a single…

Systems and Control · Electrical Eng. & Systems 2025-09-04 Jianing Zhao , Bowen Ye , Xinyi Yu , Rupak Majumdar , Xiang Yin

We investigate the logical foundations of hyperproperties. Hyperproperties generalize trace properties, which are sets of traces, to sets of sets of traces. The most prominent application of hyperproperties is information flow security:…

Logic in Computer Science · Computer Science 2017-01-10 Bernd Finkbeiner , Martin Zimmermann

We consider quantitative extensions of the alternating-time temporal logics ATL/ATLs called quantitative alternating-time temporal logics (QATL/QATLs) in which the value of a counter can be compared to constants using equality, inequality…

Logic in Computer Science · Computer Science 2014-09-22 Steen Vester

Verification of temporal logic properties plays a crucial role in proving the desired behaviors of hybrid systems. In this paper, we propose an interval method for verifying the properties described by a bounded linear temporal logic. We…

Logic in Computer Science · Computer Science 2015-07-15 Daisuke Ishii , Naoki Yonezaki , Alexandre Goldsztejn

We studied the hyperlogic HyperQPTL, which combines the concepts of trace relations and $\omega$-regularity. We showed that HyperQPTL is very expressive, it can express properties like promptness, bounded waiting for a grant, epistemic…

Logic in Computer Science · Computer Science 2021-01-19 Bernd Finkbeiner , Christopher Hahn , Jana Hofmann , Leander Tentrup

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

The model-checking problem for hybrid systems is a well known challenge in the scientific community. Most of the existing approaches and tools are limited to safety properties only, or operates by transforming the hybrid system to be…

Logic in Computer Science · Computer Science 2013-08-27 Davide Bresolin

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

Many important system properties, particularly in security and privacy, cannot be verified statically. Therefore, runtime verification is an appealing alternative. Logics for hyperproperties, such as HyperLTL, support a rich set of such…

Logic in Computer Science · Computer Science 2019-10-07 Sandro Stucki , César Sánchez , Gerardo Schneider , Borzoo Bonakdarpour

This work proposes a novel approach for automatic verification and synthesis of infinite-state reactive programs with respect to ${CTL}^*$ specifications, based on translation to Existential Horn Clauses (EHCs). $CTL^*$ is a powerful…

Logic in Computer Science · Computer Science 2026-05-13 Mishel Carelli , Orna Grumberg

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

Runtime verification is checking whether a system execution satisfies or violates a given correctness property. A procedure that automatically, and typically on the fly, verifies conformance of the system's behavior to the specified…

Software Engineering · Computer Science 2013-03-06 Mikhail Chupilko , Alexander Kamkin

Runtime verification is the process of verifying critical behavioral properties in big complex systems, where formal verification is not possible due to state space explosion. There have been several attempts to design efficient algorithms…

Distributed, Parallel, and Cluster Computing · Computer Science 2020-04-07 M. Ali Dorosty , Fathiyeh Faghih , Ehsan Khamespanah

In this paper we introduce Behavioral QLTL, which is a ``behavioral'' variant of linear-time temporal logic on infinite traces with second-order quantifiers. Behavioral QLTL is characterized by the fact that the functions that assign the…

Logic in Computer Science · Computer Science 2021-02-23 Giuseppe De Giacomo , Giuseppe Perelli

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

Non-deterministic planning aims to find a policy that achieves a given objective in an environment where actions have uncertain effects, and the agent - potentially - only observes parts of the current state. Hyperproperties are properties…

Logic in Computer Science · Computer Science 2024-05-24 Raven Beutner , Bernd Finkbeiner

This paper presents an extension of the safety fragment of Hennessy-Milner Logic with recursion over sets of traces, in the spirit of Hyper-LTL. It then introduces a novel monitoring setup that employs circuit-like structures to combine…

Logic in Computer Science · Computer Science 2022-05-11 Luca Aceto , Antonios Achilleos , Elli Anastasiadi , Adrian Francalanza

Strategy logic (SL) is a powerful temporal logic that enables first-class reasoning over strategic behavior in multi-agent systems (MAS). In many MASs, the agents (and their strategies) cannot observe the global state of the system, leading…

Logic in Computer Science · Computer Science 2025-10-07 Raven Beutner , Bernd Finkbeiner

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
‹ Prev 1 3 4 5 6 7 10 Next ›