English
Related papers

Related papers: Model-Checking of Linear-Time Properties Based on …

200 papers

Propositional Projection Temporal Logic (PPTL) is a useful formalism for reasoning about period of time in hardware and software systems and can handle both sequential and parallel compositions. In this paper, based on discrete time Markov…

Logic in Computer Science · Computer Science 2010-11-08 Xiaoxiao Yang

Hyperproperties extend trace properties to express properties of sets of traces, and they are increasingly popular in specifying various security and performance-related properties in domains such as cyber-physical systems, smart grids, and…

Logic in Computer Science · Computer Science 2023-08-11 Ernest Bonnah , Luan Viet Nguyen , Khaza Anuarul Hoque

Hyperproperties generalize trace properties by expressing relations between multiple computations. Hyperpropertes include policies from information-flow security, like observational determinism or non-interference, and many other system…

Logic in Computer Science · Computer Science 2021-07-27 Bernd Finkbeiner

We develop a timeout based extension of propositional linear temporal logic (which we call TLTL) to specify timing properties of timeout based models of real time systems. TLTL formulas explicitly refer to a running global clock together…

Logic in Computer Science · Computer Science 2010-12-20 Janardan Misra , Suman Roy

System development is not a linear, one-shot process. It proceeds through refinements and revisions. To support assurance that the system satisfies its requirements, it is desirable that continuous verification can be performed after each…

Logic in Computer Science · Computer Science 2018-11-28 Claudio Menghi , Alessandro Maria Rizzi , Anna Bernasconi

We define a formal framework for reasoning about linear-time properties of quantum systems in which quantum automata are employed in the modeling of systems and certain closed subspaces of state (Hilbert) spaces are used as the atomic…

Quantum Physics · Physics 2011-01-04 Mingsheng Ying , Yangjia Li , Nengkun Yu , Yuan Feng

We propose a verified approach to the formal verification of timed properties using model-checking techniques. We focus on properties expressed using real-time specification patterns, which can be viewed as a subset of timed temporal logics…

Logic in Computer Science · Computer Science 2013-02-01 Nouha Abid , Silvano Dal Zilio , Didier Le Botlan

This paper presents a methodology for temporal logic verification of discrete-time stochastic systems. Our goal is to find a lower bound on the probability that a complex temporal property is satisfied by finite traces of the system.…

Systems and Control · Computer Science 2019-11-22 Pushpak Jagtap , Sadegh Soudjani , Majid Zamani

We study the repair problem for hyperproperties specified in the temporal logic HyperLTL. Hyperproperties are system properties that relate multiple computation traces. This class of properties includes information flow policies like…

Logic in Computer Science · Computer Science 2021-01-22 Borzoo Bonakdarpour , Bernd Finkbeiner

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

The paper presents a methodology for temporal logic verification of continuous-time switched stochastic systems. Our goal is to find the lower bound on the probability that a complex temporal property is satisfied over a finite time…

Logic in Computer Science · Computer Science 2021-09-28 Mahathi Anand , Pushpak Jagtap , Majid Zamani

Temporal hyperproperties are system properties that relate multiple execution traces. For (finite-state) hardware, temporal hyperproperties are supported by model checking algorithms, and tools for general temporal logics like HyperLTL…

Logic in Computer Science · Computer Science 2022-08-26 Raven Beutner , Bernd Finkbeiner

Stochastic models such as Continuous-Time Markov Chains (CTMC) and Stochastic Hybrid Automata (SHA) are powerful formalisms to model and to reason about the dynamics of biological systems, due to their ability to capture the stochasticity…

Logic in Computer Science · Computer Science 2013-09-05 Ezio Bartocci , Luca Bortolussi , Laura Nenzi , Guido Sanguinetti

Spatial-temporal linear model and the corresponding likelihood-based statistical inference are important tools for the analysis of spatial-temporal lattice data. In this paper, we study the asymptotic properties of maximum likelihood…

Statistics Theory · Mathematics 2012-07-27 Xiang Zhang , Yanbing Zheng

We consider systems composed of an unbounded number of uniformly designed linear hybrid automata, whose dynamic behavior is determined by their relation to neighboring systems. We present a class of such systems and a class of safety…

Logic in Computer Science · Computer Science 2016-01-08 Werner Damm , Matthias Horbach , Viorica Sofronie-Stokkermans

Linear Temporal Logic (LTL) is the de-facto standard temporal logic for system specification, whose foundational properties have been studied for over five decades. Safety and cosafety properties define notable fragments of LTL, where a…

Logic in Computer Science · Computer Science 2025-03-14 Alessandro Artale , Luca Geatti , Nicola Gigante , Andrea Mazzullo , Angelo Montanari

Critical observability is a property of cyber-physical systems to detect whether the current state belongs to a set of critical states. In safety-critical applications, critical states model operations that may be unsafe or of a particular…

Systems and Control · Computer Science 2019-04-18 Tomáš Masopust

Hyperproperties are properties that describe the correctness of a system as a relation between multiple executions. Hyperproperties generalize trace properties and include information-flow security requirements, like noninterference, as…

Logic in Computer Science · Computer Science 2020-10-14 Rayna Dimitrova , Bernd Finkbeiner , Hazem Torfah

Runtime verification enables checking temporal logic specifications over individual execution traces and offers a scalable alternative to exhaustive formal verification. In practice, systems must satisfy dozens to hundreds of temporal…

Logic in Computer Science · Computer Science 2026-05-14 Arınç Demir , Dogan Ulus

Model checking for Halpern and Shoham's interval temporal logic HS has been recently investigated in a systematic way, and it is known to be decidable under three distinct semantics. Here, we focus on the trace-based semantics, where the…

Logic in Computer Science · Computer Science 2022-09-22 Laura Bozzelli , Adriano Peron