{'fraction_non_alphanumeric': 0.015748031496062992, 'fraction_numerical': 0.0, 'mean_word_length': 5.6347826086956525, '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}}
Implementation of supervisory control using extended finite-state machines

This article aims at bridging the gap between traditional designs to discrete-event control problems and supervisory control theory of Ramadge and Wonham. We propose to implement supervisory control by extending the plant's finite state machine with Boolean variables, guard formulas and updating functions. Boolean variables are used to encode the supervisor's states, event observation is captured by a set of Boolean functions that update the value of variables, and control is introduced by guarding events with Boolean formulas. The framework developed in this work is fundamental in our ongoing research on communication between supervisors in a distributed discrete-event system.