Cover Image

On-The-Fly Symbolic Algorithm for Timed ATL with Abstractions

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Jensen, Nicolaj Ø., Larsen, Kim G., Lime, Didier, Srba, Jiří
Format:	Preprint
Published:	2025
Subjects:	Logic in Computer Science
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Dense Integer-Complete Synthesis for Bounded Parametric Timed Automata
by: André, Étienne, et al.
Published: (2023)

Methods for Efficient Unfolding of Colored Petri Nets
by: Bilgram, Alexander, et al.
Published: (2022)

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

Learning Branching-Time Properties in CTL and ATL via Constraint Solving
by: Bordais, Benjamin, et al.
Published: (2024)

HyperATL*: A Logic for Hyperproperties in Multi-Agent Systems
by: Beutner, Raven, et al.
Published: (2022)

A Lazy Abstraction Algorithm for Markov Decision Processes: Theory and Initial Evaluation
by: Szekeres, Dániel, et al.
Published: (2024)

The Modal Logic of Abstraction Refinement
by: Piribauer, Jakob, et al.
Published: (2026)

ATL*AS: An Automata-Theoretic Approach and Tool for the Verification of Strategic Abilities in Multi-Agent Systems
by: Garcia-Alcalde, Sofia Garcia de Blas, et al.
Published: (2025)

Generating Plans for Belief-Desire-Intention (BDI) Agents Using Alternating-Time Temporal Logic (ATL)
by: Léveillé, Dylan
Published: (2025)

Symbolic Model Checking using Intervals of Vectors
by: Morard, Damien, et al.
Published: (2026)

Enhancing Analogical Reasoning in the Abstraction and Reasoning Corpus via Model-Based RL
by: Lee, Jihwan, et al.
Published: (2024)

A Syntactic Approach to Computing Complete and Sound Abstraction in the Situation Calculus
by: Fang, Liangda, et al.
Published: (2024)

The Complexity of Data-Free Nfer
by: Kauffman, Sean, et al.
Published: (2024)

On the Completeness of Interpolation Algorithms
by: Hetzl, Stefan, et al.
Published: (2024)

Counterexample-Guided Abstraction Refinement for Generalized Graph Transformation Systems (Full Version)
by: König, Barbara, et al.
Published: (2025)

Abstractions of Sequences, Functions and Operators
by: Rustenholz, Louis, et al.
Published: (2025)

Regular Abstractions for Array Systems
by: Hong, Chih-Duo, et al.
Published: (2024)

Structural Liveness of Immediate Observation Petri Nets
by: Jancar, Petr, et al.
Published: (2021)

Two Cases of Deduction with Non-referring Descriptions
by: Raclavský, Jiří
Published: (2024)

Symbolic Computation for All the Fun
by: Brown, Chad E., et al.
Published: (2024)

A Zone-Based Algorithm for Timed Parity Games
by: Geeraerts, Gilles, et al.
Published: (2025)

Internal and External Calculi: Ordering the Jungle without Being Lost in Translations
by: Lyon, Tim S., et al.
Published: (2023)

Catamorphic Abstractions for Constrained Horn Clause Satisfiability
by: De Angelis, Emanuele, et al.
Published: (2024)

Exhaustive Symbolic Integration: Integration by Differentiation and the Landscape of Symbolic Integrability
by: Desmond, Harry
Published: (2026)

Structural Liveness of Conservative Petri Nets
by: Jančar, Petr, et al.
Published: (2025)

On Symbol Elimination and Uniform Interpolation in Theory Extensions
by: Sofronie-Stokkermans, Viorica
Published: (2025)

Efficient Synthesis of Symbolic Distributed Protocols by Sketching
by: Egolf, Derek, et al.
Published: (2024)

Answer-Set-Programming-based Abstractions for Reinforcement Learning
by: Bankosegger, Rafael, et al.
Published: (2026)

Efficient Discovery of Actual Causality using Abstraction-Refinement
by: Rafieioskouei, Arshia, et al.
Published: (2024)

Bounded Structural Model Finding with Symbolic Data Constraints
by: Boronat, Artur
Published: (2026)

Deciding Equations in the Time Warp Algebra
by: van Gool, Sam, et al.
Published: (2023)

A Compositional Framework for On-the-Fly LTLf Synthesis
by: Li, Yongkang, et al.
Published: (2025)

Proof Strategy Extraction from LLMs for Enhancing Symbolic Provers
by: Fang, Jian, et al.
Published: (2025)

Synthesiz3 This: an SMT-Based Approach for Synthesis with Uncomputable Symbols
by: Hozzová, Petra, et al.
Published: (2025)

Inductive Satisfiability Certification for Universal Quantifiers and Uninterpreted Function Symbols
by: Ratschan, Stefan, et al.
Published: (2026)

Abstraction-Based Proof Production in Formal Verification of Neural Networks
by: Elboher, Yizhak Yisrael, et al.
Published: (2025)

Bifurcation Logic: Separation Through Ordering
by: Galmiche, Didier, et al.
Published: (2025)

Project and Conquer: Fast Quantifier Elimination for Checking Petri Net Reachability
by: Amat, Nicolas, et al.
Published: (2024)

On the Complexity of Proving Polyhedral Reductions
by: Amat, Nicolas, et al.
Published: (2023)

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