Travail de recherche/Working paper
Résumé : This report addresses the following questions.If a labelled transition system is uniform withregard to the small cycles contained in it,can it be generated by a system -- in particular,a Petri net -- satisfying suitable structural properties? If so, does there exist an efficient algorithm constructing it?It will be shown that in the realm of persistent systems, establishedPetri net region construction techniques can be specialised efficiently.Areas of application and limitations of such techniques will be explored,and several facts about persistent Petri nets will be proved along the way.Eventually, characterisations of the state spaces of bounded and k-boundedmarked graphs will be derived.