Petri Nets with May/Must Semantics - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2009

Petri Nets with May/Must Semantics

Natalia Sidorova
  • Function : Author
  • PersonId : 864245
Nikola Trcka
  • Function : Author
  • PersonId : 864246


Many systems used in process managements, like workflow systems, are developed in a top-down fashion, when the original design is refined at each step bringing it closer to the underlying reality. Underdefined specifications cannot however be used for verification, since both false positives and false negatives can be reported. In this paper we introduce colored Petri nets where guards can be evaluated to true, false and indefinite values, the last ones reflecting underspecification. This results in the semantics of Petri nets with may- and must-enableness and firings. In this framework we introduce property-preserving refinements that allow for verification in an early design phase. We present results on property preservation through refinements. We also apply our framework to workflow nets, introduce notions of may- and must-soundness and show that they are preserved through refinements. We shortly describe a prototype under implementation.
No file

Dates and versions

inria-00426835 , version 1 (28-10-2009)


  • HAL Id : inria-00426835 , version 1


Olga Kouchnarenko, Natalia Sidorova, Nikola Trcka. Petri Nets with May/Must Semantics. Workshop on Concurrency, Specification, and Programming - CS&P 2009, Humboldt University, Sep 2009, Kraków-Przegorzały, Poland. ⟨inria-00426835⟩
109 View
0 Download


Gmail Facebook X LinkedIn More