English
Related papers

Related papers: Changing Observations in Epistemic Temporal Logic

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

We develop a modeling technique based on interpreted systems in order to verify temporal-epistemic properties over access control policies. This approach enables us to detect information flow vulnerabilities in dynamic policies by verifying…

Logic in Computer Science · Computer Science 2014-01-21 Masoud Koleini , Eike Ritter , Mark Ryan

We present Dynamic Epistemic Temporal Logic, a framework for reasoning about operations on multi-agent Kripke models that contain a designated temporal relation. These operations are natural extensions of the well-known "action models" from…

Logic in Computer Science · Computer Science 2014-11-25 Bryan Renne , Joshua Sack , Audrey Yap

The paper presents an extension of temporal epistemic logic with operators that quantify over strategies. The language also provides a natural way to represent what agents would know were they to be aware of the strategies being used by…

Logic in Computer Science · Computer Science 2014-04-04 Xiaowei Huang , Ron van der Meyden

We present a variant of ATL with distributed knowledge operators based on a synchronous and perfect recall semantics. The coalition modalities in this logic are based on partial observation of the full history, and incorporate a form of…

Logic in Computer Science · Computer Science 2010-08-11 Cătălin Dima , Constantin Enea , Dimitar Guelev

Quantified CTL (QCTL) is a well-studied temporal logic that extends CTL with quantification over atomic propositions. It has recently come to the fore as a powerful intermediary framework to study logics for strategic reasoning. We extend…

Logic in Computer Science · Computer Science 2018-09-05 Raphaël Berthon , Bastien Maubert , Aniello Murano

This paper presents an extension of temporal epistemic logic with operators that quantify over agent strategies. Unlike previous work on alternating temporal epistemic logic, the semantics works with systems whose states explicitly encode…

Logic in Computer Science · Computer Science 2018-07-13 Xiaowei Huang , Ron van der Meyden

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

Alternating-time temporal logic with strategy contexts (ATLsc) is a powerful formalism for expressing properties of multi-agent systems: it extends CTL with strategy quantifiers, offering a convenient way of expressing both collaboration…

Logic in Computer Science · Computer Science 2015-09-25 François Laroussinie , Nicolas Markey , Arnaud Sangnier

Alternating-time Temporal Logic (ATL*) is a central logic for multiagent systems. Its extension to the imperfect information setting (ATL*i ) is well known to have an undecidable model-checking problem when agents have perfect recall.…

Logic in Computer Science · Computer Science 2018-09-05 Raphaël Berthon , Bastien Maubert , Aniello Murano

Temporal logic is a very powerful formalism deeply investigated and used in formal system design and verification. Its application usually reduces to solving specific decision problems such as model checking and satisfiability. In these…

Logic in Computer Science · Computer Science 2016-09-15 Gaëlle Fontaine , Fabio Mogavero , Aniello Murano , Giuseppe Perelli , Loredana Sorrentino

In the literature, two powerful temporal logic formalisms have been proposed for expressing information flow security requirements, that in general, go beyond regular properties. One is classic, based on the knowledge modalities of…

Logic in Computer Science · Computer Science 2014-09-10 Laura Bozzelli , Bastien Maubert , Sophie Pinchinat

In this paper, we investigate the probabilistic variants of the strategy logics ATL and ATL* under imperfect information. Specifically, we present novel decidability and complexity results when the model transitions are stochastic and…

Multiagent Systems · Computer Science 2023-10-27 Francesco Belardinelli , Wojciech Jamroga , Munyque Mittelmann , Aniello Murano

In this paper we introduce Epistemic Strategy Logic (ESL), an extension of Strategy Logic with modal operators for individual knowledge. This enhanced framework allows us to represent explicitly and to reason about the knowledge agents have…

Logic in Computer Science · Computer Science 2014-04-04 Francesco Belardinelli

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

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

In this paper, we present a complete mental temporal logic, called BPICTL, which generalizes CTL by introducing mental modalities. A sound and complete inference system of BPICTL is given. We prove the finite model property of BPICTL.…

Logic in Computer Science · Computer Science 2025-06-10 Zining Cao

We introduce an expressive probabilistic temporal epistemic logic PTEL suitable to reason about uncertain knowledge of a non-rigid set of agents that can be changed during time. We define semantics for PTEL as Kripke models with epistemic…

Logic · Mathematics 2021-05-27 Zoran Ognjanović , Angelina Ilić Stepić , Aleksandar Perović

We present team semantics for two of the most important linear and branching time specification languages, Linear Temporal Logic (LTL) and Computation Tree Logic (CTL). With team semantics, LTL is able to express hyperproperties, which have…

Logic in Computer Science · Computer Science 2025-10-14 Andreas Krebs , Arne Meier , Jonni Virtema , Martin Zimmermann

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
‹ Prev 1 2 3 10 Next ›