Barbuti, Roberto; Tesei, Luca A decidable notion of timed non-interference. (English) Zbl 1111.68497 Fundam. Inform. 54, No. 2-3, 137-150 (2003). Summary: We present a notion of non-interference which embodies the notion of time. It is useful to verify the strength of a system against attacks depending on the frequency of certain actions. In particular we give a decidable definition of non-interference which can be checked by using existing verification tools. We show an application example of our notion of non-interference by defining a variant of the classical Fischer’s mutual exclusion protocol and by analyzing its strength against attacks. Cited in 2 Documents MSC: 68Q60 Specification and verification (program logics, model checking, etc.) 68Q85 Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) 68M12 Network protocols 94A60 Cryptography 68P25 Data encryption (aspects in computer science) Keywords:Fischer’s mutual exclusion protocol PDFBibTeX XMLCite \textit{R. Barbuti} and \textit{L. Tesei}, Fundam. Inform. 54, No. 2--3, 137--150 (2003; Zbl 1111.68497)