InforLorV4, Hal, Corpus, bibRecord, 003689

On Occurrence Net Semantics of Petri Nets

Identifieur interne : 003689 ( Hal/Corpus ); précédent : 003688; suivant : 003690

On Occurrence Net Semantics of Petri Nets

Auteurs : Stefan Haar

Source :

RBID : Hal:inria-00072949

English descriptors

mix :
- BRANCHING PROCESSES, CONCURRENCY, PETRI NETS, SEMANTICS.

Abstract

This paper investigates structural properties of occurrence (Petri) nets and their interpretation as unfolding semantics of Petri net systems. Occurrence nets (ONs) exhibit three kinds of node relations associated with causal ordering, concurrency, and conflict. We show that ONs can be decomposed in a natural way into substructures in each of which one or two of these relations are empty, namely: branches, trails, choices, lines, cuts certain density properties, i.e. non-empty intersections of substructures as above.On the semantic level, two established, yet non-equival- ent, definitions of unfolding semantics are studied: branching processes (introduced by Engelfriet, Winskel et.al) and branching executions (Vogler). To both, the structural resultsapply, and both support appropriate partialorde- r logics of high expressive power.We present two such logics that can be interpreted over occurrence net semantics of either kind: the branching time logic BLC and a non-branching logic LLC whose frame is composed of choices, i.e. objects representing horizons of mutually exclusive cuts (generalized global states) compatible with the corresponding phase.

Url:

https://hal.inria.fr/inria-00072949

Links to Exploration step

Hal:inria-00072949

Le document en format XML

