Absolute controllability of predicates in discrete event systems
From MaRDI portal
Publication:4841432
DOI10.1080/00207729508929078zbMath0868.93009OpenAlexW1973968372WikidataQ126249799 ScholiaQ126249799MaRDI QIDQ4841432
Publication date: 11 August 1997
Published in: International Journal of Systems Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207729508929078
Applications of graph theory (05C90) Controllability (93B05) Formal languages and automata (68Q45) General systems (93A10)
Cites Work
- Unnamed Item
- Controllability and control-invariance in discrete-event systems
- The infimal closed controllable superlanguage and its application in supervisory control
- Supervisory Control of a Class of Discrete Event Processes
- Performance evaluation and perturbation analysis of discrete event dynamic systems
- Supervisor specification and synthesis for discrete event systems
- Decentralized control and coordination of discrete-event systems with partial observation
- Decidability for a temporal logic used in discrete-event system analysis
This page was built for publication: Absolute controllability of predicates in discrete event systems