Howell, Rodney R.Rodney R.HowellRosier, Louis E.Louis E.RosierYen, Hsu-ChunHsu-ChunYen2009-03-042018-07-062009-03-042018-07-061991http://ntur.lib.ntu.edu.tw//handle/246246/142306https://www.scopus.com/inward/record.uri?eid=2-s2.0-0026157628&doi=10.1016%2f0304-3975%2891%2990228-T&partnerID=40&md5=586b4dc8efc9933eb91821eb196b7393In this paper, we define a temporal logic for reasoning about Petri nets. We show the model checking problem for this logic to be PTIME equivalent to the Petri net reachability problem. Using this logic and two refinements, we show the fair nontermination problem to be PTIME equivalent to reachability for several definitions of fairness. For other versions of fairness, this problem is shown to be either PTIME equivalent to the boundedness problem or highly undecidable. In all, 24 versions of fairness are examined. © 1991.application/pdf3561779 bytesapplication/pdfen-USAutomata Theory - Computability and Decidability; Mathematical Techniques - Petri Nets; Fairness; Nontermination; PTIME Equivalence; Temporal Logic; Computer Metatheoryjournal article10.1016/0304-3975(91)90228-T2-s2.0-0026157628http://ntur.lib.ntu.edu.tw/bitstream/246246/142306/1/04.pdf