scientific article

zbMATH Open0551.68048MaRDI QIDQ3343444

Martti Penttonen

Publication date: 1984

Title of this publication is not available (Why is that?)

zbMATH Keywords

Petri netsdecidabilityreachability problemcommutative monoidsemptiness problemvector addition systemsunordered scattered context grammarssemi-Thue problem

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Free semigroups, generators and relations, word problems (20M05) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Word problems, etc. in computability and recursion theory (03D40) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Related Items (8)

The Reachability Problem for Two-Dimensional Vector Addition Systems with States ⋮ Hyper-Ackermannian bounds for pushdown vector addition systems ⋮ Demystifying Reachability in Vector Addition Systems ⋮ Model Checking Coverability Graphs of Vector Addition Systems ⋮ Vector Addition System Reversible Reachability Problem ⋮ Title not available (Why is that?) ⋮ Expand, Enlarge, and Check for Branching Vector Addition Systems ⋮ Title not available (Why is that?)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3343444)