Cover Image

Multiple Reachability in Linear Dynamical Systems

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Karimov, Toghrul, Kelmendi, Edon, Ouaknine, Joël, Worrell, James
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

On the Decidability of Presburger Arithmetic Expanded with Powers
by: Karimov, Toghrul, et al.
Published: (2024)

The Monadic Theory of Toric Words
by: Berthé, Valérie, et al.
Published: (2023)

Verification of Linear Dynamical Systems via O-Minimality of the Real Numbers
by: Karimov, Toghrul
Published: (2024)

On the Decidability of Monadic Theories of Arithmetic Predicates
by: Berthé, Valérie, et al.
Published: (2024)

Model Checking Linear Temporal Logic with Standpoint Modalities
by: Aghamov, Rajab, et al.
Published: (2025)

On the Complexity of the Skolem Problem at Low Orders
by: Bacik, Piotr, et al.
Published: (2025)

Model Checking Markov Chains as Distribution Transformers
by: Aghamov, Rajab, et al.
Published: (2024)

The 2-Dimensional Constraint Loop Problem is Decidable
by: Guilmant, Quentin, et al.
Published: (2024)

Termination Analysis of Linear-Constraint Programs
by: Ben-Amram, Amir M., et al.
Published: (2025)

Automata on $S$-adic words
by: Berthé, Valérie, et al.
Published: (2025)

On the $p$-adic Skolem Problem
by: Bacik, Piotr, et al.
Published: (2025)

Computing the Density of the Positivity Set for Linear Recurrence Sequences
by: Kelmendi, Edon
Published: (2021)

Positivity of Nearly Linearly Recurrent Sequences
by: Pouly, Amaury, et al.
Published: (2025)

On the Counting Complexity of the Skolem Problem
by: Jindal, Gorav, et al.
Published: (2024)

Proof-theoretic Semantics for Intuitionistic Multiplicative Linear Logic (Extended Abstract)
by: Gheorghiu, Alexander V., et al.
Published: (2023)

Nested Sequents for Horn-Characterizable Quantified Modal Logics with Equality via Reachability Rules
by: Lyon, Tim S., et al.
Published: (2026)

Small Term Reachability and Related Problems for Terminating Term Rewriting Systems
by: Baader, Franz, et al.
Published: (2024)

Identity Testing for Radical Expressions
by: Balaji, Nikhil, et al.
Published: (2022)

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

Trees in Coalgebra from Generalized Reachability
by: Wißmann, Thorsten, et al.
Published: (2025)

Property Directed Reachability with Extended Resolution
by: Luka, Andrew, et al.
Published: (2025)

Initial Algebra Correspondence under Reachability Conditions
by: Kori, Mayuko, et al.
Published: (2025)

On Higher-Order Reachability Games vs May Reachability
by: Asada, Kazuyuki, et al.
Published: (2022)

Type Isomorphisms for Multiplicative-Additive Linear Logic
by: Di Guardia, Rémi, et al.
Published: (2024)

Robust Almost-Sure Reachability in Multi-Environment MDPs
by: van der Vegt, Marck, et al.
Published: (2023)

Generalised Reachability Games Revisited
by: Bose, Sougata, et al.
Published: (2025)

Formal Verification of Linear Temporal Logic Specifications Using Hybrid Zonotope-Based Reachability Analysis
by: Hadjiloizou, Loizos, et al.
Published: (2024)

Efficient Probabilistic Model Checking for Relational Reachability (Extended Version)
by: Gerlach, Lina, et al.
Published: (2025)

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

On Expansions of Monadic Second-Order Logic with Dynamical Predicates
by: Nieuwveld, Joris, et al.
Published: (2025)

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

Certificate-Aware Property-Directed Reachability
by: Ferdowsi, Arman, et al.
Published: (2026)

Modelling Multiplicative Linear Logic via Deep Inference
by: Galor, Tomer, et al.
Published: (2024)

Did Turing prove the undecidability of the halting problem?
by: Hamkins, Joel David, et al.
Published: (2024)

Fully Automated Verification of Linear Time-Invariant Systems against Signal Temporal Logic Specifications via Reachability Analysis
by: Kochdumper, Niklas, et al.
Published: (2023)

Memoryless Strategies in Stochastic Reachability Games
by: Kiefer, Stefan, et al.
Published: (2024)

A Linear Temporal Logic of Frequencies on Series of Events
by: Antonelli, Melissa, et al.
Published: (2026)

Proof Complexity of Linear Logics
by: Tabatabai, Amirhossein Akbar, et al.
Published: (2026)

On the Reachability Problem for One-Dimensional Thin Grammar Vector Addition Systems
by: Xue, Chengfeng, et al.
Published: (2026)

Improving Reachability in Vector Addition Systems through Pumpability
by: Chen, Weijun, et al.
Published: (2026)