Cover Image

The Complexity of Second-order HyperLTL

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Frenkel, Hadar, Regaud, Gaëtan, Zimmermann, Martin
Format:	Preprint
Published:	2023
Subjects:	Logic in Computer Science Formal Languages and Automata Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

The Complexity of Generalized HyperLTL with Stuttering and Contexts
by: Regaud, Gaëtan, et al.
Published: (2025)

Tracy, Traces, and Transducers: Computable Counterexamples and Explanations for HyperLTL Model-Checking
by: Winter, Sarah, et al.
Published: (2024)

Complexity of Model Checking Second-Order Hyperproperties on Finite Structures
by: Finkbeiner, Bernd, et al.
Published: (2026)

The Complexity of Fragments of Second-Order HyperLTL
by: Regaud, Gaëtan, et al.
Published: (2025)

Inferring Symbolic Automata
by: Fisman, Dana, et al.
Published: (2021)

Prophecies all the Way: Game-based Model-Checking for HyperQPTL beyond $\forall^*\exists^*$
by: Winter, Sarah, et al.
Published: (2025)

The Complexity of Generalized HyperLTL with Stuttering and Contexts
by: Regaud, Gaëtan, et al.
Published: (2025)

Positive and monotone fragments of FO and LTL
by: Kuperberg, Denis, et al.
Published: (2024)

Simplifying LTL Model Checking Given Prior Knowledge
by: Duret-Lutz, Alexandre, et al.
Published: (2025)

Robust Probabilistic Temporal Logics
by: Zimmermann, Martin
Published: (2023)

A Direct Translation from LTL with Past to Deterministic Rabin Automata
by: Azzopardi, Shaun, et al.
Published: (2024)

Logics for Context-free Hyperproperties
by: Winter, Sarah, et al.
Published: (2026)

A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct
by: Guha, Shibashis, et al.
Published: (2021)

Monitoring Timed Properties (Revisited)
by: Grosen, Thomas Møller, et al.
Published: (2022)

SemML 2.0: Synthesizing Controllers for LTL
by: Křetínský, Jan, et al.
Published: (2026)

LTL$_f$ Learning Meets Boolean Set Cover
by: Bathie, Gabriel, et al.
Published: (2025)

Positive First-order Logic on Words and Graphs
by: Kuperberg, Denis
Published: (2022)

Inquisitive Team Semantics of LTL
by: Bozzelli, Laura, et al.
Published: (2025)

Characterizations of Monadic Second Order Definable Context-Free Sets of Graphs
by: Iosif, Radu, et al.
Published: (2023)

What is Formal Verification without Specifications? A Survey on mining LTL Specifications
by: Neider, Daniel, et al.
Published: (2025)

On The Space Complexity of Partial Derivatives of Regular Expressions with Shuffle
by: Ancona, Davide, et al.
Published: (2025)

Aperiodicity, Star-freeness, and First-order Logic Definability of Operator Precedence Languages
by: Mandrioli, Dino, et al.
Published: (2020)

Full LTL Synthesis over Infinite-state Arenas
by: Azzopardi, Shaun, et al.
Published: (2023)

On the Existence of Reactive Strategies Resilient to Delay
by: Fränzle, Martin, et al.
Published: (2023)

A cyclic proof system for Guarded Kleene Algebra with Tests (full version)
by: Rooduijn, Jan, et al.
Published: (2024)

A proof theory of right-linear (omega-)grammars via cyclic proofs
by: Das, Anupam, et al.
Published: (2024)

The Alternation Hierarchy of First-Order Logic on Words is Decidable
by: Barloy, Corentin, et al.
Published: (2025)

An algebraic theory of ω-regular languages, via μν-expressions
by: Das, Anupam, et al.
Published: (2025)

Function spaces for orbit-finite sets
by: Bojańczyk, Mikołaj, et al.
Published: (2024)

An efficient quantifier elimination procedure for Presburger arithmetic
by: Haase, Christoph, et al.
Published: (2024)

Cyclic system for an algebraic theory of alternating parity automata
by: Das, Anupam, et al.
Published: (2025)

Analyzing Robustness of Angluin's L$^*$ Algorithm in Presence of Noise
by: Ye, Lina, et al.
Published: (2023)

Weighted GKAT: Completeness and Complexity
by: Van Koevering, Spencer, et al.
Published: (2025)

Ensuring Logic in the Fog: Sound POMDP Synthesis with LTL Objectives
by: Zhou, Can, et al.
Published: (2026)

Relating Reversible Petri Nets and Reversible Event Structures, categorically
by: Melgratti, Hernán, et al.
Published: (2023)

Parikh's Theorem Made Symbolic
by: Hague, Matthew, et al.
Published: (2023)

On-the-fly Unfolding with Optimal Exploration for Linear Temporal Logic Model Checking of Concurrent Software and Systems
by: Li, Shuo, et al.
Published: (2023)

Parikh Automata on Finite and Infinite Words
by: Grobler, Mario, et al.
Published: (2023)

Feasability of Learning Weighted Automata on a Semiring
by: Daviaud, Laure, et al.
Published: (2023)

Discounted-Sum Automata with Multiple Discount Factors
by: Boker, Udi, et al.
Published: (2023)