Channel Synthesis Revisited

Béatrice Bérard 1 Olivier Carton
1 MoVe - Modélisation et Vérification
LIP6 - Laboratoire d'Informatique de Paris 6
Abstract : 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.
Type de document :
Communication dans un congrès
8th International Conference on Languages and Automata Theory and Applications -- LATA, Mar 2014, Madrid, Spain. Springer International Publishing, 8370, pp.149-160, Lecture Notes in Computer Science. 〈10.1007/978-3-319-04921-2_12〉
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01215226
Contributeur : Lip6 Publications <>
Soumis le : mardi 13 octobre 2015 - 17:17:16
Dernière modification le : jeudi 22 novembre 2018 - 15:05:11

Identifiants

Collections

Citation

Béatrice Bérard, Olivier Carton. Channel Synthesis Revisited. 8th International Conference on Languages and Automata Theory and Applications -- LATA, Mar 2014, Madrid, Spain. Springer International Publishing, 8370, pp.149-160, Lecture Notes in Computer Science. 〈10.1007/978-3-319-04921-2_12〉. 〈hal-01215226〉

Partager

Métriques

Consultations de la notice

56