English
Related papers

Related papers: Realizing Omega-regular Hyperproperties

200 papers

Hyperproperties are system properties that relate multiple computation paths in a system and are commonly used to, e.g., define information-flow policies. In this paper, we study a novel class of hyperproperties that allow reasoning about…

Logic in Computer Science · Computer Science 2024-02-14 Raven Beutner , Bernd Finkbeiner

Hyperproperties elevate the traditional view of trace properties form sets of traces to sets of sets of traces and provide a formalism for expressing information-flow policies. For trace properties, algorithms for verification, monitoring,…

Formal Languages and Automata Theory · Computer Science 2021-01-01 Bernd Finkbeiner , Lennart Haas , Hazem Torfah

We introduce Parametric Linear Dynamic Logic (PLDL), which extends Linear Dynamic Logic (LDL) by temporal operators equipped with parameters that bound their scope. LDL itself was proposed as an extension of Linear Temporal Logic (LTL) that…

Logic in Computer Science · Computer Science 2015-12-08 Peter Faymonville , Martin Zimmermann

Formal languages are in the core of models of computation and their behavior. A rich family of models for many classes of languages have been widely studied. Hyperproperties lift conventional trace-based languages from a set of execution…

Formal Languages and Automata Theory · Computer Science 2022-01-06 Borzoo Bonakdarpour , Sarai Sheinvald

Temporal logics for hyperproperties have recently emerged as an expressive specification technique for relational properties of reactive systems. While the model checking problem for such logics has been widely studied, there is a scarcity…

Programming Languages · Computer Science 2025-01-15 Arthur Correnson , Bernd Finkbeiner

We consider the optimization variant of the realizability problem for Prompt Linear Temporal Logic, an extension of Linear Temporal Logic (LTL) by the prompt eventually operator whose scope is bounded by some parameter. In the realizability…

Logic in Computer Science · Computer Science 2016-09-15 Leander Tentrup , Alexander Weinert , Martin Zimmermann

Temporal logics have been studied as an approach to the specification of hyperproperties, resulting in the conception of "hyperlogics". With a few recent exceptions, the hyperlogics thus far developed can only relate different traces of a…

Logic in Computer Science · Computer Science 2024-02-06 Jens Oliver Gutsfeld , Arne Meier , Christoph Ohrem , Jonni Virtema

Metric Temporal Logic $\mathsf{MTL}[\until_I,\since_I]$ is one of the most studied real time logics. It exhibits considerable diversity in expressiveness and decidability properties based on the permitted set of modalities and the nature of…

Logic in Computer Science · Computer Science 2014-04-29 Khushraj Madnani , Shankara Narayanan Krishna , Paritosh Pandya

We study the problem of formalizing and checking probabilistic hyperproperties for models that allow nondeterminism in actions. We extend the temporal logic \HyperPCTL, which has been previously introduced for discrete-time Markov chains,…

Logic in Computer Science · Computer Science 2020-07-17 Erika Abraham , Ezio Bartocci , Borzoo Bonakdarpour , Oyendrila Dobe

Linear temporal logic (LTL) is used in system verification to write formal specifications for reactive systems. However, some relevant properties, e.g. non-inference in information flow security, cannot be expressed in LTL. A class of such…

Logic in Computer Science · Computer Science 2024-06-10 Juha Kontinen , Max Sandström , Jonni Virtema

Ontology-based query answering (OBQA) asks whether a Boolean conjunctive query is satisfied by all models of a logical theory consisting of a relational database paired with an ontology. The introduction of existential rules (i.e., Datalog…

Logic in Computer Science · Computer Science 2017-07-07 Giovanni Amendola , Nicola Leone , Marco Manna

Metric Temporal Logic (MTL) and Timed Propositional Temporal Logic (TPTL) are prominent real-time extensions of Linear Temporal Logic (LTL). In general, the satisfiability checking problem for these extensions is undecidable when both the…

Logic in Computer Science · Computer Science 2021-09-07 Shankara Narayanan Krishna , Khushraj Madnani , Manuel Mazo , Paritosh K. Pandya

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

We settle the complexity of satisfiability, finite-state satisfiability, and model-checking for generalized HyperLTL with stuttering and contexts, an expressive logic for the specification of asynchronous hyperproperties. Such properties…

Logic in Computer Science · Computer Science 2025-11-11 Gaëtan Regaud , Martin Zimmermann

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

Automatic synthesis from linear temporal logic (LTL) specifications is widely used in robotic motion planning, control of autonomous systems, and load distribution in power networks. A common specification pattern in such applications…

Logic in Computer Science · Computer Science 2018-04-03 Rayna Dimitrova , Mahsa Ghasemi , Ufuk Topcu

A specification given as a formula in linear temporal logic (LTL) defines a system by its set of traces. However, certain features such as information flow security constraints are rather modeled as so-called hyperproperties, which are sets…

Logic in Computer Science · Computer Science 2020-04-28 Martin Lück

Metric Temporal Logic (MTL) and Timed Propositional Temporal Logic (TPTL) extend Linear Temporal Logic (LTL) for real-time constraints, with MTL using time-bounded modalities and TPTL employing freeze quantifiers. Satisfiability for both is…

Logic in Computer Science · Computer Science 2024-11-04 Shankara Narayanan Krishna , Khushraj Madnani , Agnipratim Nag , Paritosh Pandya

Temporal Equilibrium Logic (TEL) is a promising framework that extends the knowledge representation and reasoning capabilities of Answer Set Programming with temporal operators in the style of LTL. To our knowledge it is the first…

Logic in Computer Science · Computer Science 2015-03-03 Laura Bozzelli , David Pearce

Metric Temporal Logic, $\mtlfull$ is amongst the most studied real-time logics. It exhibits considerable diversity in expressiveness and decidability properties based on the permitted set of modalities and the nature of time interval…

Logic in Computer Science · Computer Science 2013-11-28 Khushraj Madnani , Shankara Narayanan Krishna , Paritosh K. Pandya