Decidability of reachability IH vector addition systems perliminary version

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 1982, Pages 267-281

  Rao Kosaraju, S ^a  

^a JOHNS HOPKINS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTABILITY AND DECIDABILITY; VECTORS;

REACHABILITY; TREE CONSTRUCTION; VECTOR ADDITION SYSTEMS;

PETRI NETS;

EID: 85051533358     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/800070.802201     Document Type: Conference Paper

References (7)

1. Ginsburg, S.: The Mathematical Theory of Context-Free Languages, McGraw Hill Book Co., New York, 1966.
2. Harary, F.: Graph Theory, Addison-Wesley Publishing Co., Reading, Mass., 1972.
3. Hopcroft, J. and Pansiot, J.: On the reachability problem for 5-dimensional vector addition systems, Theoretical Computer Science, 135-159, 1979.
4. Mayr, E. W.: An algorithm for the general Petri Net Reachability Problem, Proc. of the 13th Annual ACM Symp. on Theory of Computing, 238-246, 1981.
5. Sacerdote, G. S. and Tenney, R. L.: The decidability of the reachability problem for vector addition systems, Proc. of the 9th Annual ACM Symp. on Theory of Computing, 61-76, 1977.
6. Sacerdote, G. S. and Tenney, R. L.: Vector Addition Systems, Tech. Report, October 1977.
7. Van Leeuwen, J.: A partial solution to the reachability problem for vector-addition systems, Proc. of the 6th Annual ACM Symp. on Theory of Computing, 303-307, 1974.