Systematic translation of VLC decoding trees to processes

The synchronization mechanism of variable length codes (VLC) is often understood using encoding/decoding trees. In an earlier paper, we presented a novel application of communicating sequential processes (CSP) to the modelling of VLC synchronization. That provided a very precise description of the synchronization mechanisms. Underpinned by strong mathematical principle, CSP is a process algebra for describing the patterns of communication and interaction between agents that interact via explicit message passing. This paper presents a systematic translation from VLC encoding/decoding trees to processes to ensure the scalability and applicability of the CSP approach of modelling in this context. The proposed translation algorithm is based on an application of automata theory.