@inproceedings{DBLP:conf/formats/BenattarCLR09,
  author    = {Gilles Benattar and
               Franck Cassez and
               Didier Lime and
               Olivier H. Roux},
  title     = {Synthesis of Non-Interferent Timed Systems},
  booktitle = {Formal Modeling and Analysis of Timed Systems, 7th International Conference,
               {FORMATS} 2009, Budapest, Hungary, September 14-16, 2009. Proceedings},
  pages     = {28--42},
  year      = {2009},
  series    = {Lecture Notes in Computer Science},
  volume    = {5813},
  publisher = {Springer},
  url       = {http://dx.doi.org/10.1007/978-3-642-04368-0_5},
  doi       = {10.1007/978-3-642-04368-0_5},
  urlpaper = {papers/formats-09.pdf},
  urlslides = {papers/slides-formats-09.pdf},
   ABSTRACT = {  In this paper, we focus on the synthesis of secure timed systems
  which are given by timed automata.
  The security property that the system must satisfy is a
  \emph{non-interference} property.
  Various notions of non-interference have been defined in the
  literature, and in this paper we focus on \emph{Strong
    Non-deterministic Non-Interference} (SNNI)
  and we study the two following problems: ($1$) check whether it is
  possible to enforce a system to be SNNI; if yes ($2$) compute a
  sub-system which is SNNI.},
        Type = {B - International Conferences},

  keywords = {security, timed automata}
}

{"_id":"afb27r7Dhso7hFNQH","bibbaseid":"benattar-cassez-lime-roux-synthesisofnoninterferenttimedsystems-2009","author_short":["Benattar, G.","Cassez, F.","Lime, D.","Roux, O. H."],"bibdata":{"bibtype":"inproceedings","type":"B - International Conferences","author":[{"firstnames":["Gilles"],"propositions":[],"lastnames":["Benattar"],"suffixes":[]},{"firstnames":["Franck"],"propositions":[],"lastnames":["Cassez"],"suffixes":[]},{"firstnames":["Didier"],"propositions":[],"lastnames":["Lime"],"suffixes":[]},{"firstnames":["Olivier","H."],"propositions":[],"lastnames":["Roux"],"suffixes":[]}],"title":"Synthesis of Non-Interferent Timed Systems","booktitle":"Formal Modeling and Analysis of Timed Systems, 7th International Conference, FORMATS 2009, Budapest, Hungary, September 14-16, 2009. Proceedings","pages":"28–42","year":"2009","series":"Lecture Notes in Computer Science","volume":"5813","publisher":"Springer","url":"http://dx.doi.org/10.1007/978-3-642-04368-0_5","doi":"10.1007/978-3-642-04368-0_5","urlpaper":"papers/formats-09.pdf","urlslides":"papers/slides-formats-09.pdf","abstract":"In this paper, we focus on the synthesis of secure timed systems which are given by timed automata. The security property that the system must satisfy is a \\emphnon-interference property. Various notions of non-interference have been defined in the literature, and in this paper we focus on \\emphStrong Non-deterministic Non-Interference (SNNI) and we study the two following problems: ($1$) check whether it is possible to enforce a system to be SNNI; if yes ($2$) compute a sub-system which is SNNI.","keywords":"security, timed automata","bibtex":"@inproceedings{DBLP:conf/formats/BenattarCLR09,\n author = {Gilles Benattar and\n Franck Cassez and\n Didier Lime and\n Olivier H. Roux},\n title = {Synthesis of Non-Interferent Timed Systems},\n booktitle = {Formal Modeling and Analysis of Timed Systems, 7th International Conference,\n {FORMATS} 2009, Budapest, Hungary, September 14-16, 2009. Proceedings},\n pages = {28--42},\n year = {2009},\n series = {Lecture Notes in Computer Science},\n volume = {5813},\n publisher = {Springer},\n url = {http://dx.doi.org/10.1007/978-3-642-04368-0_5},\n doi = {10.1007/978-3-642-04368-0_5},\n urlpaper = {papers/formats-09.pdf},\n urlslides = {papers/slides-formats-09.pdf},\n ABSTRACT = { In this paper, we focus on the synthesis of secure timed systems\n which are given by timed automata.\n The security property that the system must satisfy is a\n \\emph{non-interference} property.\n Various notions of non-interference have been defined in the\n literature, and in this paper we focus on \\emph{Strong\n Non-deterministic Non-Interference} (SNNI)\n and we study the two following problems: ($1$) check whether it is\n possible to enforce a system to be SNNI; if yes ($2$) compute a\n sub-system which is SNNI.},\n Type = {B - International Conferences},\n\n keywords = {security, timed automata}\n}\n\n","author_short":["Benattar, G.","Cassez, F.","Lime, D.","Roux, O. H."],"key":"DBLP:conf/formats/BenattarCLR09","id":"DBLP:conf/formats/BenattarCLR09","bibbaseid":"benattar-cassez-lime-roux-synthesisofnoninterferenttimedsystems-2009","role":"author","urls":{"Paper":"http://science.mq.edu.au/~fcassez/bib/papers/formats-09.pdf","Slides":"http://science.mq.edu.au/~fcassez/bib/papers/slides-formats-09.pdf"},"keyword":["security","timed automata"],"metadata":{"authorlinks":{}}},"bibtype":"inproceedings","biburl":"http://science.mq.edu.au/~fcassez/bib/franck-bib.bib","dataSources":["8742EsvjQfyP2fYBW","yYF8uwWqay28JyxZC","qbqYFWskmoonRB43F"],"keywords":["security","timed automata"],"search_terms":["synthesis","non","interferent","timed","systems","benattar","cassez","lime","roux"],"title":"Synthesis of Non-Interferent Timed Systems","year":2009}