论文信息 - A Formula for the Supremal Controllable and Opaque Sublanguage Arising in Supervisory Control - 字舞流文

A Formula for the Supremal Controllable and Opaque Sublanguage Arising in Supervisory Control

Shigemasa Takai | Yusuke Oka

[1] P. Ramadge,et al. Supervisory control of a class of discrete event processes , 1987 .

[2] John Rushby,et al. Noninterference, Transitivity, and Channel-Control Security Policies 1 , 2005 .

[3] P. Ramadge,et al. On the supermal controllable sublanguage of a given language , 1987 .

[4] Walter Murray Wonham,et al. On observability of discrete-event systems , 1988, Inf. Sci..

[5] Christoforos N. Hadjicostis,et al. Notions of security and opacity in discrete event systems , 2007, 2007 46th IEEE Conference on Decision and Control.

[6] R. D. Brandt,et al. Formulas for calculating supremal controllable and normal sublanguages , 1990 .

[7] Benoît Caillaud,et al. Concurrent Secrets , 2007, 2006 8th International Workshop on Discrete Event Systems.

[8] Nejib Ben Hadj-Alouane,et al. On the verification of intransitive noninterference in mulitlevel security , 2005, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[9] C. Desclaux,et al. Supervisory control of discrete-event processes with partial observations , 1988 .

[10] S. Marcus,et al. On controllability and normality of discrete event dynamical systems , 1991 .

[11] Maciej Koutny,et al. Modelling Opacity Using Petri Nets , 2005, WISP@ICATPN.