=Paper=
{{Paper
|id=Vol-1689/paper12
|storemode=property
|title=Petri Net Synthesis from Labelled Transition Systems and from Languages
|pdfUrl=https://ceur-ws.org/Vol-1689/paper12.pdf
|volume=Vol-1689
|authors=Eric Badouel
|dblpUrl=https://dblp.org/rec/conf/vecos/Badouel16
}}
==Petri Net Synthesis from Labelled Transition Systems and from Languages==
<pdf width="1500px">https://ceur-ws.org/Vol-1689/paper12.pdf</pdf>
<pre>
      Petri net synthesis from labelled transition
             systems and from languages


                                                  Eric B ADOUEL
                                           SUMO, IRISA Rennes, France
                                              eric.badouel@inria.fr



   Net synthesis can be understood as an algorithmic procedure aimed at constructing a Petri net structure
   from a specification of its intended or desired behaviour, given typically in the form of a transition system
   or a formal language. The procedure has to decide whether such a specification can be realised and, if the
   answer is positive, deliver as efficiently as possible a Petri net with the specified behaviour. Such a Petri
   net is then correct-by-construction, making net synthesis an attractive alternative to the design-and-verify
   approach to building concurrent and distributed system. If, however, the specification cannot be realised in
   full, the synthesis procedure is expected to deliver a Petri net approximating the specified behaviour in an
   optimal way. In this talk we survey the techniques of Petri net synthesis from labelled transitions or from
   languages and discuss some of their applications to process mining and the supervisory control of discrete
   event systems.




c The Authors. Published by BISL.                       1
Proceedings of VECoS

</pre>