A New Property of Choice-Free Petri Net Systems [chapter]

Eike Best, Raymond Devillers, Evgeny Erofeev
2020 Lecture Notes in Computer Science  
When a Petri net system of some class is synthesised from a labelled transition system, it may be interesting to derive structural properties of the corresponding reachability graphs and to use them in a pre-synthesis phase in order to quickly reject inadequate transition systems, and provide fruitful error messages. The same is true for simultaneous syntheses problems. This was exploited for the synthesis of choicefree nets for instance, for which several interesting properties have been
more » ... d. We exhibit here a new property for this class, and analyse if this gets us closer to a full characterisation of choice-free synthesizable transition systems.
doi:10.1007/978-3-030-51831-8_5 fatcat:ez53risa4ffbzixkzdqbhzv3pi