Image de couverture de livre

Reachability in Trace-Pushdown Systems

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Köcher, Chris, Kuske, Dietrich
Format:	Preprint
Publié:	2025
Sujets:	Formal Languages and Automata Theory
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

The theory of reachability in trace-pushdown systems
par: Kuske, Dietrich
Publié: (2025)

Reachability in One-Dimensional Pushdown Vector Addition Systems is Decidable
par: Bizière, Clotilde, et autres
Publié: (2024)

Input-Driven Pushdown Automata with Translucent Input Letters
par: Kutrib, Martin, et autres
Publié: (2025)

Explorability in Pushdown Automata
par: Bedi, Ayaan, et autres
Publié: (2025)

The complexity of separability for semilinear sets and Parikh automata
par: Collins, Elias Rojas, et autres
Publié: (2024)

Visibly Pushdown Languages in Groups
par: Ciobanu, Laura, et autres
Publié: (2026)

The Power of Hard Attention Transformers on Data Sequences: A Formal Language Theoretic Perspective
par: Bergsträßer, Pascal, et autres
Publié: (2024)

Box-Reachability in Vector Addition Systems
par: Almagor, Shaull, et autres
Publié: (2025)

A Bionic Natural Language Parser Equivalent to a Pushdown Automaton
par: Wei, Zhenghao, et autres
Publié: (2024)

V-Star: Learning Visibly Pushdown Grammars from Program Inputs
par: Jia, Xiaodong, et autres
Publié: (2024)

On the Separability Problem of VASS Reachability Languages
par: Keskin, Eren, et autres
Publié: (2024)

Reachability in VASS Extended with Integer Counters
par: Bizière, Clotilde, et autres
Publié: (2026)

Completely Reachable Almost Group Automata
par: Torres, David Fernando Casas
Publié: (2024)

The No Endmarker Theorem for One-Way Probabilistic Pushdown Automata
par: Yamakami, Tomoyuki
Publié: (2021)

Reasoning about Rare-Event Reachability in Stochastic Vector Addition Systems via Affine Vector Spaces
par: Jeppson, Joshua, et autres
Publié: (2025)

On-The-Fly Algorithm for Reachability in Parametric Timed Games (Extended Version)
par: Dahlsen-Jensen, Mikael Bisgaard, et autres
Publié: (2024)

Efficient Construction of Reachability Graphs for Petri Net Product Lines
par: Gómez-Martínez, Elena, et autres
Publié: (2026)

Continuous Pushdown VASS in One Dimension are Easy
par: Perez, Guillermo A., et autres
Publié: (2024)

Reachability in symmetric VASS
par: Kamiński, Łukasz, et autres
Publié: (2025)

TARZAN: A Region-Based Library for Forward and Backward Reachability of Timed Automata (Extended Version)
par: Manini, Andrea, et autres
Publié: (2026)

Reachability Analysis of the Domain Name System
par: Nevatia, Dhruv, et autres
Publié: (2024)

Unambiguous and Co-Nondeterministic Computations of Finite Automata and Pushdown Automata Families and the Effects of Multiple Counters
par: Yamakami, Tomoyuki
Publié: (2024)

A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct
par: Guha, Shibashis, et autres
Publié: (2021)

Exact Separation of Words via Trace Geometry
par: Chen, Zeyu, et autres
Publié: (2026)

Computing the Reachability Value of Posterior-Deterministic POMDPs
par: Fijalkow, Nathanaël, et autres
Publié: (2026)

The Counting Power of Transformers
par: Sälzer, Marco, et autres
Publié: (2025)

Improving Reachability in Vector Addition Systems through Pumpability
par: Chen, Weijun, et autres
Publié: (2026)

Minimum Reachability Probabilities in Rectangular Automata with Random Clocks
par: Delicaris, Joanna, et autres
Publié: (2026)

The Tractability Border of Reachability in Simple Vector Addition Systems with States
par: Chistikov, Dmitry, et autres
Publié: (2024)

Reachability in Vector Addition System with States Parameterized by Geometric Dimension
par: Zheng, Yangluo
Publié: (2024)

History-Constrained Systems
par: Kuijer, Louwe B., et autres
Publié: (2026)

Responsibility in Actor-Based Systems
par: Baier, Christel, et autres
Publié: (2024)

Mining Diamonds in labeled Transition Systems
par: van Spaendonck, P. H. M., et autres
Publié: (2025)

The $\mathsf{AC}^0$-Complexity Of Visibly Pushdown Languages
par: Göller, Stefan, et autres
Publié: (2023)

Forbidden-Context & Ordered Grammar Systems
par: Fernau, Henning, et autres
Publié: (2026)

Backward Responsibility in Transition Systems Beyond Safety
par: Baier, Christel, et autres
Publié: (2025)

Compositional Abstraction for Timed Systems with Broadcast Synchronization
par: Chen, Hanyue, et autres
Publié: (2025)

Weighted Automata and Regular Expressions for Financial Systems
par: Droste, Manfred, et autres
Publié: (2026)

Minimality Notions via Factorization Systems and Examples
par: Wißmann, Thorsten
Publié: (2022)

Reachability in 3-VASS is Elementary
par: Czerwiński, Wojciech, et autres
Publié: (2025)