In this paper, we study opacity-enforcing supervisory control of discrete event systems. We consider the case that the secrete behavior of the system is specified by multiple secret languages, and synthesize a maximally permissive supervisor that enforces opacity for all secret languages. We prove that, under a certain assumption on observable and uncontrollable events, a maximally permissive opacity-enforcing supervisor can be synthesized in a modular fashion.
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.
Copy
Shigemasa TAKAI, Yuta WATANABE, "Modular Synthesis of Maximally Permissive Opacity-Enforcing Supervisors for Discrete Event Systems" in IEICE TRANSACTIONS on Fundamentals,
vol. E94-A, no. 3, pp. 1041-1044, March 2011, doi: 10.1587/transfun.E94.A.1041.
Abstract: In this paper, we study opacity-enforcing supervisory control of discrete event systems. We consider the case that the secrete behavior of the system is specified by multiple secret languages, and synthesize a maximally permissive supervisor that enforces opacity for all secret languages. We prove that, under a certain assumption on observable and uncontrollable events, a maximally permissive opacity-enforcing supervisor can be synthesized in a modular fashion.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E94.A.1041/_p
Copy
@ARTICLE{e94-a_3_1041,
author={Shigemasa TAKAI, Yuta WATANABE, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Modular Synthesis of Maximally Permissive Opacity-Enforcing Supervisors for Discrete Event Systems},
year={2011},
volume={E94-A},
number={3},
pages={1041-1044},
abstract={In this paper, we study opacity-enforcing supervisory control of discrete event systems. We consider the case that the secrete behavior of the system is specified by multiple secret languages, and synthesize a maximally permissive supervisor that enforces opacity for all secret languages. We prove that, under a certain assumption on observable and uncontrollable events, a maximally permissive opacity-enforcing supervisor can be synthesized in a modular fashion.},
keywords={},
doi={10.1587/transfun.E94.A.1041},
ISSN={1745-1337},
month={March},}
Copy
TY - JOUR
TI - Modular Synthesis of Maximally Permissive Opacity-Enforcing Supervisors for Discrete Event Systems
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1041
EP - 1044
AU - Shigemasa TAKAI
AU - Yuta WATANABE
PY - 2011
DO - 10.1587/transfun.E94.A.1041
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E94-A
IS - 3
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - March 2011
AB - In this paper, we study opacity-enforcing supervisory control of discrete event systems. We consider the case that the secrete behavior of the system is specified by multiple secret languages, and synthesize a maximally permissive supervisor that enforces opacity for all secret languages. We prove that, under a certain assumption on observable and uncontrollable events, a maximally permissive opacity-enforcing supervisor can be synthesized in a modular fashion.
ER -