English
Related papers

Related papers: Model Checking Linear Temporal Logic with Standpoi…

200 papers

Mission-time Linear Temporal Logic (MLTL), a widely used subset of popular specification logics like STL and MTL, is often used to model and verify real world systems in safety-critical contexts. As the results of formal verification are…

Logic in Computer Science · Computer Science 2025-01-30 Zili Wang , Katherine Kosaian , Kristin Yvonne Rozier

This paper investigates the online monitoring problem for cyber-physical systems under signal temporal logic (STL) specifications. The objective is to design an online monitor that evaluates system correctness at runtime based on partial…

Optimization and Control · Mathematics 2025-05-27 Tao Han , Shaoyuan Li , Xiang Yin

Hyperproperties are properties of systems that relate different executions traces, with many applications from security to symmetry, consistency models of concurrency, etc. In recent years, different linear-time logics for specifying…

Logic in Computer Science · Computer Science 2022-07-08 Laura Bozzelli , Adriano Peron , Cesar Sanchez

Automatic techniques for program verification usually suffer the well-known state explosion problem. Most of the classical approaches are based on browsing the structure of some form of model (which represents the behavior of the program)…

Programming Languages · Computer Science 2020-02-19 Marco Comini , Laura Titolo , Alicia Villanueva

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

Some multi-agent scenarios call for the possibility of evaluating specifications in a richer domain of truth values. Examples include runtime monitoring of a temporal property over a growing prefix of an infinite path, inconsistency…

Multiagent Systems · Computer Science 2023-11-01 Wojciech Jamroga , Beata Konikowska , Damian Kurpiewski , Wojciech Penczek

Dynamic Topological Logic ($\mathcal{DTL}$) is a combination of $\mathcal{S}${\em 4}, under its topological interpretation, and the temporal logic $\mathcal{LTL}$ interpreted over the natural numbers. $\mathcal{DTL}$ is used to reason about…

Logic · Mathematics 2016-11-22 David Fernández-Duque

As learned control policies become increasingly common in autonomous systems, there is increasing need to ensure that they are interpretable and can be checked by human stakeholders. Formal specifications have been proposed as ways to…

Human-Computer Interaction · Computer Science 2024-07-04 Isabelle Hurley , Rohan Paleja , Ashley Suh , Jaime D. Peña , Ho Chit Siu

This paper studies knowledge representation in multi-agent environment. We investigate technique for computation truth-values of statements based at a new temporal, agent's-knowledge logic TL. A logical language, mathematical symbolic…

Logic in Computer Science · Computer Science 2014-06-23 Maybin Muyeba , Vladimir Rybakov

Linear Temporal Logic (LTL) is widely used for defining conditions on the execution paths of dynamic systems. In the case of dynamic systems that allow for nondeterministic evolutions, one has to specify, along with an LTL formula f, which…

Artificial Intelligence · Computer Science 2011-09-30 M. Pistore , M. Y. Vardi

A predicate linear temporal logic LTL_{\lambda,=} without quantifiers but with predicate abstraction mechanism and equality is considered. The models of LTL_{\lambda,=} can be naturally seen as the systems of pebbles (flexible constants)…

Logic in Computer Science · Computer Science 2007-05-23 Alexei Lisitsa , Igor Potapov

In runtime verification, manually formalizing a specification for monitoring system executions is a tedious and error-prone process. To address this issue, we consider the problem of automatically synthesizing formal specifications from…

Artificial Intelligence · Computer Science 2023-10-27 Ritam Raha , Rajarshi Roy , Nathanael Fijalkow , Daniel Neider , Guillermo A. Perez

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

Recent work has addressed using formulas in linear temporal logic (LTL) as specifications for agents planning in Markov Decision Processes (MDPs). We consider the inverse problem: inferring an LTL specification from demonstrated behavior…

Systems and Control · Computer Science 2017-11-02 Daniel Kasenberg , Matthias Scheutz

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

We show that Branching-time temporal logics CTL and CTL*, as well as Alternating-time temporal logics ATL and ATL*, are as semantically expressive in the language with a single propositional variable as they are in the full language, i.e.,…

Logic in Computer Science · Computer Science 2019-01-23 Mikhail Rybakov , Dmitry Shkatov

Standpoint extensions of knowledge representation formalisms have been recently introduced as a means to incorporate multi-perspective modelling and reasoning through modal operators that attribute pieces of knowledge to specific entities…

Logic in Computer Science · Computer Science 2025-08-04 Lucía Gómez Álvarez , Sebastian Rudolph

First-order linear temporal logic (FOLTL) is a flexible and expressive formalism capable of naturally describing complex behaviors and properties. Although the logic is in general highly undecidable, the idea of using it as a specification…

Logic in Computer Science · Computer Science 2024-05-31 Luca Geatti , Alessandro Gianola , Nicola Gigante

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

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