English
Related papers

Related papers: Checking Interval Properties of Computations

200 papers

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

Model checking has been successfully used in many computer science fields, including artificial intelligence, theoretical computer science, and databases. Most of the proposed solutions make use of classical, point-based temporal logics,…

Logic in Computer Science · Computer Science 2016-01-25 A. Molinari , A. Montanari , A. Peron

[...] The most famous model checking (MC) techniques were developed from the late 80s, bearing in mind the well-known "point-based" temporal logics LTL and CTL. However, while the expressiveness of such logics is beyond doubt, there are…

Logic in Computer Science · Computer Science 2019-02-12 Alberto Molinari

In the last years, model checking with interval temporal logics is emerging as a viable alternative to model checking with standard point-based temporal logics, such as LTL, CTL, CTL*, and the like. The behavior of the system is modeled by…

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

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

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

We study several extensions of linear-time and computation-tree temporal logics with quantifiers that allow for counting how often certain properties hold. For most of these extensions, the model-checking problem is undecidable, but we show…

Logic in Computer Science · Computer Science 2017-06-28 Normann Decker , Peter Habermehl , Martin Leucker , Arnaud Sangnier , Daniel Thoma

Quantitative properties of stochastic systems are usually specified in logics that allow one to compare the measure of executions satisfying certain temporal properties with thresholds. The model checking problem for stochastic systems with…

Logic in Computer Science · Computer Science 2010-05-11 Axel Legay , Benoit Delahaye

The Epistemic Halpern-Shoham logic (EHS) is a temporal-epistemic logic that combines the interval operators of the Halpern-Shoham logic with epistemic modalities. The semantics of EHS is based on interpreted systems whose labelling function…

Logic in Computer Science · Computer Science 2015-09-03 Alessio Lomuscio , Jakub Michaliszyn

Model checking and automated theorem proving are two pillars of formal methods. This paper investigates model checking from an automated theorem proving perspective, aiming at combining the expressiveness of automated theorem proving and…

Logic in Computer Science · Computer Science 2017-10-03 Ying Jiang , Jian Liu , Gilles Dowek , Kailiang Ji

Verification of temporal logic properties plays a crucial role in proving the desired behaviors of continuous systems. In this paper, we propose an interval method that verifies the properties described by a bounded signal temporal logic.…

Logic in Computer Science · Computer Science 2016-02-09 Daisuke Ishii , Naoki Yonezaki , Alexandre Goldsztejn

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

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

We study the LTL model-checking in possibilistic Kripke structure using possibility measure. First, the notion of possibilistic Kripke structure and the related possibility measure are introduced, then model-checking of reachability and…

Logic in Computer Science · Computer Science 2016-09-27 Yongming Li , Lijun Li

The problem of model-checking hybrid systems is a long-time challenge in the scientific community. Most of the existing approaches and tools are either limited on the properties that they can verify, or restricted to simplified classes of…

Logic in Computer Science · Computer Science 2013-07-18 Davide Bresolin

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

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

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

The molecular computing has been successfully employed to solve more and more complex computation problems. However, as an important complex problem, the model checking are still far from fully resolved under the circumstance of molecular…

Logic in Computer Science · Computer Science 2017-02-21 Weijun Zhu

In this paper, we investigate the model checking (MC) problem for Halpern and Shoham's interval temporal logic HS. In the last years, interval temporal logic MC has received an increasing attention as a viable alternative to the traditional…

Logic in Computer Science · Computer Science 2017-09-08 Laura Bozzelli , Alberto Molinari , Angelo Montanari , Adriano Peron
‹ Prev 1 2 3 10 Next ›