Reconfigurable Nets, a Class of High Level Petri Nets Supporting Dynamic Changes within Workflow Systems

Eric Badouel 1 Javier Oliver 1
1 PARAGRAPHE - Parallelism and Graphs
IRISA - Institut de Recherche en Informatique et Systèmes Aléatoires, INRIA Rennes
Abstract : We introduce a class of high level Petri nets, called reconfigurable nets, that can dynamically modify their own structure by rewriting some of their components. Boundedness of a reconfigurable net can be decided by constructing its coverability tree. Moreover such a net can be simulated by a self-modifying Petri net. The class of reconfigurable nets thus provide a subclass of self-modifying Petri nets for which boundedness can be decided. Delayed dynamic changes within workflow systems in the sense of [7] can then be handled in an extension of van der Aalst's workflow nets [2]. For this class (the reconfigurable workflow nets), a notion of soundness has been defined that can also be verified using the coverability tree construction.
Document type :
Reports
Complete list of metadatas

https://hal.inria.fr/inria-00073350
Contributor : Rapport de Recherche Inria <>
Submitted on : Wednesday, May 24, 2006 - 12:35:51 PM
Last modification on : Friday, November 16, 2018 - 1:30:28 AM
Long-term archiving on : Sunday, April 4, 2010 - 11:43:29 PM

Identifiers

  • HAL Id : inria-00073350, version 1

Citation

Eric Badouel, Javier Oliver. Reconfigurable Nets, a Class of High Level Petri Nets Supporting Dynamic Changes within Workflow Systems. [Research Report] RR-3339, INRIA. 1998. ⟨inria-00073350⟩

Share

Metrics

Record views

390

Files downloads

356