{'fraction_non_alphanumeric': 0.022613065326633167, 'fraction_numerical': 0.0, 'mean_word_length': 5.2265625, '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}}
Formal Modeling of Sequential Function Charts With Time Petri Nets

Sequential function charts (SFCs) are among the standard languages for programmable logic controllers (PLCs) ubiquitous in automated manufacturing and production systems. While SFCs are quite user friendly to developers, it is not easy to guarantee the correctness of safety-critical SFC programs. Thus, methods and tools for verifying the correctness of SFC programs are highly desirable. Here we introduce a transformation technique that converts a significant subset of an SFC to a time Petri net (TPN). Thanks to a large body of literature and mature tools that can analyze TPNs, our technique will bridge the gap between a user-friendly manufacturing control programming tool, the SFC, and powerful analysis tools for TPNs.