{'fraction_non_alphanumeric': 0.023010546500479387, 'fraction_numerical': 0.0, 'mean_word_length': 5.484472049689441, '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}}
A Petri Nets Modeling of Scheduling Policies in Ethernet Switch

Since their integration in a vast range of applications, including advanced manufacturing plants, advanced communication, smart power grids and transportation networks, Networked control systems (NCS) became an interesting subject of many studies. NCS is a set of entities communicating and exchanging data via a network, which makes its analysis and synthesis complex. To solve this problem, Petri nets and their modeling potential are used for modeling manufacturing plants as discrete event systems. This powerful method of modeling based on Colored Petri nets (CPN) able to provide a very compact way and a well-adapted and progressive framework for modeling and analysis complex systems in which competition, synchronization, resource sharing and parallelism are present. Our work concerns facilitating the practical use of CPN for designing of network. A model for the Ethernet switch with two scheduling policies (Static Priority, Weighted Round Robin (WRR)) is proposed.