English
Related papers

Related papers: Multi-Valued Verification of Strategic Ability

200 papers

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

Linear Temporal Logic (LTL) is a widely used specification framework for linear time properties of systems. The standard approach for verifying such properties is by transforming LTL formulae to suitable $\omega$-automata and then applying…

Formal Languages and Automata Theory · Computer Science 2017-10-19 Martin Sulzmann , Peter Thiemann

In this paper, we study model-checking of linear-time properties in multi-valued systems. Safety property, invariant property, liveness property, persistence and dual-persistence properties in multi-valued logic systems are introduced. Some…

Logic in Computer Science · Computer Science 2016-09-27 Yongming Li , Manfred Droste , Lihui Lei

We study multi-task reinforcement learning (RL), a setting in which an agent learns a single, universal policy capable of generalising to arbitrary, possibly unseen tasks. We consider tasks specified as linear temporal logic (LTL) formulae,…

Artificial Intelligence · Computer Science 2026-02-09 Alessandro Abate , Giuseppe De Giacomo , Mathias Jackermeier , Jan Kretínský , Maximilian Prokop , Christoph Weinhuber

Synthesis of models and strategies is a very important problem in software engineering. The main element here is checking the satisfiability of formulae expressing the specification of a system to be implemented. This paper puts forward a…

Logic in Computer Science · Computer Science 2020-02-11 Magdalena Kacprzak , Artur Niewiadomski , Wojciech Penczek

Model checking strategic abilities was successfully developed and applied since the early 2000s to ensure properties in Multi-Agent System. In this paper, we introduce the notion of capacities giving different abilities to an agent. This…

Multiagent Systems · Computer Science 2023-08-23 Gabriel Ballot , Vadim Malvone , Jean Leneutre , Youssef Laarouchi

This article is about temporal multi-agent logics. Several of these formalisms have been already presented (ATL-ATL*, ATLsc, SL). They enable to express the capacities of agents in a system to ensure the satisfaction of temporal properties.…

Logic in Computer Science · Computer Science 2013-03-05 Christophe Chareton , Julien Brunel , David Chemouil

Alternating-time temporal logic (ATL) and its extensions, including the alternating-time $\mu$-calculus (AMC), serve the specification of the strategic abilities of coalitions of agents in concurrent game structures. The key ingredient of…

Logic in Computer Science · Computer Science 2023-05-31 Merlin Humml , Lutz Schröder , Dirk Pattinson

Verification of multi-agents systems (MAS) has been recently studied taking into account the need of expressing resource bounds. Several logics for specifying properties of MAS have been presented in quite a variety of scenarios with…

Logic in Computer Science · Computer Science 2013-07-18 Dario Della Monica , Margherita Napoli , Mimmo Parente

We address the problem of teaching a deep reinforcement learning (RL) agent to follow instructions in multi-task environments. Instructions are expressed in a well-known formal language -- linear temporal logic (LTL) -- and can specify a…

Artificial Intelligence · Computer Science 2021-07-07 Pashootan Vaezipoor , Andrew Li , Rodrigo Toro Icarte , Sheila McIlraith

Linear temporal logic (LTL) is a compelling framework for specifying complex, structured tasks for reinforcement learning (RL) agents. Recent work has shown that interpreting LTL instructions as finite automata, which can be seen as…

Artificial Intelligence · Computer Science 2025-12-03 Mattia Giuri , Mathias Jackermeier , Alessandro Abate

We propose a validity preserving translation from a subset of epistemic Alternating-time Temporal Logic (ATL) to epistemic Computation Tree Logic (CTL). The considered subset of epistemic ATL is known to have the finite model property and…

Logic in Computer Science · Computer Science 2013-03-05 Dimitar P. Guelev

This paper presents a secure-by-construction planning and control framework for multi-agent systems subject to linear temporal logic (LTL) specifications. The framework protects sensitive information from a passive intruder with partial…

Systems and Control · Electrical Eng. & Systems 2026-05-14 Georgios Mitsos , Dimos V. Dimarogonas , Siyuan Liu

We propose extending Alternating-time Temporal Logic (ATL) by an operator <i refines-to G> F to express that agent i can distribute its powers to a set of sub-agents G in a way which satisfies ATL condition f on the strategic ability of the…

Logic in Computer Science · Computer Science 2014-04-04 Dimitar P. Guelev

Model-checking the alternating-time temporal logics ATL and ATL* with incomplete information is undecidable for perfect recall semantics. However, when restricting to memoryless strategies the model-checking problem becomes decidable. In…

Computer Science and Game Theory · Computer Science 2013-07-18 Steen Vester

Manufacturing industries are facing increasing product variability due to the growing demand for personalized products. Under these conditions, ensuring safety becomes challenging as frequent reconfigurations can lead to unintended…

Multiagent Systems · Computer Science 2026-04-21 Jonghan Lim , Mostafa Tavakkoli Anbarani , Rômulo Meira-Góes , Ilya Kovalenko

In open systems verification, to formally check for reliability, one needs an appropriate formalism to model the interaction between agents and express the correctness of the system no matter how the environment behaves. An important…

Logic in Computer Science · Computer Science 2014-02-13 Fabio Mogavero , Aniello Murano , Giuseppe Perelli , Moshe Y. Vardi

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

Temporal logics are extensively used for the specification of on-going behaviours of reactive systems. Two significant developments in this area are the extension of traditional temporal logics with modalities that enable the specification…

Logic in Computer Science · Computer Science 2019-05-29 Patricia Bouyer , Orna Kupferman , Nicolas Markey , Bastien Maubert , Aniello Murano , Giuseppe Perelli

Within Model-Driven Software Engineering, Domain-Specific Modelling has proven to be a powerful technique to specify systems and systems' behaviour in a formal, yet understandable way. Runtime verification (RV) has been successfully used to…

Software Engineering · Computer Science 2020-05-26 Fernando Macías , Adrian Rutle , Volker Stolz , Torben Scheffel , Malte Schmitz