English
Related papers

Related papers: Tableaux like model checking on-the-fly for ATL+

200 papers

A large number of different model checking approaches has been proposed during the last decade. The different approaches are applicable to different model types including untimed, timed, probabilistic and stochastic models. This paper…

Logic in Computer Science · Computer Science 2007-05-23 Peter Buchholz , Peter Kemper

Probabilistic model checking is a technique for formal automated reasoning about software or hardware systems that operate in the context of uncertainty or stochasticity. It builds upon ideas and techniques from a diverse range of fields,…

Logic in Computer Science · Computer Science 2023-08-08 David Parker

We present two novel symbolic algorithms for model checking the Alternating-time Temporal Logic ATL*, over both the infinite-trace and the finite-trace semantics. In particular, for infinite traces we design a novel symbolic reduction to…

Logic in Computer Science · Computer Science 2025-10-22 Sofia Garcia de Blas Garcia-Alcalde , Francesco Belardinelli

We describe a model-checking toolchain for the behavioral verification of AADL models that takes into account the realtime semantics of the language and that is compatible with the AADL Behavioral Annex. We give a high-level view of the…

Software Engineering · Computer Science 2015-03-03 B Berthomieu , J. -P Bodeveix , S Dal Zilio , M Filali , D Le Botlan , G Verdier , F Vernadat

We present CGAAL, our efficient on-the-fly model checker for alternating-time temporal logic (ATL) on concurrent game structures (CGS). We present how our tool encodes ATL as extended dependency graphs with negation edges and employs the…

We propose a local model-checking proof system for a fragment of CTL. The rules of the proof system are motivated by the well-known fixed-point characterisation of CTL based on unfolding of the temporal operators. To guarantee termination…

Logic in Computer Science · Computer Science 2023-09-12 Georg Friedrich Schuppe , Dilian Gurov

We study model checking algorithms for infinite families of finite-state labeled transition systems against temporal properties written in CTL*. Such families arise, for example, as models of highly configurable systems or software product…

Logic in Computer Science · Computer Science 2026-01-23 Roberto Pettinau , Christoph Matheja

The design and application of multi-agent systems (MAS) require reasoning about the effects of modifications on their underlying structure. In particular, such changes may impact the satisfaction of system specifications and the strategic…

Logic in Computer Science · Computer Science 2025-05-01 Rustam Galimullin , Maksim Gladyshev , Munyque Mittelmann , Nima Motamed

Hyperproperties are system properties that relate multiple computation paths in a system and are commonly used to, e.g., define information-flow policies. In this paper, we study a novel class of hyperproperties that allow reasoning about…

Logic in Computer Science · Computer Science 2024-02-14 Raven Beutner , Bernd Finkbeiner

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 are commonly used in computer security to define information-flow policies and other requirements that reason about the relationship between multiple computations. In this paper, we study a novel class of hyperproperties…

Logic in Computer Science · Computer Science 2022-06-01 Raven Beutner , Bernd Finkbeiner

We develop model checking algorithms for Temporal Stream Logic (TSL) and Hyper Temporal Stream Logic (HyperTSL) modulo theories. TSL extends Linear Temporal Logic (LTL) with memory cells, functions and predicates, making it a convenient and…

Logic in Computer Science · Computer Science 2023-03-28 Bernd Finkbeiner , Hadar Frenkel , Jana Hofmann , Janine Lohse

We propose a variant of Alternating-time Temporal Logic (ATL) grounded in the agents' operational know-how, as defined by their libraries of abstract plans. Inspired by ATLES, a variant itself of ATL, it is possible in our logic to…

Artificial Intelligence · Computer Science 2016-07-05 Nitin Yadav , Sebastian Sardina

In logics for the strategic reasoning the main challenge is represented by their verification in contexts of imperfect information and perfect recall. In this work, we show a technique to approximate the verification of Alternating-time…

Multiagent Systems · Computer Science 2023-06-19 Angelo Ferrando , Vadim Malvone

Alternating-time temporal logics (ATL/ATL*) represent a family of modal logics for reasoning about agents' strategic abilities in multiagent systems (MAS). The interpretations of ATL/ATL* over the semantic model Concurrent Game Structures…

Artificial Intelligence · Computer Science 2018-11-28 Yedi Zhang , Fu Song , Taolue Chen

ATL is a temporal logic geared towards the specification and verification of properties in multi-agents systems. It allows to reason on the existence of strategies for coalitions of agents in order to enforce a given property. In this…

Logic in Computer Science · Computer Science 2015-07-01 Francois Laroussinie , Nicolas Markey , Ghassan Oreiby

Standpoint linear temporal logic ($SLTL$) is a recently introduced extension of classical linear temporal logic ($LTL$) with standpoint modalities. Intuitively, these modalities allow to express that, from agent $a$'s standpoint, it is…

Logic in Computer Science · Computer Science 2025-02-28 Rajab Aghamov , Christel Baier , Toghrul Karimov , Rupak Majumdar , Joël Ouaknine , Jakob Piribauer , Timm Spork

Alternating-time temporal logic (ATL$^*$) is a well-established framework for formal reasoning about multi-agent systems. However, while ATL$^*$ can reason about the strategic ability of agents (e.g., some coalition $A$ can ensure that a…

Artificial Intelligence · Computer Science 2024-03-13 Raven Beutner , Bernd Finkbeiner

Most autonomous robotic agents use logic inference to keep themselves to safe and permitted behaviour. Given a set of rules, it is important that the robot is able to establish the consistency between its rules, its perception-based…

Robotics · Computer Science 2016-11-11 Hongyang Qu , Sandor M. Veres

In this paper we use attribute grammars as a formal approach for model checkers development. Our aim is to design an ATL (Alternating-Time Temporal Logic) model checker from a context-free grammar which generates the language of the ATL…

Logic in Computer Science · Computer Science 2019-02-06 Florin Stoica , Laura Florentina Stoica