Checking visual data flow programs with finite process models

A visual data flow language (VDFL) allows graphical presentation of a computer program in the form of a directed graph, where data tokens travel through the arcs of the graph, and the vertices present e.g. the input token streams, calculations, comparisons, and conditionals. Amongst their benefits, VDFLs allow parallel computing and they are presumed to improve the quality of programming due to their intuitive readability. Thus, they are also suitable for computing education. However, the token-based computational model allowing parallel processing may make the programs more complicated than what they look. We propose a method for checking properties of VDFL programs using finite state processes (FSPs) using a commonly available labelled transition system analyser (LTSA) tool. The method can also be used to study different VDFL programming constructs for development or re-design of VDFLs. For our method, we have implemented a compiler that compiles a textual representation of a VDFL into FSPs.