Show simple item record

dc.contributor.authorCarmona Vargas, Josep
dc.contributor.authorCortadella, Jordi
dc.contributor.authorKishinevsky, Michael
dc.contributor.authorKondratyev, Alex
dc.contributor.authorLavagno, Luciano
dc.contributor.authorYakovlev, Alex
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Ciències de la Computació
dc.date.accessioned2019-03-28T07:50:36Z
dc.date.available2019-03-28T07:50:36Z
dc.date.issued2008
dc.identifier.citationCarmona, J. [et al.]. A symbolic algorithm for the synthesis of bounded Petri nets. A: International Conference on Applications and Theory of Petri Nets. "Applications and Theory of Petri Nets: 29th International Conference, PETRI NETS 2008, Xi’an, China, June 23-27, 2008: proceedings". Springer, 2008, p. 92-111.
dc.identifier.isbn978-3-540-68746-7
dc.identifier.urihttp://hdl.handle.net/2117/130963
dc.description.abstractThis 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.
dc.format.extent20 p.
dc.language.isoeng
dc.publisherSpringer
dc.subjectÀrees temàtiques de la UPC::Informàtica::Informàtica teòrica
dc.subject.lcshPetri nets
dc.subject.lcshAlgorithms
dc.subject.otherBoolean function
dc.subject.otherTransition system
dc.subject.otherSymbolic representation
dc.subject.otherConcurrent system
dc.subject.otherMinimal region
dc.titleA symbolic algorithm for the synthesis of bounded Petri nets
dc.typeConference report
dc.subject.lemacPetri, Xarxes de
dc.subject.lemacAlgorismes
dc.contributor.groupUniversitat Politècnica de Catalunya. ALBCOM - Algorismia, Bioinformàtica, Complexitat i Mètodes Formals
dc.identifier.doi10.1007/978-3-540-68746-7_10
dc.description.peerreviewedPeer Reviewed
dc.relation.publisherversionhttps://link.springer.com/chapter/10.1007/978-3-540-68746-7_10
dc.rights.accessOpen Access
local.identifier.drac2356707
dc.description.versionPostprint (author's final draft)
local.citation.authorCarmona, J.; Cortadella, J.; Kishinevsky, M.; Kondratyev, A.; Lavagno, L.; Yakovlev, A.
local.citation.contributorInternational Conference on Applications and Theory of Petri Nets
local.citation.publicationNameApplications and Theory of Petri Nets: 29th International Conference, PETRI NETS 2008, Xi’an, China, June 23-27, 2008: proceedings
local.citation.startingPage92
local.citation.endingPage111


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder