Completeness Results for Reachability, Containment, and Equivalence, with Respect to Conflict-free Vector Replacement Systems.

For the most recent entries see the Petri Nets Newsletter.

Completeness Results for Reachability, Containment, and Equivalence, with Respect to Conflict-free Vector Replacement Systems.

In: Ottmann, T.(ed.): Lecture Notes in Computer Science, Vol. 267: Automata, Languages and Programming, pages 509-520. Springer Verlag, 1987.

Abstract: In this paper, completeness results are given for the reachabiblty, containmment, and equivalence problems for conflict-free vector replacement systems. An NP algorithm is given for deciding reachability.

Do you need a refined search? Try our search engine which allows complex field-based queries.

Back to the Petri Nets Bibliography