Back to Search
Start Over
ON YEN'S PATH LOGIC FOR PETRI NETS.
- Source :
-
International Journal of Foundations of Computer Science . Jun2011, Vol. 22 Issue 4, p783-799. 17p. 1 Diagram. - Publication Year :
- 2011
-
Abstract
- In [19], Yen defines a class of formulas for paths in Petri nets and claims that its satisfiability problem is EXPSPACE-complete. In this paper, we show that in fact the satisfiability problem for this class of formulas is as hard as the reachability problem for Petri nets. Moreover, we salvage almost all of Yen's results by defining a fragment of this class of formulas for which the satisfiability problem is EXPSPACE-complete by adapting his proof. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 01290541
- Volume :
- 22
- Issue :
- 4
- Database :
- Academic Search Index
- Journal :
- International Journal of Foundations of Computer Science
- Publication Type :
- Academic Journal
- Accession number :
- 61205971
- Full Text :
- https://doi.org/10.1142/S0129054111008428