English
Related papers

Related papers: Team Semantics for the Specification and Verificat…

200 papers

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

Strategy logic (SL) is a powerful temporal logic that enables strategic reasoning in multi-agent systems. SL supports explicit (first-order) quantification over strategies and provides a logical framework to express many important…

Multiagent Systems · Computer Science 2024-03-21 Raven Beutner , Bernd Finkbeiner

We discuss the problem of experimentally evaluating linear-time temporal logic (LTL) synthesis tools for reactive systems. We first survey previous such work for the currently publicly available synthesis tools, and then draw conclusions by…

Logic in Computer Science · Computer Science 2011-02-22 Rüdiger Ehlers

We propose LeanLTL, a unifying framework for linear temporal logics in Lean 4. LeanLTL supports reasoning about traces that represent either infinite or finite linear time. The library allows traditional LTL syntax to be combined with…

Logic in Computer Science · Computer Science 2025-07-03 Eric Vin , Kyle A. Miller , Daniel J. Fremont

Non-deterministic planning aims to find a policy that achieves a given objective in an environment where actions have uncertain effects, and the agent - potentially - only observes parts of the current state. Hyperproperties are properties…

Logic in Computer Science · Computer Science 2024-05-24 Raven Beutner , Bernd Finkbeiner

Model checking for real-timed systems is a rich and diverse topic. Among the different logics considered, Metric Interval Temporal Logic (MITL) is a powerful and commonly used logic, which can succinctly encode many interesting timed…

Formal Languages and Automata Theory · Computer Science 2026-05-19 S. Akshay , Prerak Contractor , Paul Gastin , R. Govind , B. Srivathsan

Virtually all verification and synthesis techniques assume that the formal specifications are readily available, functionally correct, and fully match the engineer's understanding of the given system. However, this assumption is often…

Formal Languages and Automata Theory · Computer Science 2022-06-15 Simon Lutz , Daniel Neider , Rajarshi Roy

Signal Temporal Logic (STL) is a convenient formalism to express bounded horizon properties of autonomous critical systems. STL extends LTL to real-valued signals and associates a non-singleton bound interval to each temporal operators. In…

Logic in Computer Science · Computer Science 2023-11-17 Céline Bellanger , Pierre-Loïc Garoche , Matthieu Martel , Célia Picard

We consider an extension of linear-time temporal logic (LTL) with both local and remote data constraints interpreted over a concrete domain. This extension is a natural extension of constraint LTL and the Temporal Logic of Repeating Values,…

Logic in Computer Science · Computer Science 2022-06-06 Ashwin Bhaskar

This paper introduces operators, semantics, characterizations, and solution-independent conditions to guarantee temporal logic specifications for hybrid dynamical systems. Hybrid dynamical systems are given in terms of differential…

Systems and Control · Electrical Eng. & Systems 2020-06-17 Hyejin Han , Ricardo G. Sanfelice

Logics with team semantics provide alternative means for logical characterization of complexity classes. Both dependence and independence logic are known to capture non-deterministic polynomial time, and the frontiers of tractability in…

Logic in Computer Science · Computer Science 2019-03-27 Miika Hannula , Lauri Hella

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

The verification of asynchronous software components poses significant challenges due to the way components interleave and exchange input/output data concurrently. Compositional strategies aim to address this by separating the task of…

Logic in Computer Science · Computer Science 2026-03-11 Alberto Bombardelli , Stefano Tonetta

This paper relates the well-known Linear Temporal Logic with the logic of propositional schemata introduced by the authors. We prove that LTL is equivalent to a class of schemata in the sense that polynomial-time reductions exist from one…

Logic in Computer Science · Computer Science 2011-04-20 Vincent Aravantinos , Ricardo Caferra , Nicolas Peltier

Time series classification is a task of paramount importance, as this kind of data often arises in safety-critical applications. However, it is typically tackled with black-box deep learning methods, making it hard for humans to understand…

Machine Learning · Computer Science 2025-08-28 Irene Ferfoglia , Simone Silvetti , Gaia Saveri , Laura Nenzi , Luca Bortolussi

Temporal stream logic (TSL) extends LTL with updates and predicates over arbitrary function terms. This allows for specifying data-intensive systems for which LTL is not expressive enough. In the semantics of TSL, functions and predicates…

Logic in Computer Science · Computer Science 2022-01-26 Bernd Finkbeiner , Philippe Heim , Noemi Passing

Standpoint linear temporal logic SLTL is a recent formalism able to model possibly conflicting commitments made by distinct agents, taking into account aspects of temporal reasoning. In this paper, we analyse the computational properties of…

Logic in Computer Science · Computer Science 2024-08-19 Stéphane Demri , Przemysław Andrzej Wałęga

Signal Temporal Logic (STL) is a widely adopted specification language in cyber-physical systems for expressing critical temporal requirements, such as safety conditions and response time. However, STL's expressivity is not sufficient to…

Logic in Computer Science · Computer Science 2025-04-15 Hongkai Chen , Zeyu Zhang , Shouvik Roy , Ezio Bartocci , Scott A. Smolka , Scott D. Stoller , Shan Lin

We consider here Linear Temporal Logic (LTL) formulas interpreted over \emph{finite} traces. We denote this logic by LTLf. The existing approach for LTLf satisfiability checking is based on a reduction to standard LTL satisfiability…

Logic in Computer Science · Computer Science 2014-03-10 Jianwen Li , Lijun Zhang , Geguang Pu , Moshe Y. Vardi , Jifeng He

We present a hierarchical framework for analysing propositional linear-time temporal logic (PTL) to obtain standard results such as a small model property, decision procedures and axiomatic completeness. Both finite time and infinite time…

Logic in Computer Science · Computer Science 2007-05-23 Ben Moszkowski
‹ Prev 1 3 4 5 6 7 10 Next ›