{'fraction_non_alphanumeric': 0.015759312320916905, 'fraction_numerical': 0.0, 'mean_word_length': 5.241071428571429, '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}}
Event scheduling of timed automata using Dioid Algebra

Timed automata are common and proper models, describing time evolution of nonlinear hybrid systems, especially in fault diagnosis applications. Due to asynchronous occurrence of events in event driven systems, computing and predicting timed events is a main and challenging problem. For solving this problem, a new analytical method is introduced in this paper based on Dioid Algebra. A linear model is presented for generating event scheduling table of timed automata from a given initial event. All time-event execution paths are predicted easily using the event scheduling table. The proposed algorithm is illustrated by a typical example.