DECIDABILITY AND COMPLEXITY ANALYSIS OF FORBIDDEN STATE PROBLEMS FOR DISCRETE EVENT SYSTEMS

DOI10.1142/S0129054108006091MaRDI QIDQ3526548zbMATH OpenOpenAlexFDO

Authors Hsu-Chun Yen

Publication date 25 September 2008

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0129054108006091

zbMATH Keywords

complexitycontrol policiesdecision problemdiscrete event systemsfairnessfinite state systemsforbidden state problemnon-blockingPetri nets

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Descriptive complexity and finite models (68Q19) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Discrete event control/observation systems (93C65)

Recommendations

• On forbidden state problems for a class of controlled Petri nets
• The computational complexity of decentralized discrete-event control problems
• Optimal Petri net supervisor synthesis for forbidden state problems using marking mask
• Supervisor synthesis for discrete event systems under partial observation and arbitrary forbidden state specifications
• A generalization of state avoidance policies for controlled Petri nets

Cites work

• A taxonomy of fairness and temporal logic problems for Petri nets
• Complete problems for deterministic polynomial time
• scientific article; zbMATH DE number 3722109 (Why is no real title available?)

This page was built for publication: DECIDABILITY AND COMPLEXITY ANALYSIS OF FORBIDDEN STATE PROBLEMS FOR DISCRETE EVENT SYSTEMS

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3526548)