Properties of Untimed Routed Petri Nets
Identifieur interne : 00AC02 ( Main/Merge ); précédent : 00AC01; suivant : 00AC03Properties of Untimed Routed Petri Nets
Auteurs : Stefan HaarSource :
English descriptors
- KwdEn :
Abstract
In this paper, we study the properties of routing functions in non-timed Petri nets with respect to the nets' semantics. We consider two types of routing (origin dependent and origin independent) which are not mutually representable, and describe the net semantics induced. For unequivocal routing, the process behavior - definable only in the origin dependent case - is shown to be unique up to isomorphism. We show that every routed net is weakly routing place bisimilar to a Free Choice net. This fact, in turn, facilitates the subsequent study of fairness properties, which are characterized by the local equitability of the routing functions.
Links toward previous steps (curation, corpus...)
- to stream Crin, to step Corpus: 002745
- to stream Crin, to step Curation: 002745
- to stream Crin, to step Checkpoint: 001D96
Links to Exploration step
CRIN:haar99cLe document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" wicri:score="52">Properties of Untimed Routed Petri Nets</title></titleStmt><publicationStmt><idno type="RBID">CRIN:haar99c</idno><date when="1999" year="1999">1999</date><idno type="wicri:Area/Crin/Corpus">002745</idno><idno type="wicri:Area/Crin/Curation">002745</idno><idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Curation">002745</idno><idno type="wicri:Area/Crin/Checkpoint">001D96</idno><idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Checkpoint">001D96</idno><idno type="wicri:Area/Main/Merge">00AC02</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en">Properties of Untimed Routed Petri Nets</title><author><name sortKey="Haar, Stefan" sort="Haar, Stefan" uniqKey="Haar S" first="Stefan" last="Haar">Stefan Haar</name></author></analytic></biblStruct></sourceDesc></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>fairness</term><term>petri nets</term><term>routing</term><term>semantics</term></keywords></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en" wicri:score="1728">In this paper, we study the properties of routing functions in non-timed Petri nets with respect to the nets' semantics. We consider two types of routing (origin dependent and origin independent) which are not mutually representable, and describe the net semantics induced. For unequivocal routing, the process behavior - definable only in the origin dependent case - is shown to be unique up to isomorphism. We show that every routed net is weakly routing place bisimilar to a Free Choice net. This fact, in turn, facilitates the subsequent study of fairness properties, which are characterized by the local equitability of the routing functions.</div></front></TEI></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Merge
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 00AC02 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Merge/biblio.hfd -nk 00AC02 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Merge
|type= RBID
|clé= CRIN:haar99c
|texte= Properties of Untimed Routed Petri Nets
}}
| This area was generated with Dilib version V0.6.33. |  |