The dark side of timed opacity

Franck Cassez*

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference proceeding contributionpeer-review

25 Citations (Scopus)


In this paper we extend the notion of opacity, defined for discrete-event systems, to dense-time systems. We define the timed opacity problem for timed automata and study its algorithmic status. We show that for the very restrictive class of Event Recording Timed Automata, the opacity problem is already undecidable leaving no hope for an algorithmic solution to the opacity problem in dense-time.

Original languageEnglish
Title of host publicationAdvances in information security and assurance
Subtitle of host publicationThird International Conference and Workshops, ISA 2009, Seoul, Korea, June 25-27, 2009, proceedings
EditorsJong Hyuk Park, Hsiao-Hwa Chen, Mohammed Atiquzzaman, Changhoon Lee, Tai-hoon Kim, Sang-Soo Yeo
Place of PublicationBerlin
PublisherSpringer, Springer Nature
Number of pages10
ISBN (Print)3642026168, 9783642026164
Publication statusPublished - 2009
Externally publishedYes
Event3rd International Conference on Information Security and Assurance, ISA 2009 - Seoul, Korea, Republic of
Duration: 25 Jun 200927 Jun 2009

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5576 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349


Other3rd International Conference on Information Security and Assurance, ISA 2009
CountryKorea, Republic of


Dive into the research topics of 'The dark side of timed opacity'. Together they form a unique fingerprint.

Cite this