:: Library Catalog

Imagen de Portada

Guardado en:

Detalles Bibliográficos
Autores principales:	Bombardelli, Alberto, Tonetta, Stefano
Formato:	Preprint
Publicado:	2023
Materias:	Logic in Computer Science
Acceso en línea:	https://arxiv.org/abs/2312.14831
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Unifying Asynchronous Logics for Hyperproperties
por: Bombardelli, Alberto, et al.
Publicado: (2024)

A Remark on the Expressivity of Asynchronous TeamLTL and HyperLTL
por: Kontinen, Juha, et al.
Publicado: (2024)

On-the-fly Synthesis for LTL over Finite Traces: An Efficient Approach that Counts
por: Xiao, Shengping, et al.
Publicado: (2024)

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

A first-order logic characterization of safety and co-safety languages
por: Cimatti, Alessandro, et al.
Publicado: (2022)

ocLTL: LTL Realizability and Synthesis Modulo ω-Categorical Structures
por: Asor, Ohad
Publicado: (2026)

Characterizing LTL Formulas by Examples
por: Cate, Balder ten, et al.
Publicado: (2026)

Computational Complexity of Standpoint LTL
por: Demri, Stéphane, et al.
Publicado: (2024)

Pairwise Independence of Representation, Classification, and Composition in Finite Extensional Magmas
por: Palmieri, Stefano
Publicado: (2026)

Runtime Verification for LTL in Stochastic Systems
por: Esparza, Javier, et al.
Publicado: (2025)

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

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

Sound and Complete Witnesses for Template-based Verification of LTL Properties on Polynomial Programs
por: Chatterjee, Krishnendu, et al.
Publicado: (2024)

Infinite Traces by Finality: a Sheaf-Theoretic Approach
por: Peressotti, Marco
Publicado: (2025)

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

Infinite trees
por: Goy, Alexandre
Publicado: (2025)

HyperLTL Satisfiability Is Highly Undecidable, HyperCTL$^*$ is Even Harder
por: Fortin, Marie, et al.
Publicado: (2023)

TAPAAL HyperLTL: A Tool for Checking Hyperproperties of Petri Nets
por: Gonzalez, Bruno Maria René, et al.
Publicado: (2025)

Complete Compositional Syntax for Finite Transducers on Finite and Bi-Infinite Words
por: Carette, Titouan, et al.
Publicado: (2025)

Automata Linear Dynamic Logic on Finite Traces
por: Smith, Kevin W., et al.
Publicado: (2021)

An Infinite Needle in a Finite Haystack: Finding Infinite Counter-Models in Deductive Verification
por: Elad, Neta, et al.
Publicado: (2023)

Computing with Infinite Objects: the Gray Code Case
por: Spreen, Dieter, et al.
Publicado: (2021)

The Complexity of Second-order HyperLTL
por: Frenkel, Hadar, et al.
Publicado: (2023)

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

Syntax Is Easy, Semantics Is Hard: Evaluating LLMs for LTL Translation
por: Danso, Priscilla Kyei, et al.
Publicado: (2026)

CTL* Model Checking on Infinite Families of Finite-State Labeled Transition Systems (Technical Report)
por: Pettinau, Roberto, et al.
Publicado: (2026)

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

Three Fundamental Questions in Modern Infinite-Domain Constraint Satisfaction
por: Pinsker, Michael, et al.
Publicado: (2025)

A PAC Learning Algorithm for LTL and Omega-regular Objectives in MDPs
por: Perez, Mateo, et al.
Publicado: (2023)

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

Shield Synthesis for LTL Modulo Theories
por: Rodriguez, Andoni, et al.
Publicado: (2024)

Timeout Asynchronous Session Types: Safe Asynchronous Mixed-Choice For Timed Interactions
por: Pears, Jonah, et al.
Publicado: (2024)

A Unified Gentzen-style Framework for Until-free LTL
por: Kamide, Norihiro, et al.
Publicado: (2024)

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

HyperCertificates: Verification of Discrete-time Dynamical Systems against HyperLTL Specifications
por: Murali, Vishnu, et al.
Publicado: (2026)

A Complete Fragment of LTL(EB)
por: Ferrarotti, Flavio, et al.
Publicado: (2024)

Inquisitive Team Semantics of LTL
por: Bozzelli, Laura, et al.
Publicado: (2025)

Asynchronous Multiparty Sessions with Mixed Choice
por: Barbanera, Franco, et al.
Publicado: (2026)

The Pebble-Relation Comonad in Finite Model Theory
por: Montacute, Yoàv, et al.
Publicado: (2021)

Integrating LTL Constraints into PPO for Safe Reinforcement Learning
por: Zhang, Maifang, et al.
Publicado: (2026)