Sciweavers

Share
IJFCS
2008

Decidability and Complexity Analysis of Forbidden State Problems for Discrete Event Systems

12 years 1 months ago
Decidability and Complexity Analysis of Forbidden State Problems for Discrete Event Systems
The conventional forbidden state problem for discrete event systems is concerned with the issue of synthesizing a maximally permissive control policy to prevent a discrete event system from reaching any forbidden state during the course of its computation. In this paper, we regard the forbidden state problem as a decision problem, and investigate the decidability/complexity issue of the problem under two new types of control policies, namely, non-blocking and fair policies, for finite state systems and Petri nets.
Hsu-Chun Yen
Added 12 Dec 2010
Updated 12 Dec 2010
Type Journal
Year 2008
Where IJFCS
Authors Hsu-Chun Yen
Comments (0)
books