DocumentCode
2529646
Title
A primitive recursive algorithm for the general Petri net reachability problem
Author
Bouziane, Zakariae
Author_Institution
IRISA, Rennes, France
fYear
1998
fDate
8-11 Nov 1998
Firstpage
130
Lastpage
136
Abstract
E. Mayr and R. Kosaraju (1981) proved the decidability of the general Petri net reachability problem. However their algorithms are non primitive recursive. Since then the primitive recursiveness of this problem was stated as an open problem. In this paper we give a double exponential space algorithm for the general Petri net reachability problem
Keywords
Petri nets; decidability; decidability; double exponential space algorithm; general Petri net reachability problem; primitive recursive algorithm; Algebra; Automata; Computational modeling; Concurrent computing; Equations; Petri nets; Polynomials; System recovery; Turing machines;
fLanguage
English
Publisher
ieee
Conference_Titel
Foundations of Computer Science, 1998. Proceedings. 39th Annual Symposium on
Conference_Location
Palo Alto, CA
ISSN
0272-5428
Print_ISBN
0-8186-9172-7
Type
conf
DOI
10.1109/SFCS.1998.743436
Filename
743436
Link To Document