AI Chat AI Image Generator AI Video Text to Speech

LTL with Local and Remote Data Constraints

05/30/2022

∙

by Ashwin Bhaskar, et al.

∙

∙

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, which have been studied before. We shall use previous results to prove that the satisfiability problem for this logic is decidable. Further, we shall see that trying to extend this logic by making it more expressive can lead to undecidability.

page 1

page 2

page 3

page 4

research

∙ 10/01/2020

Erratum to "Frequency Linear-time Temporal Logic"

We correct our proof of a theorem stating that satisfiability of frequen...

0 Benedikt Bollig, et al. ∙

research

∙ 10/02/2018

Cutting Diamonds: Temporal DLs with Probabilistic Distributions over Data

Recent work has studied a probabilistic extension of the temporal logic ...

0 Alisa Kovtunova, et al. ∙

research

∙ 03/07/2018

On the Expressiveness and Monitoring of Metric Temporal Logic

It is known that Metric Temporal Logic (MTL) is strictly less expressive...

0 Hsi-Ming Ho, et al. ∙

research

∙ 06/28/2022

On two-variable guarded fragment logic with expressive local Presburger constraints

We consider the extension of two-variable guarded fragment logic with lo...

0 Chia-hsuan Lu, et al. ∙

research

∙ 07/14/2022

Realizability Problem for Constraint LTL

Constraint linear-time temporal logic (CLTL) is an extension of LTL that...

0 Ashwin Bhaskar, et al. ∙

research

∙ 03/07/2023

The Temporal Logic Synthesis Format TLSF v1.2

We present an extension of the Temporal Logic Synthesis Format (TLSF). T...

0 Swen Jacobs, et al. ∙

research

∙ 11/20/2018

Identifiers in Registers - Describing Network Algorithms with Logic

We propose a formal model of distributed computing based on register aut...

0 Benedikt Bollig, et al. ∙