Imagen de Portada

Two-Way One-Counter Nets Revisited

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Almagor, Shaull, Cadilhac, Michaël, Yeshurun, Asaf
Formato:	Preprint
Publicado:	2024
Materias:	Formal Languages and Automata Theory
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

A Factorization Theorem for Forest Algebras
por: Almagor, Shaull, et al.
Publicado: (2026)

Unambiguisability and Register Minimisation of Min-Plus Models
por: Almagor, Shaull, et al.
Publicado: (2025)

A Complexity Bound for Determinisation of Min-Plus Weighted Automata
por: Almagor, Shaull, et al.
Publicado: (2026)

Box-Reachability in Vector Addition Systems
por: Almagor, Shaull, et al.
Publicado: (2025)

Simulation by Rounds of Letter-to-Letter Transducers
por: Nassar, Antonio Abu, et al.
Publicado: (2021)

Quantitative Semantics for Jumping Automata
por: Almagor, Shaull, et al.
Publicado: (2024)

Determinization of Min-Plus Weighted Automata is Decidable
por: Almagor, Shaull, et al.
Publicado: (2025)

Shuffles of Context-Free Languages along Regular Trajectories
por: Barloy, Corentin, et al.
Publicado: (2026)

Global One-Counter Tree Automata
por: Herrmann, Luisa, et al.
Publicado: (2024)

On History-Deterministic One-Counter Nets
por: Prakash, Keya, et al.
Publicado: (2022)

Knee-Deep in C-RASP: A Transformer Depth Hierarchy
por: Yang, Andy, et al.
Publicado: (2025)

Well-Formed Free-Choice Petri Nets Revisited
por: Jancar, Petr, et al.
Publicado: (2026)

Reachability in VASS Extended with Integer Counters
por: Bizière, Clotilde, et al.
Publicado: (2026)

The Quadratic State Cost of Classical Simulation of One-Way Quantum Finite Automata
por: Chen, Zeyu, et al.
Publicado: (2026)

Infinite-state Games with Energy Objectives Beyond Counters
por: Sağlam, Irmak, et al.
Publicado: (2026)

Parameterized Verification of Systems with Precise (0,1)-Counter Abstraction
por: Eichler, Paul, et al.
Publicado: (2024)

Inform: From Compartmental Models to Stochastic Bounded Counter Machines
por: Leys, Tim, et al.
Publicado: (2024)

Hybrid Rebeca Revisited
por: Ghassemi, Fatemeh, et al.
Publicado: (2024)

Learning Realtime One-Counter Automata
por: Bruyère, Véronique, et al.
Publicado: (2021)

Invariants for One-Counter Automata with Disequality Tests
por: Chistikov, Dmitry, et al.
Publicado: (2024)

Synthesizing Petri Nets from Labelled Petri Nets using Token Trail Regions
por: Bergenthum, Robin, et al.
Publicado: (2026)

Correctness Notions for Petri Nets with Identifiers
por: van der Werf, Jan Martijn E. M., et al.
Publicado: (2022)

Waiting Nets: State Classes and Taxonomy
por: Hélouët, Loïc, et al.
Publicado: (2022)

The No Endmarker Theorem for One-Way Probabilistic Pushdown Automata
por: Yamakami, Tomoyuki
Publicado: (2021)

One-clock synthesis problems
por: Lasota, Sławomir, et al.
Publicado: (2026)

Invariants and Home Spaces in Transition Systems and Petri Nets
por: Memmi, Gerard
Publicado: (2023)

Equivalence of Deterministic Weighted Real-time One-Counter Automata
por: Mathew, Prince, et al.
Publicado: (2024)

Collaboration Miner: Discovering Collaboration Petri Nets (Extended Version)
por: Benzin, Janik-Vasily, et al.
Publicado: (2024)

Efficient Construction of Reachability Graphs for Petri Net Product Lines
por: Gómez-Martínez, Elena, et al.
Publicado: (2026)

Semiflows, Home Spaces, and Home States, Applications to the Analysis of Parameterized Petri Nets
por: Memmi, Gerard
Publicado: (2025)

Reachability in One-Dimensional Pushdown Vector Addition Systems is Decidable
por: Bizière, Clotilde, et al.
Publicado: (2024)

Optimal Approximate Minimization of One-Letter Weighted Finite Automata
por: Lacroce, Clara, et al.
Publicado: (2023)

The Alternation Hierarchy of First-Order Logic on Words is Decidable
por: Barloy, Corentin, et al.
Publicado: (2025)

Two or three things I know about tree transducers
por: Nguyên, Lê Thành Dũng
Publicado: (2024)

Two-way affine automata can verify every language
por: Chen, Zeyu, et al.
Publicado: (2025)

Unconditional Time and Space Complexity Lower Bounds for Intersection Non-Emptiness
por: Wehar, Michael
Publicado: (2025)

Population Protocols over Ordered Agents
por: Blondin, Michael, et al.
Publicado: (2026)

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

Soundness of reset workflow nets
por: Blondin, Michael, et al.
Publicado: (2025)

Learning EFSM Models with Registers in Guards
por: Vega, Germán, et al.
Publicado: (2024)