Recent advances on reachability problems for valence systems (invited talk)
From MaRDI portal
Publication:2695487
DOI10.1007/978-3-030-89716-1_4OpenAlexW3208672221MaRDI QIDQ2695487FDOQ2695487
Authors: Georg Zetzsche 
Publication date: 31 March 2023
Full work available at URL: https://doi.org/10.1007/978-3-030-89716-1_4
Recommendations
- Scope-Bounded Reachability in Valence Systems
- Bounded context switching for valence systems
- The emptiness problem for valence automata or: another decidable extension of Petri nets
- The emptiness problem for valence automata over graph monoids
- First-order logic with reachability for infinite-state systems
Cites Work
- Reversal-Bounded Multicounter Machines and Their Decision Problems
- Remarks on blind and partially blind one-way multicounter machines
- Undecidable problems in unreliable computations.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Tools and Algorithms for the Construction and Analysis of Systems
- Formal Languages and Groups as Memory
- The submonoid and rational subset membership problems for graph groups.
- Integer vector addition systems with states
- On the rational subset problem for groups.
- Title not available (Why is that?)
- Extended finite automata over groups
- Linear Arithmetic with Stars
- Title not available (Why is that?)
- Sequential grammars and automata with valences
- Finite automata with multiplication
- The reachability problem for Petri nets is not elementary
- Title not available (Why is that?)
- Higher-order model checking: an overview
- A lower bound for the coverability problem in acyclic pushdown VAS
- Silent transitions in automata with storage
- Reachability of scope-bounded multistack pushdown systems
- Bounded context switching for valence systems
- Semilinearity and Context-Freeness of Languages Accepted by Valence Automata
- On the coverability problem for pushdown vector addition systems in one dimension
- The emptiness problem for valence automata over graph monoids
- First-order logic with reachability for infinite-state systems
- Scope-Bounded Reachability in Valence Systems
Cited In (5)
- First-order logic with reachability for infinite-state systems
- Scope-Bounded Reachability in Valence Systems
- The emptiness problem for valence automata or: another decidable extension of Petri nets
- The complexity of bidirected reachability in valence systems
- Bounded context switching for valence systems
This page was built for publication: Recent advances on reachability problems for valence systems (invited talk)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2695487)
