scientific article; zbMATH DE number 7378558
From MaRDI portal
Publication:5009428
DOI10.4230/LIPIcs.CONCUR.2018.14MaRDI QIDQ5009428
Christoph Haase, Filip Mazowiecki, Michael Blondin
Publication date: 4 August 2021
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (9)
Integer weighted automata on infinite words ⋮ Integer Weighted Automata on Infinite Words ⋮ Expressive Power of Broadcast Consensus Protocols ⋮ Directed reachability for infinite-state systems ⋮ On decidability and complexity of low-dimensional robot games ⋮ Reachability problems in low-dimensional nondeterministic polynomial maps over integers ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Weak Cost Register Automata are Still Powerful
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
- An SMT-Based Approach to Coverability Analysis
- 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
- Bounds on Positive Integral Solutions of Linear Diophantine Equations
- Finite Groups of Matrices Whose Entries Are Integers
- The taming of the semi-linear set
- Regular combinators for string transformations
- Reachability in Two-Dimensional Vector Addition Systems with States Is PSPACE-Complete
- Reachability in Petri Nets with Inhibitor Arcs
- Decision Problems for Additive Regular Functions
- UNAMBIGUOUS CONSTRAINED AUTOMATA
This page was built for publication:
