scientific article; zbMATH DE number 4024808

MaRDI QIDQ3766869zbMATH OpenFDO

Authors Rodney R. Howell, Louis E. Rosier

Publication date 1987

zbMATH Keywords

conflict-free vector replacement systemsNP algorithmreachability setsemilinear set

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Completeness results for conflict-free vector replacement systems
• scientific article; zbMATH DE number 4035164
• scientific article; zbMATH DE number 3878366
• An \(O(n^{1.5})\) algorithm to decide boundedness for conflict-free vector replacement systems
• Rewriting systems for reachability in vector addition systems with pairs
• Co-finiteness and co-emptiness of reachability sets in vector addition systems with states
• Co-finiteness and co-emptiness of reachability sets in vector addition systems with states
• scientific article; zbMATH DE number 4092784
• Demystifying Reachability in Vector Addition Systems
• The general vector addition system reachability problem by Presburger inductive invariants

Cited in

(3)

• An \(O(n^{1.5})\) algorithm to decide boundedness for conflict-free vector replacement systems
• Completeness results for conflict-free vector replacement systems
• scientific article; zbMATH DE number 4035164 (Why is no real title available?)

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 Q3766869)