Raymond Devillers - Articulations and Products of Transition Systems and their Applications to Petri Net Synthesis

fi:8648 - Fundamenta Informaticae, December 23, 2021, Volume 183, Issues 1-2: Petri Nets 2019
Articulations and Products of Transition Systems and their Applications to Petri Net Synthesis

Authors: Raymond Devillers

    In order to speed up the synthesis of Petri nets from labelled transition systems, a divide and conquer strategy consists in defining decompositions of labelled transition systems, such that each component is synthesisable iff so is the original system. Then corresponding Petri Net composition operators are searched to combine the solutions of the various components into a solution of the original system. The paper presents two such techniques, which may be combined: products and articulations. They may also be used to structure transition systems, and to analyse the performance of synthesis techniques when applied to such structures.


    Volume: Volume 183, Issues 1-2: Petri Nets 2019
    Published on: December 23, 2021
    Accepted on: November 2, 2021
    Submitted on: November 2, 2021
    Keywords: Computer Science - Formal Languages and Automata Theory,68W15

    Share

    Consultation statistics

    This page has been seen 123 times.
    This article's PDF has been downloaded 45 times.