AustralieFrV1, PascalFrancis, Corpus, bibRecord, 003A12

Modular state space exploration for timed petri nets

Identifieur interne : 003A12 ( PascalFrancis/Corpus ); précédent : 003A11; suivant : 003A13

Modular state space exploration for timed petri nets

Auteurs : C. Lakos ; L. Petrucci

Source :

International journal on software tools for technology transfer : (Print) [ 1433-2779 ] ; 2007.

RBID : Pascal:07-0405531

Descripteurs français

Pascal (Inist)
- Analyse atteignabilité, Simultanéité informatique, Calcul réparti, Construction modulaire, Système temporisé, Système événement discret, Réseau Pétri, Méthode espace état, Simulation ordinateur, Modélisation.

English descriptors

KwdEn :
- Computer simulation, Concurrency, Discrete event system, Distributed computing, Modeling, Modular construction, Petri net, Reachability analysis, State space method, Timed system.

Abstract

This paper extends modular state space construction for concurrent systems to cater for timed systems. It identifies different forms of timed state space and presents algorithms for computing them. These include uniprocessor algorithms inspired by conservative and optimistic approaches to discrete event simulation, and also a distributed algorithm. The paper discusses implementation issues and performance results for a simple case study.

Notice en format standard (ISO 2709)

Pour connaître la documentation sur le format Inist Standard.

A01	`01`	`1`		`@0 1433-2779`
A03		`1`		`@0 Int. j. softw. tools technol. transf. : (Print)`
A05				`@2 9`
A06				`@2 3-4`
A08	`01`	`1`	`ENG`	`@1 Modular state space exploration for timed petri nets`
A09	`01`	`1`	`ENG`	`@1 Coloured Petri Nets`
A11	`01`	`1`		`@1 LAKOS (C.)`
A11	`02`	`1`		`@1 PETRUCCI (L.)`
A12	`01`	`1`		`@1 JENSEN (Kurt) @9 ed.`
A14	`01`			`@1 University of Adelaide @2 Adelaide, SA 5005 @3 AUS @Z 1 aut.`
A14	`02`			`@1 LIPN, CNRS UMR 7030, Université Paris XIII, 99, avenue Jean-Baptiste Clément @2 93430 Villetaneuse @3 FRA @Z 2 aut.`
A15	`01`			`@1 CPN Group, Department of Computer Science, University of Aarhus @2 Aarhus @3 DNK @Z 1 aut.`
A20				`@1 393-411`
A21				`@1 2007`
A23	`01`			`@0 ENG`
A43	`01`			`@1 INIST @2 27083 @5 354000149421070080`
A44				`@0 0000 @1 © 2007 INIST-CNRS. All rights reserved.`
A45				`@0 16 ref.`
A47	`01`	`1`		`@0 07-0405531`
A60				`@1 P`
A61				`@0 A`
A64	`01`	`1`		`@0 International journal on software tools for technology transfer : (Print)`
A66	`01`			`@0 DEU`
C01	`01`		`ENG`	`@0 This paper extends modular state space construction for concurrent systems to cater for timed systems. It identifies different forms of timed state space and presents algorithms for computing them. These include uniprocessor algorithms inspired by conservative and optimistic approaches to discrete event simulation, and also a distributed algorithm. The paper discusses implementation issues and performance results for a simple case study.`
C02	`01`	`X`		`@0 001D02B04`
C02	`02`	`X`		`@0 001D02B09`
C03	`01`	`3`	`FRE`	`@0 Analyse atteignabilité @5 06`
C03	`01`	`3`	`ENG`	`@0 Reachability analysis @5 06`
C03	`02`	`X`	`FRE`	`@0 Simultanéité informatique @5 07`
C03	`02`	`X`	`ENG`	`@0 Concurrency @5 07`
C03	`02`	`X`	`SPA`	`@0 Simultaneidad informatica @5 07`
C03	`03`	`X`	`FRE`	`@0 Calcul réparti @5 08`
C03	`03`	`X`	`ENG`	`@0 Distributed computing @5 08`
C03	`03`	`X`	`SPA`	`@0 Cálculo repartido @5 08`
C03	`04`	`X`	`FRE`	`@0 Construction modulaire @5 18`
C03	`04`	`X`	`ENG`	`@0 Modular construction @5 18`
C03	`04`	`X`	`SPA`	`@0 Construcción modular @5 18`
C03	`05`	`X`	`FRE`	`@0 Système temporisé @5 19`
C03	`05`	`X`	`ENG`	`@0 Timed system @5 19`
C03	`05`	`X`	`SPA`	`@0 Sistema temporizado @5 19`
C03	`06`	`X`	`FRE`	`@0 Système événement discret @5 20`
C03	`06`	`X`	`ENG`	`@0 Discrete event system @5 20`
C03	`06`	`X`	`SPA`	`@0 Sistema acontecimiento discreto @5 20`
C03	`07`	`X`	`FRE`	`@0 Réseau Pétri @5 23`
C03	`07`	`X`	`ENG`	`@0 Petri net @5 23`
C03	`07`	`X`	`SPA`	`@0 Red Petri @5 23`
C03	`08`	`X`	`FRE`	`@0 Méthode espace état @5 24`
C03	`08`	`X`	`ENG`	`@0 State space method @5 24`
C03	`08`	`X`	`SPA`	`@0 Método espacio estado @5 24`
C03	`09`	`X`	`FRE`	`@0 Simulation ordinateur @5 25`
C03	`09`	`X`	`ENG`	`@0 Computer simulation @5 25`
C03	`09`	`X`	`SPA`	`@0 Simulación computadora @5 25`
C03	`10`	`X`	`FRE`	`@0 Modélisation @5 26`
C03	`10`	`X`	`ENG`	`@0 Modeling @5 26`
C03	`10`	`X`	`SPA`	`@0 Modelización @5 26`
N21				`@1 260`
N44	`01`			`@1 OTO`
N82				`@1 OTO`

