Time constraint patterns for event B development
Identifieur interne :
000353 ( PascalFrancis/Corpus );
précédent :
000352;
suivant :
000354
Time constraint patterns for event B development
Auteurs : Dominique Cansell ;
Dominique Mery ;
Joris RehmSource :
-
Lecture notes in computer science [ 0302-9743 ] ; 2006.
RBID : Pascal:08-0029207
Descripteurs français
English descriptors
Abstract
Distributed applications are based on algorithms which should be able to deal with time constraints. It is mandatory to express time constraints in (mathematical) models and the current work intends to integrate time constraints in the modelling process based on event B models and refinement. The starting point of our work is the event B development of the IEEE 1394 leader election protocol; from standard documents, we derive temporal requirements to solve the contention problem and we propose a method for introducing time constraints using a pattern. The pattern captures time constraints in a generic event B development and it is applied to the IEEE 1394 case study.
Notice en format standard (ISO 2709)
Pour connaître la documentation sur le format Inist Standard.
| pA |
| A01 | 01 | 1 | | @0 0302-9743 |
|---|
| A05 | | | | @2 4355 |
|---|
| A08 | 01 | 1 | ENG | @1 Time constraint patterns for event B development |
|---|
| A09 | 01 | 1 | ENG | @1 B 2007 : formal specification and development in B : 7th international conference of B users, Besançon, France, January 17-19, 2007 : proceedings |
|---|
| A11 | 01 | 1 | | @1 CANSELL (Dominique) |
|---|
| A11 | 02 | 1 | | @1 MERY (Dominique) |
|---|
| A11 | 03 | 1 | | @1 REHM (Joris) |
|---|
| A12 | 01 | 1 | | @1 JULLIAND (Jacques) @9 ed. |
|---|
| A12 | 02 | 1 | | @1 KOUCHNARENKO (Olga) @9 ed. |
|---|
| A14 | 01 | | | @1 Université de Metz @3 FRA @Z 1 aut. |
|---|
| A14 | 02 | | | @1 LORIA BP 239 @2 54506 Vandoevre-lès-Nancy @3 FRA @Z 1 aut. @Z 2 aut. @Z 3 aut. |
|---|
| A14 | 03 | | | @1 Université Henri Poincaré Nancy @3 FRA @Z 2 aut. @Z 3 aut. |
|---|
| A20 | | | | @1 140-154 |
|---|
| A21 | | | | @1 2006 |
|---|
| A23 | 01 | | | @0 ENG |
|---|
| A26 | 01 | | | @0 978-3-540-68760-3 |
|---|
| A43 | 01 | | | @1 INIST @2 16343 @5 354000153639230100 |
|---|
| A44 | | | | @0 0000 @1 © 2008 INIST-CNRS. All rights reserved. |
|---|
| A45 | | | | @0 20 ref. |
|---|
| A47 | 01 | 1 | | @0 08-0029207 |
|---|
| A60 | | | | @1 P @2 C |
|---|
| A61 | | | | @0 A |
|---|
| A64 | 01 | 1 | | @0 Lecture notes in computer science |
|---|
| A66 | 01 | | | @0 DEU |
|---|
| C01 | 01 | | ENG | @0 Distributed applications are based on algorithms which should be able to deal with time constraints. It is mandatory to express time constraints in (mathematical) models and the current work intends to integrate time constraints in the modelling process based on event B models and refinement. The starting point of our work is the event B development of the IEEE 1394 leader election protocol; from standard documents, we derive temporal requirements to solve the contention problem and we propose a method for introducing time constraints using a pattern. The pattern captures time constraints in a generic event B development and it is applied to the IEEE 1394 case study. |
|---|
| C02 | 01 | X | | @0 001D02B09 |
|---|
| C03 | 01 | X | FRE | @0 Développement logiciel @5 01 |
|---|
| C03 | 01 | X | ENG | @0 Software development @5 01 |
|---|
| C03 | 01 | X | SPA | @0 Desarrollo logicial @5 01 |
|---|
| C03 | 02 | X | FRE | @0 Spécification formelle @5 02 |
|---|
| C03 | 02 | X | ENG | @0 Formal specification @5 02 |
|---|
| C03 | 02 | X | SPA | @0 Especificación formal @5 02 |
|---|
| C03 | 03 | X | FRE | @0 Système réparti @5 06 |
|---|
| C03 | 03 | X | ENG | @0 Distributed system @5 06 |
|---|
| C03 | 03 | X | SPA | @0 Sistema repartido @5 06 |
|---|
| C03 | 04 | X | FRE | @0 Système réactif @5 07 |
|---|
| C03 | 04 | X | ENG | @0 Reactive system @5 07 |
|---|
| C03 | 04 | X | SPA | @0 Sistema reactivo @5 07 |
|---|
| C03 | 05 | X | FRE | @0 Algorithme réparti @5 23 |
|---|
| C03 | 05 | X | ENG | @0 Distributed algorithm @5 23 |
|---|
| C03 | 05 | X | SPA | @0 Algoritmo repartido @5 23 |
|---|
| C03 | 06 | X | FRE | @0 Modélisation @5 24 |
|---|
| C03 | 06 | X | ENG | @0 Modeling @5 24 |
|---|
| C03 | 06 | X | SPA | @0 Modelización @5 24 |
|---|
| C03 | 07 | X | FRE | @0 Ajustement modèle @5 25 |
|---|
| C03 | 07 | X | ENG | @0 Model matching @5 25 |
|---|
| C03 | 07 | X | SPA | @0 Ajustamiento modelo @5 25 |
|---|
| C03 | 08 | X | FRE | @0 Election leader @5 26 |
|---|
| C03 | 08 | X | ENG | @0 Leader election @5 26 |
|---|
| C03 | 08 | X | SPA | @0 Elección jefe @5 26 |
|---|
| N21 | | | | @1 052 |
|---|
| N44 | 01 | | | @1 OTO |
|---|
| N82 | | | | @1 OTO |
|---|
|
|---|
| pR |
| A30 | 01 | 1 | ENG | @1 International Conference of B Users @2 7 @3 Besançon FRA @4 2007 |
|---|
|
|---|
Format Inist (serveur)
| NO : | PASCAL 08-0029207 INIST |
|---|
| ET : | Time constraint patterns for event B development |
|---|
| AU : | CANSELL (Dominique); MERY (Dominique); REHM (Joris); JULLIAND (Jacques); KOUCHNARENKO (Olga) |
|---|
| AF : | Université de Metz/France (1 aut.); LORIA BP 239/54506 Vandoevre-lès-Nancy/France (1 aut., 2 aut., 3 aut.); Université Henri Poincaré Nancy/France (2 aut., 3 aut.) |
|---|
| DT : | Publication en série; Congrès; Niveau analytique |
|---|
| SO : | Lecture notes in computer science; ISSN 0302-9743; Allemagne; Da. 2006; Vol. 4355; Pp. 140-154; Bibl. 20 ref. |
|---|
| LA : | Anglais |
|---|
| EA : | Distributed applications are based on algorithms which should be able to deal with time constraints. It is mandatory to express time constraints in (mathematical) models and the current work intends to integrate time constraints in the modelling process based on event B models and refinement. The starting point of our work is the event B development of the IEEE 1394 leader election protocol; from standard documents, we derive temporal requirements to solve the contention problem and we propose a method for introducing time constraints using a pattern. The pattern captures time constraints in a generic event B development and it is applied to the IEEE 1394 case study. |
|---|
| CC : | 001D02B09 |
|---|
| FD : | Développement logiciel; Spécification formelle; Système réparti; Système réactif; Algorithme réparti; Modélisation; Ajustement modèle; Election leader |
|---|
| ED : | Software development; Formal specification; Distributed system; Reactive system; Distributed algorithm; Modeling; Model matching; Leader election |
|---|
| SD : | Desarrollo logicial; Especificación formal; Sistema repartido; Sistema reactivo; Algoritmo repartido; Modelización; Ajustamiento modelo; Elección jefe |
|---|
| LO : | INIST-16343.354000153639230100 |
|---|
| ID : | 08-0029207 |
|---|
Links to Exploration step
Pascal:08-0029207
Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">Time constraint patterns for event B development</title>
<author><name sortKey="Cansell, Dominique" sort="Cansell, Dominique" uniqKey="Cansell D" first="Dominique" last="Cansell">Dominique Cansell</name>
<affiliation><inist:fA14 i1="01"><s1>Université de Metz</s1>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</inist:fA14><affiliation><inist:fA14 i1="02"><s1>LORIA BP 239</s1>
<s2>54506 Vandoevre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14><author><name sortKey="Mery, Dominique" sort="Mery, Dominique" uniqKey="Mery D" first="Dominique" last="Mery">Dominique Mery</name>
<affiliation><inist:fA14 i1="02"><s1>LORIA BP 239</s1>
<s2>54506 Vandoevre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14><affiliation><inist:fA14 i1="03"><s1>Université Henri Poincaré Nancy</s1>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14><author><name sortKey="Rehm, Joris" sort="Rehm, Joris" uniqKey="Rehm J" first="Joris" last="Rehm">Joris Rehm</name>
<affiliation><inist:fA14 i1="02"><s1>LORIA BP 239</s1>
<s2>54506 Vandoevre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14><affiliation><inist:fA14 i1="03"><s1>Université Henri Poincaré Nancy</s1>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14><publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">08-0029207</idno>
<date when="2006">2006</date>
<idno type="stanalyst">PASCAL 08-0029207 INIST</idno>
<idno type="RBID">Pascal:08-0029207</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000353</idno>
</publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">Time constraint patterns for event B development</title>
<author><name sortKey="Cansell, Dominique" sort="Cansell, Dominique" uniqKey="Cansell D" first="Dominique" last="Cansell">Dominique Cansell</name>
<affiliation><inist:fA14 i1="01"><s1>Université de Metz</s1>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</inist:fA14><affiliation><inist:fA14 i1="02"><s1>LORIA BP 239</s1>
<s2>54506 Vandoevre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14><author><name sortKey="Mery, Dominique" sort="Mery, Dominique" uniqKey="Mery D" first="Dominique" last="Mery">Dominique Mery</name>
<affiliation><inist:fA14 i1="02"><s1>LORIA BP 239</s1>
<s2>54506 Vandoevre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14><affiliation><inist:fA14 i1="03"><s1>Université Henri Poincaré Nancy</s1>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14><author><name sortKey="Rehm, Joris" sort="Rehm, Joris" uniqKey="Rehm J" first="Joris" last="Rehm">Joris Rehm</name>
<affiliation><inist:fA14 i1="02"><s1>LORIA BP 239</s1>
<s2>54506 Vandoevre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14><affiliation><inist:fA14 i1="03"><s1>Université Henri Poincaré Nancy</s1>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14><series><title level="j" type="main">Lecture notes in computer science</title>
<idno type="ISSN">0302-9743</idno>
<imprint><date when="2006">2006</date>
</imprint><seriesStmt><title level="j" type="main">Lecture notes in computer science</title>
<idno type="ISSN">0302-9743</idno>
</seriesStmt><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Distributed algorithm</term>
<term>Distributed system</term>
<term>Formal specification</term>
<term>Leader election</term>
<term>Model matching</term>
<term>Modeling</term>
<term>Reactive system</term>
<term>Software development</term>
</keywords><keywords scheme="Pascal" xml:lang="fr"><term>Développement logiciel</term>
<term>Spécification formelle</term>
<term>Système réparti</term>
<term>Système réactif</term>
<term>Algorithme réparti</term>
<term>Modélisation</term>
<term>Ajustement modèle</term>
<term>Election leader</term>
</keywords><front><div type="abstract" xml:lang="en">Distributed applications are based on algorithms which should be able to deal with time constraints. It is mandatory to express time constraints in (mathematical) models and the current work intends to integrate time constraints in the modelling process based on event B models and refinement. The starting point of our work is the event B development of the IEEE 1394 leader election protocol; from standard documents, we derive temporal requirements to solve the contention problem and we propose a method for introducing time constraints using a pattern. The pattern captures time constraints in a generic event B development and it is applied to the IEEE 1394 case study.</div>
</front><inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>0302-9743</s0>
</fA01><fA05><s2>4355</s2>
</fA05><fA08 i1="01" i2="1" l="ENG"><s1>Time constraint patterns for event B development</s1>
</fA08><fA09 i1="01" i2="1" l="ENG"><s1>B 2007 : formal specification and development in B : 7th international conference of B users, Besançon, France, January 17-19, 2007 : proceedings</s1>
</fA09><fA11 i1="01" i2="1"><s1>CANSELL (Dominique)</s1>
</fA11><fA11 i1="02" i2="1"><s1>MERY (Dominique)</s1>
</fA11><fA11 i1="03" i2="1"><s1>REHM (Joris)</s1>
</fA11><fA12 i1="01" i2="1"><s1>JULLIAND (Jacques)</s1>
<s9>ed.</s9>
</fA12><fA12 i1="02" i2="1"><s1>KOUCHNARENKO (Olga)</s1>
<s9>ed.</s9>
</fA12><fA14 i1="01"><s1>Université de Metz</s1>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</fA14><fA14 i1="02"><s1>LORIA BP 239</s1>
<s2>54506 Vandoevre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</fA14><fA14 i1="03"><s1>Université Henri Poincaré Nancy</s1>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</fA14><fA20><s1>140-154</s1>
</fA20><fA21><s1>2006</s1>
</fA21><fA23 i1="01"><s0>ENG</s0>
</fA23><fA26 i1="01"><s0>978-3-540-68760-3</s0>
</fA26><fA43 i1="01"><s1>INIST</s1>
<s2>16343</s2>
<s5>354000153639230100</s5>
</fA43><fA44><s0>0000</s0>
<s1>© 2008 INIST-CNRS. All rights reserved.</s1>
</fA44><fA45><s0>20 ref.</s0>
</fA45><fA47 i1="01" i2="1"><s0>08-0029207</s0>
</fA47><fA60><s1>P</s1>
<s2>C</s2>
</fA60><fA64 i1="01" i2="1"><s0>Lecture notes in computer science</s0>
</fA64><fA66 i1="01"><s0>DEU</s0>
</fA66><fC01 i1="01" l="ENG"><s0>Distributed applications are based on algorithms which should be able to deal with time constraints. It is mandatory to express time constraints in (mathematical) models and the current work intends to integrate time constraints in the modelling process based on event B models and refinement. The starting point of our work is the event B development of the IEEE 1394 leader election protocol; from standard documents, we derive temporal requirements to solve the contention problem and we propose a method for introducing time constraints using a pattern. The pattern captures time constraints in a generic event B development and it is applied to the IEEE 1394 case study.</s0>
</fC01><fC02 i1="01" i2="X"><s0>001D02B09</s0>
</fC02><fC03 i1="01" i2="X" l="FRE"><s0>Développement logiciel</s0>
<s5>01</s5>
</fC03><fC03 i1="01" i2="X" l="ENG"><s0>Software development</s0>
<s5>01</s5>
</fC03><fC03 i1="01" i2="X" l="SPA"><s0>Desarrollo logicial</s0>
<s5>01</s5>
</fC03><fC03 i1="02" i2="X" l="FRE"><s0>Spécification formelle</s0>
<s5>02</s5>
</fC03><fC03 i1="02" i2="X" l="ENG"><s0>Formal specification</s0>
<s5>02</s5>
</fC03><fC03 i1="02" i2="X" l="SPA"><s0>Especificación formal</s0>
<s5>02</s5>
</fC03><fC03 i1="03" i2="X" l="FRE"><s0>Système réparti</s0>
<s5>06</s5>
</fC03><fC03 i1="03" i2="X" l="ENG"><s0>Distributed system</s0>
<s5>06</s5>
</fC03><fC03 i1="03" i2="X" l="SPA"><s0>Sistema repartido</s0>
<s5>06</s5>
</fC03><fC03 i1="04" i2="X" l="FRE"><s0>Système réactif</s0>
<s5>07</s5>
</fC03><fC03 i1="04" i2="X" l="ENG"><s0>Reactive system</s0>
<s5>07</s5>
</fC03><fC03 i1="04" i2="X" l="SPA"><s0>Sistema reactivo</s0>
<s5>07</s5>
</fC03><fC03 i1="05" i2="X" l="FRE"><s0>Algorithme réparti</s0>
<s5>23</s5>
</fC03><fC03 i1="05" i2="X" l="ENG"><s0>Distributed algorithm</s0>
<s5>23</s5>
</fC03><fC03 i1="05" i2="X" l="SPA"><s0>Algoritmo repartido</s0>
<s5>23</s5>
</fC03><fC03 i1="06" i2="X" l="FRE"><s0>Modélisation</s0>
<s5>24</s5>
</fC03><fC03 i1="06" i2="X" l="ENG"><s0>Modeling</s0>
<s5>24</s5>
</fC03><fC03 i1="06" i2="X" l="SPA"><s0>Modelización</s0>
<s5>24</s5>
</fC03><fC03 i1="07" i2="X" l="FRE"><s0>Ajustement modèle</s0>
<s5>25</s5>
</fC03><fC03 i1="07" i2="X" l="ENG"><s0>Model matching</s0>
<s5>25</s5>
</fC03><fC03 i1="07" i2="X" l="SPA"><s0>Ajustamiento modelo</s0>
<s5>25</s5>
</fC03><fC03 i1="08" i2="X" l="FRE"><s0>Election leader</s0>
<s5>26</s5>
</fC03><fC03 i1="08" i2="X" l="ENG"><s0>Leader election</s0>
<s5>26</s5>
</fC03><fC03 i1="08" i2="X" l="SPA"><s0>Elección jefe</s0>
<s5>26</s5>
</fC03><fN21><s1>052</s1>
</fN21><fN44 i1="01"><s1>OTO</s1>
</fN44><fN82><s1>OTO</s1>
</fN82><pR><fA30 i1="01" i2="1" l="ENG"><s1>International Conference of B Users</s1>
<s2>7</s2>
<s3>Besançon FRA</s3>
<s4>2007</s4>
</fA30><server><NO>PASCAL 08-0029207 INIST</NO>
<ET>Time constraint patterns for event B development</ET>
<AU>CANSELL (Dominique); MERY (Dominique); REHM (Joris); JULLIAND (Jacques); KOUCHNARENKO (Olga)</AU>
<AF>Université de Metz/France (1 aut.); LORIA BP 239/54506 Vandoevre-lès-Nancy/France (1 aut., 2 aut., 3 aut.); Université Henri Poincaré Nancy/France (2 aut., 3 aut.)</AF>
<DT>Publication en série; Congrès; Niveau analytique</DT>
<SO>Lecture notes in computer science; ISSN 0302-9743; Allemagne; Da. 2006; Vol. 4355; Pp. 140-154; Bibl. 20 ref.</SO>
<LA>Anglais</LA>
<EA>Distributed applications are based on algorithms which should be able to deal with time constraints. It is mandatory to express time constraints in (mathematical) models and the current work intends to integrate time constraints in the modelling process based on event B models and refinement. The starting point of our work is the event B development of the IEEE 1394 leader election protocol; from standard documents, we derive temporal requirements to solve the contention problem and we propose a method for introducing time constraints using a pattern. The pattern captures time constraints in a generic event B development and it is applied to the IEEE 1394 case study.</EA>
<CC>001D02B09</CC>
<FD>Développement logiciel; Spécification formelle; Système réparti; Système réactif; Algorithme réparti; Modélisation; Ajustement modèle; Election leader</FD>
<ED>Software development; Formal specification; Distributed system; Reactive system; Distributed algorithm; Modeling; Model matching; Leader election</ED>
<SD>Desarrollo logicial; Especificación formal; Sistema repartido; Sistema reactivo; Algoritmo repartido; Modelización; Ajustamiento modelo; Elección jefe</SD>
<LO>INIST-16343.354000153639230100</LO>
<ID>08-0029207</ID>
</server>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/PascalFrancis/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000353 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Corpus/biblio.hfd -nk 000353 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= PascalFrancis
|étape= Corpus
|type= RBID
|clé= Pascal:08-0029207
|texte= Time constraint patterns for event B development
}}
| 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 |  |
