ON YEN'S PATH LOGIC FOR PETRI NETS
Volume: 22, Issue: 04, Pages: 783 - 799
Published: Jun 1, 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...
Paper Details
Title
ON YEN'S PATH LOGIC FOR PETRI NETS
Published Date
Jun 1, 2011
Volume
22
Issue
04
Pages
783 - 799
Citation AnalysisPro
You’ll need to upgrade your plan to Pro
Looking to understand the true influence of a researcher’s work across journals & affiliations?
- Scinapse’s Top 10 Citation Journals & Affiliations graph reveals the quality and authenticity of citations received by a paper.
- Discover whether citations have been inflated due to self-citations, or if citations include institutional bias.
Notes
History