Saved in:
| Main Authors: | Hertzberg, Niclas, Sevenhuijsen, Merlijn, Kåreborn, Liv, Lokrantz, Anna |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2508.18798 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Frequency Automata: A novel formal model of hybrid systems in combined time and frequency domains
by: Kim, Moon, et al.
Published: (2025)
by: Kim, Moon, et al.
Published: (2025)
Formal verification of higher dimensional quantum protocols
by: Puthoor, Ittoop Vergheese
Published: (2024)
by: Puthoor, Ittoop Vergheese
Published: (2024)
Binary codes that do not preserve primitivity
by: Holub, Štěpán, et al.
Published: (2022)
by: Holub, Štěpán, et al.
Published: (2022)
Finite maximal codes and factorizations of cyclic groups
by: De Felice, Clelia
Published: (2022)
by: De Felice, Clelia
Published: (2022)
Over-approximation of weakly-hard constraints for control systems verification (Extended)
by: de Maeyer, Rieke, et al.
Published: (2026)
by: de Maeyer, Rieke, et al.
Published: (2026)
Synchronization of strongly connected partial DFAs and prefix codes
by: Berlinkov, Mikhail V., et al.
Published: (2021)
by: Berlinkov, Mikhail V., et al.
Published: (2021)
Static Analysis Framework for Detecting Use-After-Free Bugs in C++
by: Teodorescu, Vlad-Alexandru, et al.
Published: (2024)
by: Teodorescu, Vlad-Alexandru, et al.
Published: (2024)
Complex event recognition under time constraints: towards a formal framework for efficient query evaluation
by: García, Julián, et al.
Published: (2025)
by: García, Julián, et al.
Published: (2025)
Robust MITL planning under uncertain navigation times
by: Linard, Alexis, et al.
Published: (2024)
by: Linard, Alexis, et al.
Published: (2024)
A General Information Extraction Framework Based on Formal Languages
by: Schmid, Markus L.
Published: (2025)
by: Schmid, Markus L.
Published: (2025)
Statistical process discovery
by: Cry, Pierre, et al.
Published: (2025)
by: Cry, Pierre, et al.
Published: (2025)
Reasoning about Rare-Event Reachability in Stochastic Vector Addition Systems via Affine Vector Spaces
by: Jeppson, Joshua, et al.
Published: (2025)
by: Jeppson, Joshua, et al.
Published: (2025)
Hyper pattern matching
by: Waga, Masaki, et al.
Published: (2025)
by: Waga, Masaki, et al.
Published: (2025)
Input-Driven Pushdown Automata with Translucent Input Letters
by: Kutrib, Martin, et al.
Published: (2025)
by: Kutrib, Martin, et al.
Published: (2025)
Certified Symbolic Finite Transducers: Formalization and Applications to String Analysis
by: Kan, Shuanglong, et al.
Published: (2025)
by: Kan, Shuanglong, et al.
Published: (2025)
Componentwise Automata Learning for System Integration (Extended Version)
by: Fujinami, Hiroya, et al.
Published: (2025)
by: Fujinami, Hiroya, et al.
Published: (2025)
Universality Frontier for Asynchronous Cellular Automata
by: Baburin, Ivan, et al.
Published: (2025)
by: Baburin, Ivan, et al.
Published: (2025)
Pumping-Like Results for Copyless Cost Register Automata and Polynomially Ambiguous Weighted Automata
by: Mazowiecki, Filip, et al.
Published: (2025)
by: Mazowiecki, Filip, et al.
Published: (2025)
Castor Ministerialis
by: Hercher, Christian
Published: (2025)
by: Hercher, Christian
Published: (2025)
Semiflows, Home Spaces, and Home States, Applications to the Analysis of Parameterized Petri Nets
by: Memmi, Gerard
Published: (2025)
by: Memmi, Gerard
Published: (2025)
Unambiguisability and Register Minimisation of Min-Plus Models
by: Almagor, Shaull, et al.
Published: (2025)
by: Almagor, Shaull, et al.
Published: (2025)
Passive Learning of Lattice Automata from Recurrent Neural Networks
by: Slimi, Jaouhar, et al.
Published: (2025)
by: Slimi, Jaouhar, et al.
Published: (2025)
An Automata-Based Method to Formalize Psychological Theories -- The Case Study of Lazarus and Folkman's Stress Theory
by: Finkel, Alain, et al.
Published: (2025)
by: Finkel, Alain, et al.
Published: (2025)
Structural Abstraction and Refinement for Probabilistic Programs
by: Li, Guanyan, et al.
Published: (2025)
by: Li, Guanyan, et al.
Published: (2025)
Universally Wheeler Languages
by: Becker, Ruben, et al.
Published: (2025)
by: Becker, Ruben, et al.
Published: (2025)
FocusE: A semantic extension of FocusST
by: Spichkova, Maria
Published: (2025)
by: Spichkova, Maria
Published: (2025)
Polyregular Model Checking
by: Lopez, Aliaume, et al.
Published: (2025)
by: Lopez, Aliaume, et al.
Published: (2025)
Reversible Pebble Transducers
by: Dartois, Luc, et al.
Published: (2025)
by: Dartois, Luc, et al.
Published: (2025)
On the Complexity of Language Membership for Probabilistic Words
by: Amarilli, Antoine, et al.
Published: (2025)
by: Amarilli, Antoine, et al.
Published: (2025)
Mind the Gap: A Formal Investigation of the Relationship Between Log and Model Complexity -- Extended Version
by: Schalk, Patrizia, et al.
Published: (2025)
by: Schalk, Patrizia, et al.
Published: (2025)
Higher-Dimensional Automata : Extension to Infinite Tracks
by: Passemard, Luc, et al.
Published: (2025)
by: Passemard, Luc, et al.
Published: (2025)
Counting Abstraction for the Verification of Structured Parameterized Networks
by: Bozga, Marius, et al.
Published: (2025)
by: Bozga, Marius, et al.
Published: (2025)
Learning Event-recording Automata Passively
by: Majumdar, Anirban, et al.
Published: (2025)
by: Majumdar, Anirban, et al.
Published: (2025)
Two-way affine automata can verify every language
by: Chen, Zeyu, et al.
Published: (2025)
by: Chen, Zeyu, et al.
Published: (2025)
TEMPORA: Efficient Verification of Metric Temporal Properties with Past in Pointwise Semantics
by: Akshay, S., et al.
Published: (2025)
by: Akshay, S., et al.
Published: (2025)
Resolving Nondeterminism by Chance
by: Paul, Soumyajit, et al.
Published: (2025)
by: Paul, Soumyajit, et al.
Published: (2025)
Model Checking for Multi-Agent Systems Modeled By Epistemic Process Calculus
by: Yu, Qixian, et al.
Published: (2025)
by: Yu, Qixian, et al.
Published: (2025)
Languages of Boundedly-Ambiguous Vector Addition Systems with States
by: Czerwiński, Wojciech, et al.
Published: (2025)
by: Czerwiński, Wojciech, et al.
Published: (2025)
Characterization of deterministically recognizable weighted tree languages over commutative semifields by finitely generated and cancellative scalar algebras
by: Fülöp, Zoltán, et al.
Published: (2025)
by: Fülöp, Zoltán, et al.
Published: (2025)
Stochastic Languages at Sub-stochastic Cost
by: Agarwal, Smayan, et al.
Published: (2025)
by: Agarwal, Smayan, et al.
Published: (2025)
Similar Items
-
Frequency Automata: A novel formal model of hybrid systems in combined time and frequency domains
by: Kim, Moon, et al.
Published: (2025) -
Formal verification of higher dimensional quantum protocols
by: Puthoor, Ittoop Vergheese
Published: (2024) -
Binary codes that do not preserve primitivity
by: Holub, Štěpán, et al.
Published: (2022) -
Finite maximal codes and factorizations of cyclic groups
by: De Felice, Clelia
Published: (2022) -
Over-approximation of weakly-hard constraints for control systems verification (Extended)
by: de Maeyer, Rieke, et al.
Published: (2026)