<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en">On Occurrence Net Semantics of Petri Nets</title>
<author><name sortKey="Haar, Stefan" sort="Haar, Stefan" uniqKey="Haar S" first="Stefan" last="Haar">Stefan Haar</name>
<affiliation><hal:affiliation type="researchteam" xml:id="struct-2406" status="OLD"><idno type="RNSR">200218298K</idno>
<orgName>Real time and interoperability</orgName>
<orgName type="acronym">TRIO</orgName>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/equipes/trio</ref>
</desc>
<listRelation><relation active="#struct-160" type="direct"></relation>
<relation name="UMR7503" active="#struct-441569" type="indirect"></relation>
<relation active="#struct-300009" type="indirect"></relation>
<relation active="#struct-300291" type="indirect"></relation>
<relation active="#struct-300292" type="indirect"></relation>
<relation active="#struct-300293" type="indirect"></relation>
<relation active="#struct-2496" type="direct"></relation>
</listRelation>
<tutelles><tutelle active="#struct-160" type="direct"><org type="laboratory" xml:id="struct-160" status="OLD"><orgName>Laboratoire Lorrain de Recherche en Informatique et ses Applications</orgName>
<orgName type="acronym">LORIA</orgName>
<desc><address><addrLine>Campus Scientifique BP 239 54506 Vandoeuvre-lès-Nancy Cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.loria.fr</ref>
</desc>
<listRelation><relation name="UMR7503" active="#struct-441569" type="direct"></relation>
<relation active="#struct-300009" type="direct"></relation>
<relation active="#struct-300291" type="direct"></relation>
<relation active="#struct-300292" type="direct"></relation>
<relation active="#struct-300293" type="direct"></relation>
</listRelation>
</org>
</tutelle>
<tutelle name="UMR7503" active="#struct-441569" type="indirect"><org type="institution" xml:id="struct-441569" status="VALID"><idno type="ISNI">0000000122597504</idno>
<idno type="IdRef">02636817X</idno>
<orgName>Centre National de la Recherche Scientifique</orgName>
<orgName type="acronym">CNRS</orgName>
<date type="start">1939-10-19</date>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.cnrs.fr/</ref>
</desc>
</org>
</tutelle>
<tutelle active="#struct-300009" type="indirect"><org type="institution" xml:id="struct-300009" status="VALID"><orgName>Institut National de Recherche en Informatique et en Automatique</orgName>
<orgName type="acronym">Inria</orgName>
<desc><address><addrLine>Domaine de VoluceauRocquencourt - BP 10578153 Le Chesnay Cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/en/</ref>
</desc>
</org>
</tutelle>
<tutelle active="#struct-300291" type="indirect"><org type="institution" xml:id="struct-300291" status="OLD"><orgName>Université Henri Poincaré - Nancy 1</orgName>
<orgName type="acronym">UHP</orgName>
<date type="end">2011-12-31</date>
<desc><address><addrLine>24-30 rue Lionnois, BP 60120, 54 003 NANCY cedex, France</addrLine>
<country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
<tutelle active="#struct-300292" type="indirect"><org type="institution" xml:id="struct-300292" status="OLD"><orgName>Université Nancy 2</orgName>
<date type="end">2011-12-31</date>
<desc><address><addrLine>91 avenue de la Libération, BP 454, 54001 Nancy cedex</addrLine>
<country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
<tutelle active="#struct-300293" type="indirect"><org type="institution" xml:id="struct-300293" status="OLD"><orgName>Institut National Polytechnique de Lorraine</orgName>
<orgName type="acronym">INPL</orgName>
<date type="end">2011-12-31</date>
<desc><address><country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
<tutelle active="#struct-2496" type="direct"><org type="laboratory" xml:id="struct-2496" status="OLD"><orgName>INRIA Lorraine</orgName>
<desc><address><addrLine>615 rue du Jardin Botanique 54600 Villers-lès-Nancy</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/centre-de-recherche-inria/nancy-grand-est</ref>
</desc>
<listRelation><relation active="#struct-300009" type="direct"></relation>
</listRelation>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">HAL</idno>
<idno type="RBID">Hal:inria-00072949</idno>
<idno type="halId">inria-00072949</idno>
<idno type="halUri">https://hal.inria.fr/inria-00072949</idno>
<idno type="url">https://hal.inria.fr/inria-00072949</idno>
<date when="1999">1999</date>
<idno type="wicri:Area/Hal/Corpus">003689</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en">On Occurrence Net Semantics of Petri Nets</title>
<author><name sortKey="Haar, Stefan" sort="Haar, Stefan" uniqKey="Haar S" first="Stefan" last="Haar">Stefan Haar</name>
<affiliation><hal:affiliation type="researchteam" xml:id="struct-2406" status="OLD"><idno type="RNSR">200218298K</idno>
<orgName>Real time and interoperability</orgName>
<orgName type="acronym">TRIO</orgName>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/equipes/trio</ref>
</desc>
<listRelation><relation active="#struct-160" type="direct"></relation>
<relation name="UMR7503" active="#struct-441569" type="indirect"></relation>
<relation active="#struct-300009" type="indirect"></relation>
<relation active="#struct-300291" type="indirect"></relation>
<relation active="#struct-300292" type="indirect"></relation>
<relation active="#struct-300293" type="indirect"></relation>
<relation active="#struct-2496" type="direct"></relation>
</listRelation>
<tutelles><tutelle active="#struct-160" type="direct"><org type="laboratory" xml:id="struct-160" status="OLD"><orgName>Laboratoire Lorrain de Recherche en Informatique et ses Applications</orgName>
<orgName type="acronym">LORIA</orgName>
<desc><address><addrLine>Campus Scientifique BP 239 54506 Vandoeuvre-lès-Nancy Cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.loria.fr</ref>
</desc>
<listRelation><relation name="UMR7503" active="#struct-441569" type="direct"></relation>
<relation active="#struct-300009" type="direct"></relation>
<relation active="#struct-300291" type="direct"></relation>
<relation active="#struct-300292" type="direct"></relation>
<relation active="#struct-300293" type="direct"></relation>
</listRelation>
</org>
</tutelle>
<tutelle name="UMR7503" active="#struct-441569" type="indirect"><org type="institution" xml:id="struct-441569" status="VALID"><idno type="ISNI">0000000122597504</idno>
<idno type="IdRef">02636817X</idno>
<orgName>Centre National de la Recherche Scientifique</orgName>
<orgName type="acronym">CNRS</orgName>
<date type="start">1939-10-19</date>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.cnrs.fr/</ref>
</desc>
</org>
</tutelle>
<tutelle active="#struct-300009" type="indirect"><org type="institution" xml:id="struct-300009" status="VALID"><orgName>Institut National de Recherche en Informatique et en Automatique</orgName>
<orgName type="acronym">Inria</orgName>
<desc><address><addrLine>Domaine de VoluceauRocquencourt - BP 10578153 Le Chesnay Cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/en/</ref>
</desc>
</org>
</tutelle>
<tutelle active="#struct-300291" type="indirect"><org type="institution" xml:id="struct-300291" status="OLD"><orgName>Université Henri Poincaré - Nancy 1</orgName>
<orgName type="acronym">UHP</orgName>
<date type="end">2011-12-31</date>
<desc><address><addrLine>24-30 rue Lionnois, BP 60120, 54 003 NANCY cedex, France</addrLine>
<country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
<tutelle active="#struct-300292" type="indirect"><org type="institution" xml:id="struct-300292" status="OLD"><orgName>Université Nancy 2</orgName>
<date type="end">2011-12-31</date>
<desc><address><addrLine>91 avenue de la Libération, BP 454, 54001 Nancy cedex</addrLine>
<country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
<tutelle active="#struct-300293" type="indirect"><org type="institution" xml:id="struct-300293" status="OLD"><orgName>Institut National Polytechnique de Lorraine</orgName>
<orgName type="acronym">INPL</orgName>
<date type="end">2011-12-31</date>
<desc><address><country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
<tutelle active="#struct-2496" type="direct"><org type="laboratory" xml:id="struct-2496" status="OLD"><orgName>INRIA Lorraine</orgName>
<desc><address><addrLine>615 rue du Jardin Botanique 54600 Villers-lès-Nancy</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/centre-de-recherche-inria/nancy-grand-est</ref>
</desc>
<listRelation><relation active="#struct-300009" type="direct"></relation>
</listRelation>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
</affiliation>
</author>
</analytic>
</biblStruct>
</sourceDesc>
</fileDesc>
<profileDesc><textClass><keywords scheme="mix" xml:lang="en"><term>BRANCHING PROCESSES</term>
<term>CONCURRENCY</term>
<term>PETRI NETS</term>
<term>SEMANTICS</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">This paper investigates structural properties of occurrence (Petri) nets and their interpretation as unfolding semantics of Petri net systems. Occurrence nets (ONs) exhibit three kinds of node relations associated with causal ordering, concurrency, and conflict. We show that ONs can be decomposed in a natural way into substructures in each of which one or two of these relations are empty, namely: branches, trails, choices, lines, cuts certain density properties, i.e. non-empty intersections of substructures as above.On the semantic level, two established, yet non-equival- ent, definitions of unfolding semantics are studied: branching processes (introduced by Engelfriet, Winskel et.al) and branching executions (Vogler). To both, the structural resultsapply, and both support appropriate partialorde- r logics of high expressive power.We present two such logics that can be interpreted over occurrence net semantics of either kind: the branching time logic BLC and a non-branching logic LLC whose frame is composed of choices, i.e. objects representing horizons of mutually exclusive cuts (generalized global states) compatible with the corresponding phase.</div>
</front>
</TEI>
<hal api="V3"><titleStmt><title xml:lang="en">On Occurrence Net Semantics of Petri Nets</title>
<author role="aut"><persName><forename type="first">Stefan</forename>
<surname>Haar</surname>
</persName>
<email>Stefan.Haar@inria.fr</email>
<idno type="halauthor">100268</idno>
<affiliation ref="#struct-2406"></affiliation>
</author>
<editor role="depositor"><persName><forename>Rapport De Recherche</forename>
<surname>Inria</surname>
</persName>
<email>rrrt-editeurs@inria.fr</email>
</editor>
</titleStmt>
<editionStmt><edition n="v1" type="current"><date type="whenSubmitted">2006-05-24 11:24:57</date>
<date type="whenWritten">1999-06</date>
<date type="whenModified">2016-05-19 01:09:25</date>
<date type="whenReleased">2006-05-31 14:24:27</date>
<date type="whenProduced">1999</date>
<date type="whenEndEmbargoed">2006-05-24</date>
<ref type="file" target="https://hal.inria.fr/inria-00072949/document"><date notBefore="2006-05-24"></date>
</ref>
<ref type="file" n="1" target="https://hal.inria.fr/inria-00072949/file/RR-3718.pdf"><date notBefore="2006-05-24"></date>
</ref>
</edition>
<respStmt><resp>contributor</resp>
<name key="111068"><persName><forename>Rapport De Recherche</forename>
<surname>Inria</surname>
</persName>
<email>rrrt-editeurs@inria.fr</email>
</name>
</respStmt>
</editionStmt>
<publicationStmt><distributor>CCSD</distributor>
<idno type="halId">inria-00072949</idno>
<idno type="halUri">https://hal.inria.fr/inria-00072949</idno>
<idno type="halBibtex">haar:inria-00072949</idno>
<idno type="halRefHtml">[Research Report] RR-3718, INRIA. 1999</idno>
<idno type="halRef">[Research Report] RR-3718, INRIA. 1999</idno>
</publicationStmt>
<seriesStmt><idno type="stamp" n="INRIA">INRIA - Institut National de Recherche en Informatique et en Automatique</idno>
<idno type="stamp" n="INRIA-RRRT">Rapports de recherche et Technique de l'Inria</idno>
<idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
<idno type="stamp" n="INPL">Institut National Polytechnique de Lorraine</idno>
<idno type="stamp" n="LORIA2">Publications du LORIA</idno>
<idno type="stamp" n="INRIA-NANCY-GRAND-EST">INRIA Nancy - Grand Est</idno>
<idno type="stamp" n="LORIA-NSS" p="LORIA">Réseaux, systèmes et services</idno>
<idno type="stamp" n="LORIA">LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications</idno>
<idno type="stamp" n="UNIV-LORRAINE">Université de Lorraine</idno>
<idno type="stamp" n="INRIA-LORRAINE">INRIA Nancy - Grand Est</idno>
<idno type="stamp" n="LABO-LORIA-SET" p="LORIA">LABO-LORIA-SET</idno>
</seriesStmt>
<notesStmt><note type="audience" n="0">Not set</note>
<note type="report" n="6">Research Report</note>
</notesStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en">On Occurrence Net Semantics of Petri Nets</title>
<author role="aut"><persName><forename type="first">Stefan</forename>
<surname>Haar</surname>
</persName>
<email>Stefan.Haar@inria.fr</email>
<idno type="halAuthorId">100268</idno>
<affiliation ref="#struct-2406"></affiliation>
</author>
</analytic>
<monogr><idno type="reportNumber">RR-3718</idno>
<imprint><date type="datePub">1999</date>
</imprint>
<authority type="institution">INRIA</authority>
</monogr>
</biblStruct>
</sourceDesc>
<profileDesc><langUsage><language ident="en">English</language>
</langUsage>
<textClass><keywords scheme="author"><term xml:lang="en">SEMANTICS</term>
<term xml:lang="en">BRANCHING PROCESSES</term>
<term xml:lang="en">CONCURRENCY</term>
<term xml:lang="en">PETRI NETS</term>
</keywords>
<classCode scheme="halDomain" n="info.info-oh">Computer Science [cs]/Other [cs.OH]</classCode>
<classCode scheme="halTypology" n="REPORT">Reports</classCode>
</textClass>
<abstract xml:lang="en">This paper investigates structural properties of occurrence (Petri) nets and their interpretation as unfolding semantics of Petri net systems. Occurrence nets (ONs) exhibit three kinds of node relations associated with causal ordering, concurrency, and conflict. We show that ONs can be decomposed in a natural way into substructures in each of which one or two of these relations are empty, namely: branches, trails, choices, lines, cuts certain density properties, i.e. non-empty intersections of substructures as above.On the semantic level, two established, yet non-equival- ent, definitions of unfolding semantics are studied: branching processes (introduced by Engelfriet, Winskel et.al) and branching executions (Vogler). To both, the structural resultsapply, and both support appropriate partialorde- r logics of high expressive power.We present two such logics that can be interpreted over occurrence net semantics of either kind: the branching time logic BLC and a non-branching logic LLC whose frame is composed of choices, i.e. objects representing horizons of mutually exclusive cuts (generalized global states) compatible with the corresponding phase.</abstract>
</profileDesc>
</hal>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Hal/Corpus

HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 003689 | SxmlIndent | more

HfdSelect -h $EXPLOR_AREA/Data/Hal/Corpus/biblio.hfd -nk 003689 | SxmlIndent | more

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    Hal
   |étape=   Corpus
   |type=    RBID
   |clé=     Hal:inria-00072949
   |texte=   On Occurrence Net Semantics of Petri Nets
}}

This area was generated with Dilib version V0.6.33.
Data generation: Mon Jun 10 21:56:28 2019. Site generation: Fri Feb 25 15:29:27 2022

	Serveur d'exploration sur la recherche en informatique en Lorraine
	Attention, ce site est en cours de développement ! Attention, site généré par des moyens informatiques à partir de corpus bruts. Les informations ne sont donc pas validées.

Serveur d'exploration sur la recherche en informatique en Lorraine

On Occurrence Net Semantics of Petri Nets

On Occurrence Net Semantics of Petri Nets

Source :

English descriptors

Abstract

Links to Exploration step

Le document en format XML

Pour manipuler ce document sous Unix (Dilib)

Pour mettre un lien sur cette page dans le réseau Wicri