Format Inist (serveur)

NO :	PASCAL 07-0405531 INIST
ET :	Modular state space exploration for timed petri nets
AU :	LAKOS (C.); PETRUCCI (L.); JENSEN (Kurt)
AF :	University of Adelaide/Adelaide, SA 5005/Australie (1 aut.); LIPN, CNRS UMR 7030, Université Paris XIII, 99, avenue Jean-Baptiste Clément/93430 Villetaneuse/France (2 aut.); CPN Group, Department of Computer Science, University of Aarhus/Aarhus/Danemark (1 aut.)
DT :	Publication en série; Niveau analytique
SO :	International journal on software tools for technology transfer : (Print); ISSN 1433-2779; Allemagne; Da. 2007; Vol. 9; No. 3-4; Pp. 393-411; Bibl. 16 ref.
LA :	Anglais
EA :	This paper extends modular state space construction for concurrent systems to cater for timed systems. It identifies different forms of timed state space and presents algorithms for computing them. These include uniprocessor algorithms inspired by conservative and optimistic approaches to discrete event simulation, and also a distributed algorithm. The paper discusses implementation issues and performance results for a simple case study.
CC :	001D02B04; 001D02B09
FD :	Analyse atteignabilité; Simultanéité informatique; Calcul réparti; Construction modulaire; Système temporisé; Système événement discret; Réseau Pétri; Méthode espace état; Simulation ordinateur; Modélisation
ED :	Reachability analysis; Concurrency; Distributed computing; Modular construction; Timed system; Discrete event system; Petri net; State space method; Computer simulation; Modeling
SD :	Simultaneidad informatica; Cálculo repartido; Construcción modular; Sistema temporizado; Sistema acontecimiento discreto; Red Petri; Método espacio estado; Simulación computadora; Modelización
LO :	INIST-27083.354000149421070080
ID :	07-0405531

Links to Exploration step

Pascal:07-0405531

Le document en format XML

