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

DOI10.1142/S0129054108006091zbMath1155.93032OpenAlexW1971272734MaRDI QIDQ3526548

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

complexityfairnessPetri netsdecision problemdiscrete event systemsnon-blockingcontrol policiesfinite state systemsforbidden state problem

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• A taxonomy of fairness and temporal logic problems for Petri nets
• Complete problems for deterministic polynomial time

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