Cover Image

Inquisitive Team Semantics of LTL

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Bozzelli, Laura, Litak, Tadeusz, Mittelmann, Munyque, Murano, Aniello
Format:	Preprint
Published:	2025
Subjects:	Logic in Computer Science Formal Languages and Automata Theory F.4.1
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Module checking of pushdown multi-agent systems
by: Bozzelli, Laura, et al.
Published: (2020)

Model-Checking PCTL Properties of Stateless Probabilistic Pushdown Systems
by: Lin, Deren, et al.
Published: (2014)

Have a thing? Reasoning around recursion with dynamic typing in grounded arithmetic
by: Bobrow, Elliot, et al.
Published: (2025)

A Theory of Hanoi Omega-Automata and Games
by: Filiot, Emmanuel, et al.
Published: (2026)

Orbit-finite linear programming
by: Ghosh, Arka, et al.
Published: (2023)

A Nivat Theorem for Weighted Alternating Automata over Commutative Semirings
by: Grabolle, Gustav
Published: (2022)

Characterizing NC1 with Typed Monoids
by: Dawar, Anuj, et al.
Published: (2025)

Equivariant ideals of polynomials
by: Ghosh, Arka, et al.
Published: (2024)

Succinctness of Cosafety Fragments of LTL via Combinatorial Proof Systems (extended version)
by: Geatti, Luca, et al.
Published: (2024)

Satisfiability of Context-free String Constraints with Subword-ordering and Transducers
by: Aiswarya, C, et al.
Published: (2024)

From Compactifying Lambda-Letrec Terms to Recognizing Regular-Expression Processes
by: Grabmayer, Clemens
Published: (2024)

Openness And Partial Adjacency In One Variable TPTL
by: Krishna, Shankara Narayanan, et al.
Published: (2024)

Rabin Games and Colourful Universal Trees
by: Majumdar, Rupak, et al.
Published: (2024)

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

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

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

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

Introducing Divergence for Infinite Probabilistic Models
by: Finkel, Alain, et al.
Published: (2023)

How Concise are Chains of co-Büchi Automata?
by: Ehlers, Rüdiger
Published: (2025)

A Decision Procedure for Probabilistic Kleene Algebra with Angelic Nondeterminism
by: Ong, Shawn, et al.
Published: (2025)

Finitely Presentable Higher-Dimensional Automata and the Irrationality of Process Replication
by: Basold, Henning, et al.
Published: (2023)

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

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

A Logic For Fresh Labelled Transition Systems
by: Bandukara, Mohamed H, et al.
Published: (2025)

The complexity of downward closures of indexed languages
by: Mandel, Richard, et al.
Published: (2026)

Learning Deterministic One-Counter Automata in Polynomial Time
by: Mathew, Prince, et al.
Published: (2025)

PVASS Reachability is Decidable
by: Guttenberg, Roland, et al.
Published: (2025)

Reachability and Related Problems in Vector Addition Systems with Nested Zero Tests
by: Guttenberg, Roland, et al.
Published: (2025)

Edit Distance of Finite-Valued Transducers
by: Mathew, Prince, et al.
Published: (2026)

Edit Distance of Finite State Transducers
by: Aiswarya, C., et al.
Published: (2024)

Stratifiable formulae are not context-free
by: Ryan-Smith, Calliope
Published: (2023)

Visualising CTL Witnesses and Counterexamples -- Extended Version
by: Rensink, Arend
Published: (2026)

Parameterized Verification of Disjunctive Timed Networks
by: André, Étienne, et al.
Published: (2023)

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

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

Hypernode Automata
by: Bartocci, Ezio, et al.
Published: (2023)

Dynamically Reprogrammable Runtime Monitors for Bounded-time MTL
by: Hebballi, Chirantan, et al.
Published: (2026)

On Some Complexity Results for Even Linear Languages
by: Cojocaru, Liliana
Published: (2024)

Quantitative Semantics for Jumping Automata
by: Almagor, Shaull, et al.
Published: (2024)

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