Supervisory control for modal specifications of services

Abstract In the service oriented architecture framework, a modal specification, as defined by Larsen in [5], formalises how a service should interact with its environment. More precisely, a modal specification determines the events that the server may or must allow at each stage in an interactive session. In this paper, we investigate the adaptation of the supervisory control theory of Ramadge and Wonham to enforce a modal specification (with final states marking the ends of the sessions) on a system modelled by a finite LTS. We prove that there exists at most one most permissive solution to this control problem. We also prove that this solution is regular and we present an algorithm for the effective computation of the corresponding controller.

[1]  Shigemasa Takai,et al.  A Formula for the Supremal Controllable and Opaque Sublanguage Arising in Supervisory Control , 2008 .

[2]  Kim G. Larsen,et al.  Modal Specifications , 1989, Automatic Verification Methods for Finite State Systems.

[3]  Matthew Hennessy,et al.  Acceptance trees , 1985, JACM.

[4]  Niels Lohmann,et al.  Operating Guidelines for Finite-State Services , 2007, ICATPN.

[5]  Joseph Sifakis,et al.  Automatic Verification Methods for Finite State Systems , 1989, Lecture Notes in Computer Science.

[6]  Sophie Pinchinat,et al.  Modal Specifications for the Control Theory of Discrete Event Systems , 2007, Discret. Event Dyn. Syst..

[7]  Kim G. Larsen,et al.  The Use of Static Constructs in A Modal Process Logic , 1989, Logic at Botik.

[8]  Jean-Baptiste Raclet,et al.  Residual for Component Specifications , 2008, Electron. Notes Theor. Comput. Sci..

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

[10]  Philippe Darondeau,et al.  Supervisory Control for Opacity , 2010, IEEE Transactions on Automatic Control.

[11]  Christoforos N. Hadjicostis,et al.  Opacity-enforcing supervisory strategies for secure discrete event systems , 2008, 2008 47th IEEE Conference on Decision and Control.

[12]  P. Darondeau,et al.  Opacity enforcing control synthesis , 2008, 2008 9th International Workshop on Discrete Event Systems.

[13]  W. M. Wonham,et al.  Supervision of Infinite Behavior of Discrete-Event Systems , 1994 .

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

[15]  Maciej Koutny,et al.  Opacity generalised to transition systems , 2005, International Journal of Information Security.

[16]  Niels Lohmann,et al.  Petrifying Operating Guidelines for Services , 2009, 2009 Ninth International Conference on Application of Concurrency to System Design.

[17]  Maciej Koutny,et al.  Opacity Generalized to Transition Systems , 2007 .

[18]  Shigemasa Takai,et al.  Verification and synthesis for secrecy in discrete-event systems , 2009, 2009 American Control Conference.

[19]  Shengbing Jiang,et al.  2080 SHENGBING JIANG AND RATNESH KUMAR , 2006 .

[20]  W. M. Wonham,et al.  The control of discrete event systems , 1989 .