scientific article; zbMATH DE number 7407773
From MaRDI portal
Mikhail Raskin, Michael Blondin, Christoph Haase, Filip Mazowiecki
Publication date: 8 October 2021
Full work available at URL: https://arxiv.org/abs/1909.12386
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the reachability problem for 5-dimensional vector addition systems
- Some decision problems related to the reachability problem for Petri nets
- The covering and boundedness problems for vector addition systems
- On finite semigroups of matrices
- How hard is it to verify flat affine counter systems with the finite monoid property?
- Parallel program schemata
- Unbounded-Thread Program Verification using Thread-State Equations
- BOUNDED PARIKH AUTOMATA
- Reachability in Register Machines with Polynomial Updates
- Integer Vector Addition Systems with States
- Revisiting Ackermann-Hardness for Lossy Counter Machines and Reset Petri Nets
- An Algorithm for the General Petri Net Reachability Problem
- Finite Groups of Matrices Whose Entries Are Integers
- The taming of the semi-linear set
- Regular combinators for string transformations
- Reachability in Petri Nets with Inhibitor Arcs
- Decision Problems for Additive Regular Functions
- Parameterized Verification of Infinite-State Processes with Global Conditions
- UNAMBIGUOUS CONSTRAINED AUTOMATA
- On finitely generated monoids of matrices with entries in $\mathbb {N}$
