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.
Document type :
Conference papers
Liste complète des métadonnées
Contributor : Lip6 Publications <>
Submitted on : Tuesday, October 13, 2015 - 5:17:16 PM
Last modification on : Thursday, March 21, 2019 - 12:59:06 PM



Béatrice Bérard, Olivier Carton. Channel Synthesis Revisited. 8th International Conference on Languages and Automata Theory and Applications -- LATA, Mar 2014, Madrid, Spain. pp.149-160, ⟨10.1007/978-3-319-04921-2_12⟩. ⟨hal-01215226⟩



Record views