Jump to : Download | Abstract | Contact | BibTex reference | EndNote reference |
Download paper Adobe portable document format (pdf)
Copyright noticeThis material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.
Given a finite transition system and a regular predicate, we address the problem of computing a controller enforcing the opacity of the predicate against an attacker (who partially observes the system), supposedly trying to push the system to reveal the predicate. Assuming that the controller can only control a subset of the events it observes (possibly different from the ones of the attacker), we show that an optimal control always exists and provide sufficient conditions under which it is regular and effectively computable. These conditions rely on the inclusion relationships between the controllable alphabet and the observable alphabets of the attacker and of the controller
Jérémy Dubreil
jeremy.dubreil@irisa.fr
Hervé Marchand
hmarchan@irisa.fr
@TechReport{PI-opacity,
Author = {Dubreil, J. and Darondeau, Ph. and Marchand, H.},
Title = {Opacity Enforcing Control Synthesis},
Number = {1887},
Institution = {IRISA},
Month = {March},
Year = {2008}
}
Get EndNote Reference (.ref)