Synthesis of Petri Nets Based on the Union/Find Procedure

点击翻译按钮获取中文摘要

The synthesis problem studies the translation of a transition system into an equivalent Petri net. This a central problem studied in Petri net theory. Existing tools are able to handle inputs with up to 500.000 states. Applications exist but often require larger inputs to be handled. We aim at extending the applicability of the synthesis problem to inputs with up to 100 Million states.To this end, we systematically exploit the potential of an existing algorithmic idea that is based on using the Union/Find procedure for managing partitions of the set of vertices.