D. Adamson, M. Dudey, P. Fleischmann, A. Huch
Word Chain Generators for Prefix Normal Words.
S. Almagor, I. Hasson, M. Pilipczuk, M. Zaslavski
Box-Reachability in Vector Addition Systems.
L. Antal, F. Link, E. Ábrahám
Counterexample-Guided Abstraction Refinement
for Star-Based Neural Network Verification.
E. Asarin, A. Degorre, C. Dima, B. Inclan
Weighing Obese Timed Languages.
A. Brorholt, A. Høeg-Petersen, P. Jensen, K. Larsen,
M. Mikučionis, C. Schilling, A. Wąsowski
Uppaal Coshy: Automatic Synthesis of Compact Shields for Hybrid Systems.
J. Day, M. Konefal
Word Equations with Length Constraints via Weak Arithmetics
and Matrix Reachability Problems.
S. Demri, L. Doyen, R. Fervari
Knowing-How Reasoning with Budgets Recasted:
Universal Reachability Problem on VASS.
F. Di Cosmo, S. Mal, T. Prince
Nets-within-Nets through the Lens of Data Nets.
A. Hartmanns, R. Modderman
DTMC Model Checking by Path Abstraction Revisited.
A. Subramani, K. Subramani, J. Restanio
Maximum Path Sets in trees.
O. Tveretina
Reachability and Mortality for Two-Dimensional RHPCD Systems Are co-NP-hard.
M. van der Vegt, K. Watanabe, I. Hasuo, S. Junges
Compositional Verification of Almost-Sure Büchi Objectives in MDPs.
X. Allamigeon, P. Capetillo, S. Gaubert
Stationary regimes of piecewise linear dynamical systems with priorities.
L. Fleischer, F. Stober, A. Thumm, A. Weiß
Membership and Conjugacy in Inverse Semigroups.
F. Hagihara, A. Kawamura
The Ultimate Signs of Second-Order Holonomic Sequences.
T. Henzinger, P. Kebis, N. Mazzocchi, N. Saraç
Quantitative Language Automata.
Ł. Kamiński, S. Lasota
Reachability in Symmetric VASS.
N. Kochdumper, M. Foughali, P. Habermehl, E. Asarin
Robust Identification of Hybrid Automata from Noisy Data.
V. Krasotin, J. Esparza
Regular Model Checking for Systems with Effectively Regular Reachability Relation.
C. Lemke, B. Bisping
Galois Energy Games to Solve Quantitative Reachability Problems.
P. Mathew, A. Sreejith, V. Penelle
Learning Deterministic One-Counter Automata.
A. Puranic, J. Baras, C. Belta
BT2Automata: Expressing Behavior Trees as Automata
for Formal Control Synthesis.
D. Rigo, P. Baldan, R. Bruni, F. Ranzato
Model Checking as Program Verification by Abstract Interpretation.
Y. Shakiba, H. Sinclair-Banks, G. Zetzsche
A Complexity Dichotomy for Semilinear Target Sets in Automata with One Counter.
M. Starchak
Quantifier Elimination for Regular Integer Linear-Exponential Programming.
M. Weisz, S. Strelchuk
Flexible Catalysis.