<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">Modular state space exploration for timed petri nets</title>
<author><name sortKey="Lakos, C" sort="Lakos, C" uniqKey="Lakos C" first="C." last="Lakos">C. Lakos</name>
<affiliation><inist:fA14 i1="01"><s1>University of Adelaide</s1>
<s2>Adelaide, SA 5005</s2>
<s3>AUS</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Petrucci, L" sort="Petrucci, L" uniqKey="Petrucci L" first="L." last="Petrucci">L. Petrucci</name>
<affiliation><inist:fA14 i1="02"><s1>LIPN, CNRS UMR 7030, Université Paris XIII, 99, avenue Jean-Baptiste Clément</s1>
<s2>93430 Villetaneuse</s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">07-0405531</idno>
<date when="2007">2007</date>
<idno type="stanalyst">PASCAL 07-0405531 INIST</idno>
<idno type="RBID">Pascal:07-0405531</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">003A12</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">Modular state space exploration for timed petri nets</title>
<author><name sortKey="Lakos, C" sort="Lakos, C" uniqKey="Lakos C" first="C." last="Lakos">C. Lakos</name>
<affiliation><inist:fA14 i1="01"><s1>University of Adelaide</s1>
<s2>Adelaide, SA 5005</s2>
<s3>AUS</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Petrucci, L" sort="Petrucci, L" uniqKey="Petrucci L" first="L." last="Petrucci">L. Petrucci</name>
<affiliation><inist:fA14 i1="02"><s1>LIPN, CNRS UMR 7030, Université Paris XIII, 99, avenue Jean-Baptiste Clément</s1>
<s2>93430 Villetaneuse</s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
</analytic>
<series><title level="j" type="main">International journal on software tools for technology transfer : (Print)</title>
<title level="j" type="abbreviated">Int. j. softw. tools technol. transf. : (Print)</title>
<idno type="ISSN">1433-2779</idno>
<imprint><date when="2007">2007</date>
</imprint>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt><title level="j" type="main">International journal on software tools for technology transfer : (Print)</title>
<title level="j" type="abbreviated">Int. j. softw. tools technol. transf. : (Print)</title>
<idno type="ISSN">1433-2779</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Computer simulation</term>
<term>Concurrency</term>
<term>Discrete event system</term>
<term>Distributed computing</term>
<term>Modeling</term>
<term>Modular construction</term>
<term>Petri net</term>
<term>Reachability analysis</term>
<term>State space method</term>
<term>Timed system</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr"><term>Analyse atteignabilité</term>
<term>Simultanéité informatique</term>
<term>Calcul réparti</term>
<term>Construction modulaire</term>
<term>Système temporisé</term>
<term>Système événement discret</term>
<term>Réseau Pétri</term>
<term>Méthode espace état</term>
<term>Simulation ordinateur</term>
<term>Modélisation</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">This paper extends modular state space construction for concurrent systems to cater for timed systems. It identifies different forms of timed state space and presents algorithms for computing them. These include uniprocessor algorithms inspired by conservative and optimistic approaches to discrete event simulation, and also a distributed algorithm. The paper discusses implementation issues and performance results for a simple case study.</div>
</front>
</TEI>
<inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>1433-2779</s0>
</fA01>
<fA03 i2="1"><s0>Int. j. softw. tools technol. transf. : (Print)</s0>
</fA03>
<fA05><s2>9</s2>
</fA05>
<fA06><s2>3-4</s2>
</fA06>
<fA08 i1="01" i2="1" l="ENG"><s1>Modular state space exploration for timed petri nets</s1>
</fA08>
<fA09 i1="01" i2="1" l="ENG"><s1>Coloured Petri Nets</s1>
</fA09>
<fA11 i1="01" i2="1"><s1>LAKOS (C.)</s1>
</fA11>
<fA11 i1="02" i2="1"><s1>PETRUCCI (L.)</s1>
</fA11>
<fA12 i1="01" i2="1"><s1>JENSEN (Kurt)</s1>
<s9>ed.</s9>
</fA12>
<fA14 i1="01"><s1>University of Adelaide</s1>
<s2>Adelaide, SA 5005</s2>
<s3>AUS</s3>
<sZ>1 aut.</sZ>
</fA14>
<fA14 i1="02"><s1>LIPN, CNRS UMR 7030, Université Paris XIII, 99, avenue Jean-Baptiste Clément</s1>
<s2>93430 Villetaneuse</s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
</fA14>
<fA15 i1="01"><s1>CPN Group, Department of Computer Science, University of Aarhus</s1>
<s2>Aarhus</s2>
<s3>DNK</s3>
<sZ>1 aut.</sZ>
</fA15>
<fA20><s1>393-411</s1>
</fA20>
<fA21><s1>2007</s1>
</fA21>
<fA23 i1="01"><s0>ENG</s0>
</fA23>
<fA43 i1="01"><s1>INIST</s1>
<s2>27083</s2>
<s5>354000149421070080</s5>
</fA43>
<fA44><s0>0000</s0>
<s1>© 2007 INIST-CNRS. All rights reserved.</s1>
</fA44>
<fA45><s0>16 ref.</s0>
</fA45>
<fA47 i1="01" i2="1"><s0>07-0405531</s0>
</fA47>
<fA60><s1>P</s1>
</fA60>
<fA61><s0>A</s0>
</fA61>
<fA64 i1="01" i2="1"><s0>International journal on software tools for technology transfer : (Print)</s0>
</fA64>
<fA66 i1="01"><s0>DEU</s0>
</fA66>
<fC01 i1="01" l="ENG"><s0>This paper extends modular state space construction for concurrent systems to cater for timed systems. It identifies different forms of timed state space and presents algorithms for computing them. These include uniprocessor algorithms inspired by conservative and optimistic approaches to discrete event simulation, and also a distributed algorithm. The paper discusses implementation issues and performance results for a simple case study.</s0>
</fC01>
<fC02 i1="01" i2="X"><s0>001D02B04</s0>
</fC02>
<fC02 i1="02" i2="X"><s0>001D02B09</s0>
</fC02>
<fC03 i1="01" i2="3" l="FRE"><s0>Analyse atteignabilité</s0>
<s5>06</s5>
</fC03>
<fC03 i1="01" i2="3" l="ENG"><s0>Reachability analysis</s0>
<s5>06</s5>
</fC03>
<fC03 i1="02" i2="X" l="FRE"><s0>Simultanéité informatique</s0>
<s5>07</s5>
</fC03>
<fC03 i1="02" i2="X" l="ENG"><s0>Concurrency</s0>
<s5>07</s5>
</fC03>
<fC03 i1="02" i2="X" l="SPA"><s0>Simultaneidad informatica</s0>
<s5>07</s5>
</fC03>
<fC03 i1="03" i2="X" l="FRE"><s0>Calcul réparti</s0>
<s5>08</s5>
</fC03>
<fC03 i1="03" i2="X" l="ENG"><s0>Distributed computing</s0>
<s5>08</s5>
</fC03>
<fC03 i1="03" i2="X" l="SPA"><s0>Cálculo repartido</s0>
<s5>08</s5>
</fC03>
<fC03 i1="04" i2="X" l="FRE"><s0>Construction modulaire</s0>
<s5>18</s5>
</fC03>
<fC03 i1="04" i2="X" l="ENG"><s0>Modular construction</s0>
<s5>18</s5>
</fC03>
<fC03 i1="04" i2="X" l="SPA"><s0>Construcción modular</s0>
<s5>18</s5>
</fC03>
<fC03 i1="05" i2="X" l="FRE"><s0>Système temporisé</s0>
<s5>19</s5>
</fC03>
<fC03 i1="05" i2="X" l="ENG"><s0>Timed system</s0>
<s5>19</s5>
</fC03>
<fC03 i1="05" i2="X" l="SPA"><s0>Sistema temporizado</s0>
<s5>19</s5>
</fC03>
<fC03 i1="06" i2="X" l="FRE"><s0>Système événement discret</s0>
<s5>20</s5>
</fC03>
<fC03 i1="06" i2="X" l="ENG"><s0>Discrete event system</s0>
<s5>20</s5>
</fC03>
<fC03 i1="06" i2="X" l="SPA"><s0>Sistema acontecimiento discreto</s0>
<s5>20</s5>
</fC03>
<fC03 i1="07" i2="X" l="FRE"><s0>Réseau Pétri</s0>
<s5>23</s5>
</fC03>
<fC03 i1="07" i2="X" l="ENG"><s0>Petri net</s0>
<s5>23</s5>
</fC03>
<fC03 i1="07" i2="X" l="SPA"><s0>Red Petri</s0>
<s5>23</s5>
</fC03>
<fC03 i1="08" i2="X" l="FRE"><s0>Méthode espace état</s0>
<s5>24</s5>
</fC03>
<fC03 i1="08" i2="X" l="ENG"><s0>State space method</s0>
<s5>24</s5>
</fC03>
<fC03 i1="08" i2="X" l="SPA"><s0>Método espacio estado</s0>
<s5>24</s5>
</fC03>
<fC03 i1="09" i2="X" l="FRE"><s0>Simulation ordinateur</s0>
<s5>25</s5>
</fC03>
<fC03 i1="09" i2="X" l="ENG"><s0>Computer simulation</s0>
<s5>25</s5>
</fC03>
<fC03 i1="09" i2="X" l="SPA"><s0>Simulación computadora</s0>
<s5>25</s5>
</fC03>
<fC03 i1="10" i2="X" l="FRE"><s0>Modélisation</s0>
<s5>26</s5>
</fC03>
<fC03 i1="10" i2="X" l="ENG"><s0>Modeling</s0>
<s5>26</s5>
</fC03>
<fC03 i1="10" i2="X" l="SPA"><s0>Modelización</s0>
<s5>26</s5>
</fC03>
<fN21><s1>260</s1>
</fN21>
<fN44 i1="01"><s1>OTO</s1>
</fN44>
<fN82><s1>OTO</s1>
</fN82>
</pA>
</standard>
<server><NO>PASCAL 07-0405531 INIST</NO>
<ET>Modular state space exploration for timed petri nets</ET>
<AU>LAKOS (C.); PETRUCCI (L.); JENSEN (Kurt)</AU>
<AF>University of Adelaide/Adelaide, SA 5005/Australie (1 aut.); LIPN, CNRS UMR 7030, Université Paris XIII, 99, avenue Jean-Baptiste Clément/93430 Villetaneuse/France (2 aut.); CPN Group, Department of Computer Science, University of Aarhus/Aarhus/Danemark (1 aut.)</AF>
<DT>Publication en série; Niveau analytique</DT>
<SO>International journal on software tools for technology transfer : (Print); ISSN 1433-2779; Allemagne; Da. 2007; Vol. 9; No. 3-4; Pp. 393-411; Bibl. 16 ref.</SO>
<LA>Anglais</LA>
<EA>This paper extends modular state space construction for concurrent systems to cater for timed systems. It identifies different forms of timed state space and presents algorithms for computing them. These include uniprocessor algorithms inspired by conservative and optimistic approaches to discrete event simulation, and also a distributed algorithm. The paper discusses implementation issues and performance results for a simple case study.</EA>
<CC>001D02B04; 001D02B09</CC>
<FD>Analyse atteignabilité; Simultanéité informatique; Calcul réparti; Construction modulaire; Système temporisé; Système événement discret; Réseau Pétri; Méthode espace état; Simulation ordinateur; Modélisation</FD>
<ED>Reachability analysis; Concurrency; Distributed computing; Modular construction; Timed system; Discrete event system; Petri net; State space method; Computer simulation; Modeling</ED>
<SD>Simultaneidad informatica; Cálculo repartido; Construcción modular; Sistema temporizado; Sistema acontecimiento discreto; Red Petri; Método espacio estado; Simulación computadora; Modelización</SD>
<LO>INIST-27083.354000149421070080</LO>
<ID>07-0405531</ID>
</server>
</inist>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Asie/explor/AustralieFrV1/Data/PascalFrancis/Corpus

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

HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Corpus/biblio.hfd -nk 003A12 | SxmlIndent | more

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

{{Explor lien
   |wiki=    Wicri/Asie
   |area=    AustralieFrV1
   |flux=    PascalFrancis
   |étape=   Corpus
   |type=    RBID
   |clé=     Pascal:07-0405531
   |texte=   Modular state space exploration for timed petri nets
}}

This area was generated with Dilib version V0.6.33.
Data generation: Tue Dec 5 10:43:12 2017. Site generation: Tue Mar 5 14:07:20 2024

	Serveur d'exploration sur les relations entre la France et l'Australie
	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 les relations entre la France et l'Australie

Modular state space exploration for timed petri nets

Modular state space exploration for timed petri nets

Source :

Descripteurs français

English descriptors

Abstract

Notice en format standard (ISO 2709)

Format Inist (serveur)

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