scientific article; zbMATH DE number 7147444

zbMath1427.68203arXiv1904.04090MaRDI QIDQ5207052

Grégoire Sutre, Jérôme Leroux, M. Praveen, Philippe Schnoebelen

Publication date: 3 January 2020

Full work available at URL: https://arxiv.org/abs/1904.04090

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

Petri netspumping lemmafast-growing functionspushdown vector addition systemsweak computation

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (1)

Unboundedness problems for machines with reversal-bounded counters

Cites Work

• Unnamed Item
• Decidability of a temporal logic problem for Petri nets
• The equality problem for vector addition systems is undecidable
• Remarks on blind and partially blind one-way multicounter machines
• On boundedness problems for pushdown vector addition systems
• What makes Petri nets harder to verify: stack or data?
• Verifying lossy channel systems has nonprimitive recursive complexity.
• Process rewrite systems.
• Algorithmic analysis of programs with well quasi-ordered domains.
• The covering and boundedness problems for branching vector addition systems
• Recursive Petri nets
• Semigroups, Presburger formulas, and languages
• Complexity Hierarchies beyond Elementary
• Analysis of recursively parallel programs
• The Ordinal-Recursive Complexity of Timed-arc Petri Nets, Data Nets, and Other Enriched Nets
• On Functions Weakly Computable by Petri Nets and Vector Addition Systems
• On the Coverability Problem for Pushdown Vector Addition Systems in One Dimension
• Mixing Lossy and Perfect Fifo Channels
• Revisiting Ackermann-Hardness for Lossy Counter Machines and Reset Petri Nets
• The Complexity of the Finite Containment Problem for Petri Nets
• Hyper-Ackermannian bounds for pushdown vector addition systems
• Reachability in Petri Nets with Inhibitor Arcs
• The reachability problem for Petri nets is not elementary
• Reasoning about Data Repetitions with Counter Systems
• Vector addition system reachability problem
• Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture
• Model Checking Multithreaded Programs with Asynchronous Atomic Methods
• The Power of Priority Channel Systems
• Nonprimitive recursive complexity and undecidability for Petri net equivalences
• Well-structured transition systems everywhere!

This page was built for publication: