On the Complexity of Containment, Equivalence, and Reachability for Finite and 2-Dimensional Vector Addition Systems with States.

For the most recent entries see the Petri Nets Newsletter.

On the Complexity of Containment, Equivalence, and Reachability for Finite and 2-Dimensional Vector Addition Systems with States.

Howell, R.R.; Huynh, D.T.; Rosier, L.E.; Yen, Hsu-Chun

In: Brandenburg, F.J.; Vidal-Naquet, G.; Wirsing, M.: Lecture Notes in Computer Science, Vol. 247: 4th Annual Symposion on Theoretical Aspects of Computer Science, Passau, pages 360-370. Springer-Verlag, 1987.

Also: University of Texas, Austin, Technical Report No. 87--0007, 1987.

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

Back to the Petri Nets Bibliography