The Dark Side of Timed Opacity

Authors:
Franck Cassez
Affiliations:
National ICT Australia & CNRS, The University of New South Wales, Sydney, Australia
Venue:
ISA '09 Proceedings of the 3rd International Conference and Workshops on Advances in Information Security and Assurance
Year:
2009

Citing 7
Cited 0

A theory of timed automata

Theoretical Computer Science
Characterization of the expressive power of silent transitions in timed automata

Fundamenta Informaticae
Classification of Security Properties (Part I: Information Flow)

FOSAD '00 Revised versions of lectures given during the IFIP WG 1.7 International School on Foundations of Security Analysis and Design on Foundations of Security Analysis and Design: Tutorial Lectures
Automata For Modeling Real-Time Systems

ICALP '90 Proceedings of the 17th International Colloquium on Automata, Languages and Programming
A Determinizable Class of Timed Automata

CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
Non-Interference Control Synthesis for Security Timed Automata

Electronic Notes in Theoretical Computer Science (ENTCS)
Opacity generalised to transition systems

FAST'05 Proceedings of the Third international conference on Formal Aspects in Security and Trust

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.