Comparison of Different Semantics for Time Petri Nets - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2005

Comparison of Different Semantics for Time Petri Nets

Abstract

In this paper we study the model of Time Petri Nets (TPNs) where a time interval is associated with the firing of a transition, but we extend it by considering general intervals rather than closed ones. A key feature of timed models is the memory policy, i.e. which timing informations are kept when a transition is fired. The original model selects an \emphintermediate semantics where the transitions disabled after consuming the tokens, as well as the firing transition, are reinitialised. However this semantics is not appropriate for some applications. So we consider here two alternative semantics: the \emphatomic and the \emphpersistent atomic ones. First we present relevant patterns of discrete event systems which show the interest of these semantics. Then we compare the expressiveness of the three semantics w.r.t. the weak time bisimilarity establishing inclusion results in the general case. Furthermore we show that some inclusions are strict with unrestricted intervals even when nets are bounded. Then we focus on bounded TPNs with upper-closed intervals and we prove that the semantics are equivalent. Finally taking into account both the practical and the theoretical issues, we conclude that persistent atomic semantics should be preferred.
Fichier principal
Vignette du fichier
petri-nets-atva05.pdf (201.14 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00368580 , version 1 (17-03-2009)

Identifiers

  • HAL Id : inria-00368580 , version 1

Cite

Béatrice Berard, Franck Cassez, Serge Haddad, Didier Lime, Olivier Henri Roux. Comparison of Different Semantics for Time Petri Nets. 3rd Int. Symp. on Automated Technology for Verification and Analysis (ATVA'05), Oct 2005, Taiwan, Taiwan. pp.293--307. ⟨inria-00368580⟩
219 View
361 Download

Share

Gmail Facebook Twitter LinkedIn More