{'fraction_non_alphanumeric': 0.014605647517039922, 'fraction_numerical': 0.0, 'mean_word_length': 5.385093167701863, '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}}
Translating CSP Specifications to Equivalent Petri Nets

With the generalized use of multi-core processors, concurrent languages are becoming more and more important, and companies invest many resources in the design of more expressive concurrent languages that can be automatically verified to ensure the final quality of the developed systems. In this paper we propose a technique that allows us to use two of the most extended models of concurrency, CSP and Petri nets, with a single specification. Both models have been successfully used in the industry and there are many verification, simulation and analysis techniques for them. While CSP is very expressive and many techniques devoted to verify CSP specifications exist, Petri nets are specially interesting for simulation because they allow us to graphically animate specifications step by step. In this work, we formally define a fully automatic transformation that translates a CSP specification into an equivalent Petri net, very similar (structurally) to the given