IEICE TRANSACTIONS on Fundamentals
Supervisory Control of a Class of Concurrent Discrete Event Systems
Summary :
In this paper, we study supervisory control of a class of discrete event systems with simultaneous event occurrences, which we call concurrent discrete event systems. The behavior of the system is described by a language over the simultaneous event set. We introduce a notion of concurrent well-posedness of languages. We then prove that Lm(G)-closure, controllability, and concurrent well-posedness of a specification language are necessary and sufficient conditions for the existence of a nonblocking supervisor. We address the computational complexity for verifying the existence conditions.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E87-A No.4 pp.850-855
- Publication Date
- 2004/04/01
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Special Section PAPER (Special Section on Selected Papers from the 16th Workshop on Circuits and Systems in Karuizawa)
- Category
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Shigemasa TAKAI, Toshimitsu USHIO, "Supervisory Control of a Class of Concurrent Discrete Event Systems" in IEICE TRANSACTIONS on Fundamentals,
vol. E87-A, no. 4, pp. 850-855, April 2004, doi: .
Abstract: In this paper, we study supervisory control of a class of discrete event systems with simultaneous event occurrences, which we call concurrent discrete event systems. The behavior of the system is described by a language over the simultaneous event set. We introduce a notion of concurrent well-posedness of languages. We then prove that Lm(G)-closure, controllability, and concurrent well-posedness of a specification language are necessary and sufficient conditions for the existence of a nonblocking supervisor. We address the computational complexity for verifying the existence conditions.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e87-a_4_850/_p
Copy
@ARTICLE{e87-a_4_850,
author={Shigemasa TAKAI, Toshimitsu USHIO, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Supervisory Control of a Class of Concurrent Discrete Event Systems},
year={2004},
volume={E87-A},
number={4},
pages={850-855},
abstract={In this paper, we study supervisory control of a class of discrete event systems with simultaneous event occurrences, which we call concurrent discrete event systems. The behavior of the system is described by a language over the simultaneous event set. We introduce a notion of concurrent well-posedness of languages. We then prove that Lm(G)-closure, controllability, and concurrent well-posedness of a specification language are necessary and sufficient conditions for the existence of a nonblocking supervisor. We address the computational complexity for verifying the existence conditions.},
keywords={},
doi={},
ISSN={},
month={April},}
Copy
TY - JOUR
TI - Supervisory Control of a Class of Concurrent Discrete Event Systems
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 850
EP - 855
AU - Shigemasa TAKAI
AU - Toshimitsu USHIO
PY - 2004
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E87-A
IS - 4
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - April 2004
AB - In this paper, we study supervisory control of a class of discrete event systems with simultaneous event occurrences, which we call concurrent discrete event systems. The behavior of the system is described by a language over the simultaneous event set. We introduce a notion of concurrent well-posedness of languages. We then prove that Lm(G)-closure, controllability, and concurrent well-posedness of a specification language are necessary and sufficient conditions for the existence of a nonblocking supervisor. We address the computational complexity for verifying the existence conditions.
ER -
English
