On computation complexity of the concurrently enabled transition set problem

  • Authors:

  • Li Pan;Weidong Zhao;Zhicheng Wang;Gang Wei;Shumei Wang

  • Affiliations:

  • Tongji University, Shanghai, China and CAD Research Center;Tongji University, Shanghai, China and CAD Research Center;Tongji University, Shanghai, China and CAD Research Center;Tongji University, Shanghai, China and CAD Research Center;Tongji University, Shanghai, China and CAD Research Center

  • Venue:
  • TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we propose a new decision problem, called the concurrently enabled transition set problem, which is proved to be NP-complete by reduction from the independent set problem. Then, we present a polynomial-time algorithm for the maximal concurrently enabled transition set problem, and prove that some special subproblems are in P by the proposed algorithm.