Problems Concerning Fairness and Temporal Logic for Conflict-Free Petri Nets

@article{Howell1989ProblemsCF,
  title={Problems Concerning Fairness and Temporal Logic for Conflict-Free Petri Nets},
  author={Rodney R. Howell and Louis E. Rosier},
  journal={Theor. Comput. Sci.},
  year={1989},
  volume={64},
  pages={305-329}
}
In this paper, we examine the complexity of the fair nontermination problem for conflict-free Petri nets under several definitions of fairness. For each definition of fairness, we are able to show the problem to be complete for either NP, PTIME, or NLOGSPACE. We then address the question of whether these results extend to the more general model checking problem with respect to the temporal logic for Petri nets introduced by Suzuki. Since many of the model checking problems concerning finite… CONTINUE READING

Similar Papers

Loading similar papers…