Cover Image

Learning Branching-Time Properties in CTL and ATL via Constraint Solving

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Bordais, Benjamin, Neider, Daniel, Roy, Rajarshi
Format:	Preprint
Published:	2024
Subjects:	Logic in Computer Science
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

The Complexity of Learning Temporal Properties
by: Bordais, Benjamin, et al.
Published: (2024)

A framework for computing upper bounds in passive learning settings
by: Bordais, Benjamin, et al.
Published: (2025)

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

Constraint Automata on Infinite Data Trees: From CTL(Z)/CTL*(Z) To Decision Procedures
by: Demri, Stephane, et al.
Published: (2023)

Multi-Environment MDPs with Prior and Universal Semantics
by: Bordais, Benjamin, et al.
Published: (2026)

Robust Computation Tree Logic
by: Nayak, Satya Prakash, et al.
Published: (2022)

On-The-Fly Symbolic Algorithm for Timed ATL with Abstractions
by: Jensen, Nicolaj Ø., et al.
Published: (2025)

Towards Probabilistic Strategic Timed CTL
by: Jamroga, Wojciech, et al.
Published: (2026)

CTL* Verification and Synthesis using Existential Horn Clauses
by: Carelli, Mishel, et al.
Published: (2024)

Learning DFAs from Positive Examples Only via Word Counting
by: Bordais, Benjamin, et al.
Published: (2025)

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

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

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

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

Robustness-by-Construction Synthesis: Adapting to the Environment at Runtime
by: Nayak, Satya Prakash, et al.
Published: (2022)

Certified Branch-and-Bound MaxSAT Solving (Extended Version)
by: Vandesande, Dieter, et al.
Published: (2025)

Solving Set Constraints with Comprehensions and Bounded Quantifiers
by: Mohamed, Mudathir, et al.
Published: (2025)

Applications of Quantified Constraint Solving over the Reals -- Bibliography
by: Ratschan, Stefan
Published: (2012)

About Time: Model-free Reinforcement Learning with Timed Reward Machines
by: Roy, Rajarshi, et al.
Published: (2025)

Branching Bisimulation Learning
by: Abate, Alessandro, et al.
Published: (2025)

A Cegar-centric Bounded Reachability Analysis for Compositional Affine Hybrid Systems
by: Kundu, Atanu, et al.
Published: (2025)

Automata-Theoretic Characterisations of Branching-Time Temporal Logics
by: Benerecetti, Massimo, et al.
Published: (2024)

Linear-Time--Branching-Time Spectroscopy Accounting for Silent Steps
by: Bisping, Benjamin, et al.
Published: (2023)

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)

VeriFlow: Modeling Distributions for Neural Network Verification
by: Zaid, Faried Abu, et al.
Published: (2024)

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

Spanning Matrices via Satisfiability Solving
by: Eisenhofer, Clemens, et al.
Published: (2024)

Finding Connections via Satisfiability Solving
by: Eisenhofer, Clemens, et al.
Published: (2026)

Can LLM Aid in Solving Constraints with Inductive Definitions?
by: Feng, Weizhi, et al.
Published: (2026)

Solving Homotopy Domain Equations
by: Martínez-Rivillas, Daniel O., et al.
Published: (2021)

Learning Probabilistic Temporal Logic Specifications for Stochastic Systems
by: Roy, Rajarshi, et al.
Published: (2025)

Scaling Neuro-symbolic Problem Solving: Solver-Free Learning of Constraints and Objectives
by: Defresne, Marianne, et al.
Published: (2025)

On Solving String Equations via Powers and Parikh Images
by: Eisenhofer, Clemens, et al.
Published: (2026)

DateSAT: A Framework for Solving Date and Period Constraints
by: Cui, Leyi, et al.
Published: (2026)

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

Branch Sequentialization in Quantum Polytime
by: Hainry, Emmanuel, et al.
Published: (2024)

Galois Energy Games: To Solve All Kinds of Quantitative Reachability Problems
by: Lemke, Caroline, et al.
Published: (2025)

Faster Game Solving by Fixpoint Acceleration
by: Hausmann, Daniel
Published: (2024)

Relating Apartness and Branching Bisimulation Games
by: Rot, Jurriaan, et al.
Published: (2024)