Ir al contenido (pulsa Retorno)

Universitat Politècnica de Catalunya

    • Català
    • Castellano
    • English
    • LoginRegisterLog in (no UPC users)
  • mailContact Us
  • world English 
    • Català
    • Castellano
    • English
  • userLogin   
      LoginRegisterLog in (no UPC users)

UPCommons. Global access to UPC knowledge

Banner header
61.694 UPC E-Prints
You are here:
View Item 
  •   DSpace Home
  • E-prints
  • Departaments
  • Departament de Ciències de la Computació
  • Ponències/Comunicacions de congressos
  • View Item
  •   DSpace Home
  • E-prints
  • Departaments
  • Departament de Ciències de la Computació
  • Ponències/Comunicacions de congressos
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

A symbolic algorithm for the synthesis of bounded Petri nets

Thumbnail
View/Open
A_symbolic_algorithm_for_the_synthesis_o.pdf (344,6Kb)
 
10.1007/978-3-540-68746-7_10
 
  View Usage Statistics
  LA Referencia / Recolecta stats
Cita com:
hdl:2117/130963

Show full item record
Carmona Vargas, JosepMés informacióMés informacióMés informació
Cortadella, JordiMés informacióMés informacióMés informació
Kishinevsky, Michael
Kondratyev, Alex
Lavagno, Luciano
Yakovlev, Alex
Document typeConference report
Defense date2008
PublisherSpringer
Rights accessOpen Access
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
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.
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. 
URIhttp://hdl.handle.net/2117/130963
DOI10.1007/978-3-540-68746-7_10
ISBN978-3-540-68746-7
Publisher versionhttps://link.springer.com/chapter/10.1007/978-3-540-68746-7_10
Collections
  • Departament de Ciències de la Computació - Ponències/Comunicacions de congressos [1.250]
  • ALBCOM - Algorismia, Bioinformàtica, Complexitat i Mètodes Formals - Ponències/Comunicacions de congressos [319]
  View Usage Statistics

Show full item record

FilesDescriptionSizeFormatView
A_symbolic_algorithm_for_the_synthesis_o.pdf344,6KbPDFView/Open

Browse

This CollectionBy Issue DateAuthorsOther contributionsTitlesSubjectsThis repositoryCommunities & CollectionsBy Issue DateAuthorsOther contributionsTitlesSubjects

© UPC Obrir en finestra nova . Servei de Biblioteques, Publicacions i Arxius

info.biblioteques@upc.edu

  • About This Repository
  • Contact Us
  • Send Feedback
  • Privacy Settings
  • Inici de la pàgina