Through Modeling to Synthesis of Security Automata

We define a set of process algebra operators, that we call controller operators, able to mimic the behavior of security automata introduced by Schneider in [17] and by Ligatti and al. in [3]. Security automata are mechanisms for enforcing security policies that specify acceptable executions of programs. Here we give the semantics of four controllers that act by monitoring possible un-trusted component of a system in order to enforce certain security policies. Moreover, exploiting satisfiability results for temporal logic, we show how to automatically build these controllers for a given security policy.