Channel Synthesis Revisited

  • Béatrice Bérard
  • Olivier Carton
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8370)


Given a system modeled by a rational relation R, a channel is a pair (E,D) of rational relations that respectively encode and decode binary messages, and such that the composition E R D is the identity relation. This means that the message between E and D has been perfectly transmitted through R. Investigating the links between channels and the growth of rational sets of words, we give new characterizations for relations with channels. In the particular case where the relation is given as a union of functions, we obtain as a consequence the decidability of the synthesis problem with a linear complexity.


Distributed synthesis channels rational relations transducers security 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Bérard, B., Benattar, G., Lime, D., Mullins, J., Roux, O.H., Sassolas, M.: Channel synthesis for finite transducers. In: Dömösi, P., I.S. (eds.) Proceedings of the 13th International Conference on Automata and Formal Languages (AFL 2011), pp. 79–92 (August 2011)Google Scholar
  2. 2.
    Benattar, G., Bérard, B., Lime, D., Mullins, J., Roux, O.H., Sassolas, M.: Channel Synthesis for Finite Transducers. International Journal of Foundations of Computer Science 23(6), 1241–1260 (2012)CrossRefzbMATHMathSciNetGoogle Scholar
  3. 3.
    Schewe, S., Finkbeiner, B.: Synthesis of asynchronous systems. In: Puebla, G. (ed.) LOPSTR 2006. LNCS, vol. 4407, pp. 127–142. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  4. 4.
    Millen, J.K.: 20 years of covert channel modeling and analysis. In: Proc. of the 1999 IEEE Symposium on Security and Privacy, pp. 113–114 (May 1999)Google Scholar
  5. 5.
    Hélouet, L., Zeitoun, M., Degorre, A.: Scenarios and Covert channels: another game. In: de Alfaro, L. (ed.) Proc. of Games in Design and Verification (GDV 2004). ENTCS, vol. 119, pp. 93–116. Elsevier (2005)Google Scholar
  6. 6.
    Hélouët, L., Roumy, A.: Covert channel detection using information theory. In: Chatzikokolakis, K., Cortier, V. (eds.) Proc. of the 8th Int. Workshop on Security Issues in Concurrency (SecCo 2010) (August 2010)Google Scholar
  7. 7.
    Maurer, A., Nivat, M.: Rational bijection of rational sets. Acta Inf. 13, 365–378 (1980)CrossRefzbMATHMathSciNetGoogle Scholar
  8. 8.
    Benattar, G.: Synthèse de systèmes informatiques temporisés non interférents. PhD thesis, Université de Nantes (2011)Google Scholar
  9. 9.
    Lothaire, M.: Combinatorics on words. Encyclopedia of Mathematics, vol. 17. Addison-Wesley, Reading (1983)zbMATHGoogle Scholar
  10. 10.
    Sakarovitch, J.: Elements of automata theory. Cambridge University Press (2009)Google Scholar
  11. 11.
    Elgot, C.C., Mezei, J.E.: On relations defined by generalized finite automata. IBM Journal Res. Develop. 9, 47–68 (1965)CrossRefzbMATHMathSciNetGoogle Scholar
  12. 12.
    Weber, A.: Decomposing a k-valued transducer into k unambiguous ones. RAIRO Theoretical Informatics and Applications 30(5), 379–413 (1996)zbMATHGoogle Scholar
  13. 13.
    Sakarovitch, J., de Souza, R.: On the decomposition of k-valued rational relations. In: Albers, S., Weil, P. (eds.) Proceedings of the 25th Symposium on Theoretical Aspects of Computer Science (STACS 2008), pp. 621–632 (2008)Google Scholar
  14. 14.
    Harrison, M.A.: Introduction to formal language theory. Addison-Wesley (1978)Google Scholar
  15. 15.
    Bérard, B., Carton, O.: Channel synthesis revisited. Technical report, LIP6 (2013),

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • Béatrice Bérard
    • 1
  • Olivier Carton
    • 2
  1. 1.LIP6/MoVe, CNRS UMR 7606Université Pierre & Marie CurieParis Cedex 05France
  2. 2.LIAFA, CNRS UMR 7089Université Paris DiderotParis Cedex 13France

Personalised recommendations