Show simple item record

dc.contributor.authorRoux, Olivier-Henri
HAL ID: 17486
dc.contributor.authorLime, Didier
HAL ID: 17326
dc.contributor.authorHaddad, Serge
HAL ID: 745039
dc.contributor.authorCassez, Franck
dc.contributor.authorBérard, Béatrice
HAL ID: 9360
dc.date.accessioned2010-11-29T13:56:17Z
dc.date.available2010-11-29T13:56:17Z
dc.date.issued2005
dc.identifier.urihttps://basepub.dauphine.fr/handle/123456789/5196
dc.language.isoenen
dc.subjectTime Petri Netsen
dc.subjectTimed Bisimilarityen
dc.subjectExpressivenessen
dc.subject.ddc004en
dc.titleComparison of Different Semantics for Time Petri Netsen
dc.typeCommunication / Conférence
dc.description.abstractenIn 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 intermediate 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 atomic and the persistent 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. weak timed 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.en
dc.identifier.citationpages293-307en
dc.relation.ispartofseriestitleLecture Notes in Computer Science
dc.relation.ispartofseriesnumber3707
dc.relation.ispartoftitleAutomated Technology for Verification and Analysis. Third International Symposium, ATVA 2005, Taipei, Taiwan, October 4-7, 2005, Proceedingsen
dc.relation.ispartofeditorYih-Kuen, Tsay
dc.relation.ispartofeditorPeled, Doron A.
dc.relation.ispartofpublnameSpringeren
dc.relation.ispartofpublcityBerlinen
dc.relation.ispartofdate2005
dc.relation.ispartofpages506en
dc.relation.ispartofurlhttp://dx.doi.org/10.1007/11562948en
dc.identifier.urlsitehttp://hal.archives-ouvertes.fr/inria-00368580/fr/en
dc.description.sponsorshipprivateouien
dc.subject.ddclabelInformatique généraleen
dc.relation.ispartofisbn978-3-540-29209-8en
dc.relation.conftitleThird International Symposium on Automated Technology for Verification and Analysis, ATVA 2005en
dc.relation.confdate2005-10
dc.relation.confcityTaipeien
dc.relation.confcountryTaïwanen
dc.identifier.doihttp://dx.doi.org/10.1007/11562948_23


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record