A symbolic algorithm for the synthesis of bounded Petri nets

All of RECERCAT

To access the full text documents, please follow this link: http://hdl.handle.net/2117/130963

Title:	A symbolic algorithm for the synthesis of bounded Petri nets
Author:	Carmona Vargas, Josep; Cortadella, Jordi; Kishinevsky, Michael; Kondratyev, Alex; Lavagno, Luciano; Yakovlev, Alex
Other authors:	Universitat Politècnica de Catalunya. Departament de Ciències de la Computació; Universitat Politècnica de Catalunya. ALBCOM - Algorismia, Bioinformàtica, Complexitat i Mètodes Formals
Abstract:	This paper presents an algorithm for the synthesis of bounded Petri nets from transition systems. A bounded Petri net is always provided in case it exists. Otherwise, the events are split into several transitions to guarantee the synthesis of a Petri net with bisimilar behavior. The algorithm uses symbolic representations of multisets of states to efficiently generate all the minimal regions. The algorithm has been implemented in a tool. Experimental results show a significant net reduction when compared with approaches for the synthesis of safe Petri nets.
Abstract:	Peer Reviewed
Subject(s):	-Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica -Petri nets -Algorithms -Boolean function -Transition system -Symbolic representation -Concurrent system -Minimal region -Petri, Xarxes de -Algorismes
Rights:
Document type:	Article - Submitted version Conference Object
Published by:	Springer
Share: