Image de couverture de livre

Reachability for Multi-Priced Timed Automata with Positive and Negative Rates

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Scoones, Andrew, Shirmohammadi, Mahsa, Worrell, James
Format:	Preprint
Publié:	2024
Sujets:	Formal Languages and Automata Theory F.1.1
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Deterministic Suffix-reading Automata
par: Keerthan, R, et autres
Publié: (2024)

On Constructing Finite Automata by Relational Programming
par: Egri-Nagy, Attila, et autres
Publié: (2025)

Equivalence of Deterministic Weighted Real-time One-Counter Automata
par: Mathew, Prince, et autres
Publié: (2024)

On Direct Product and Quotient of Strongly Connected Automata
par: Hu, Zino H.
Publié: (2011)

Checking Timed Bisimilarity with Virtual Clocks
par: Lieb, Alexander, et autres
Publié: (2024)

On Repetitive Finite Automata with Translucent Words
par: Mráz, František, et autres
Publié: (2025)

On the Boolean Closure of Deterministic Top-Down Tree Automata
par: Löding, Christof, et autres
Publié: (2024)

Orbit-Finite-Dimensional Vector Spaces and Weighted Register Automata
par: Bojańczyk, Mikołaj, et autres
Publié: (2021)

PVASS Reachability is Decidable
par: Guttenberg, Roland, et autres
Publié: (2025)

On Minimization and Learning of Deterministic $ω$-Automata in the Presence of Don't Care Words
par: Löding, Christof, et autres
Publié: (2022)

Differential Tree Automata
par: Manssour, Rida Ait El, et autres
Publié: (2024)

Deterministic Suffix-reading Automata
par: Keerthan, R, et autres
Publié: (2025)

Separability in Büchi Vass and Singly Non-Linear Systems of Inequalities
par: Baumann, Pascal, et autres
Publié: (2024)

Flattability of Priority Vector Addition Systems
par: Guttenberg, Roland
Publié: (2024)

Exploring VASS Parameterised by Geometric Dimension
par: Czerwiński, Wojciech, et autres
Publié: (2026)

Learning Tree Automata with Term Rewriting
par: Kopystiański, Jakub, et autres
Publié: (2026)

Construction of Minkowski Sums by Cellular Automata
par: Tahay, Pierre-Adrien
Publié: (2024)

Reachability and Related Problems in Vector Addition Systems with Nested Zero Tests
par: Guttenberg, Roland, et autres
Publié: (2025)

List of Results on the Černý Conjecture and Reset Thresholds for Synchronizing Automata
par: Volkov, Mikhail V.
Publié: (2025)

Polynomial Complementation of Nondeterministic 2-Way Finite Automata by 1-Limited Automata
par: Guillon, Bruno, et autres
Publié: (2025)

Geometric Characterization of Context-Free Intersections via the Inner Segment Dichotomy
par: Silva, Jorge Miguel
Publié: (2026)

On the growth of hypergeometric sequences
par: Kenison, George, et autres
Publié: (2025)

On Transition Constructions for Automata -- A Categorical Perspective
par: Cruchten, Mike
Publié: (2024)

How Concise are Chains of co-Büchi Automata?
par: Ehlers, Rüdiger
Publié: (2025)

Input-Erasing Two-Way Finite Automata
par: Meduna, Alexander, et autres
Publié: (2025)

Turn Complexity of Context-free Languages, Pushdown Automata and One-Counter Automata
par: Pighizzini, Giovanni
Publié: (2026)

Finitely Presentable Higher-Dimensional Automata and the Irrationality of Process Replication
par: Basold, Henning, et autres
Publié: (2023)

A Uniform Framework for Problems on Context-Free Grammars
par: Esparza, Javier, et autres
Publié: (2024)

Probabilistic Finite Automaton Emptiness is undecidable
par: Rote, Günter
Publié: (2024)

Probabilistic Finite Automaton Emptiness is Undecidable for a Fixed Automaton
par: Rote, Günter
Publié: (2024)

Recognizing Numbers
par: Gaba, Pranshu, et autres
Publié: (2025)

Lexicographic transductions of finite words
par: Filiot, Emmanuel, et autres
Publié: (2025)

Learning Weighted Automata over Number Rings, Concretely and Categorically
par: Aristote, Quentin, et autres
Publié: (2025)

Transcendence for Pisot Morphic Words over an Algebraic Base
par: Kebis, Pavol, et autres
Publié: (2024)

On some Classes of Reversible 2-head Automata
par: Nagy, Benedek, et autres
Publié: (2025)

Functional Closure Properties of Finite $\mathbb{N}$-weighted Automata
par: Dörfler, Julian, et autres
Publié: (2024)

Edit Distance of Finite State Transducers
par: Aiswarya, C., et autres
Publié: (2024)

Exploring Complexity: An Extended Study of Formal Properties for Process Model Complexity Measures
par: Schalk, Patrizia, et autres
Publié: (2024)

Edit Distance of Finite-Valued Transducers
par: Mathew, Prince, et autres
Publié: (2026)

A Nivat Theorem for Weighted Alternating Automata over Commutative Semirings
par: Grabolle, Gustav
Publié: (2022)