Recent advances on reachability problems for valence systems (invited talk)

DOI10.1007/978-3-030-89716-1_4MaRDI QIDQ2695487zbMATH OpenOpenAlexFDO

Authors Georg Zetzsche

Publication date 31 March 2023

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/978-3-030-89716-1_4

Mathematics Subject Classification ID

Theory of computing (68Qxx)

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

• scientific article; zbMATH DE number 3725728 (Why is no real title available?)
• scientific article; zbMATH DE number 3746442 (Why is no real title available?)
• scientific article; zbMATH DE number 1223710 (Why is no real title available?)
• scientific article; zbMATH DE number 1500528 (Why is no real title available?)
• scientific article; zbMATH DE number 3238653 (Why is no real title available?)
• A lower bound for the coverability problem in acyclic pushdown VAS
• Bounded context switching for valence systems
• Extended finite automata over groups
• Finite automata with multiplication
• First-order logic with reachability for infinite-state systems
• Formal Languages and Groups as Memory
• Higher-order model checking: an overview
• Integer vector addition systems with states
• Linear Arithmetic with Stars
• On the coverability problem for pushdown vector addition systems in one dimension
• On the rational subset problem for groups.
• Reachability of scope-bounded multistack pushdown systems
• Remarks on blind and partially blind one-way multicounter machines
• Reversal-Bounded Multicounter Machines and Their Decision Problems
• Scope-Bounded Reachability in Valence Systems
• Semilinearity and Context-Freeness of Languages Accepted by Valence Automata
• Sequential grammars and automata with valences
• Silent transitions in automata with storage
• The emptiness problem for valence automata over graph monoids
• The reachability problem for Petri nets is not elementary
• The submonoid and rational subset membership problems for graph groups.
• Tools and Algorithms for the Construction and Analysis of Systems
• Undecidable problems in unreliable computations.

Cited in

(5)

• Bounded context switching for valence systems
• 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

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)