{'fraction_non_alphanumeric': 0.017964071856287425, 'fraction_numerical': 0.0, 'mean_word_length': 5.634920634920635, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Fusing Dataflow with Finite State Machines

The dataflow model of computation has been used extensively in signal processing design, and is particularly convenient for numeric-intensive computation of applications. Finite state machines (FSMs) have been developed to solve a different class of problems, namely sequential control. In this project, we propose to hierarchically nest the dataflow and FSM models of computation. With the two models mixed, concurrency and hierarchy are naturally supported in a manner similar to hierarchical FSMs, like Statecharts. This provides a clean and simple mechanism for describing systems that combine sophisticated signal processing with sophisticated control. We implement the ideas in the Ptolemy software environment, which has been under development at University of California at Berkeley.