InforLorV4, PascalFrancis, Corpus, bibRecord, 000C86

A Markovian concurrency measure

Identifieur interne : 000C86 ( PascalFrancis/Corpus ); précédent : 000C85; suivant : 000C87

A Markovian concurrency measure

Auteurs : D. Geniet ; R. Schott ; L. Thimonier

Source :

Informatique théorique et applications [ 0988-3754 ] ; 1996.

RBID : Pascal:97-0057725

Descripteurs français

Pascal (Inist)
- Système traitement parallèle, Simultanéité informatique, Chaîne Markov, Automate.

English descriptors

KwdEn :
- Automaton, Concurrency, Markov chain, Parallel processing systems.

Abstract

We show how to modelize concurrency between several processors in terms of automata and Markov chains; then, we define a concurrency measure which reflects more faithfully the behaviour of the processes and is in addition easy to compute with a symbolic manipulator like Maple (this is an improvement over a previous measure [3] whose computation appears to be expensive.

Notice en format standard (ISO 2709)

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

A01	`01`	`1`		`@0 0988-3754`
A02	`01`			`@0 RITAE4`
A03		`1`		`@0 Inform. théor. appl.`
A05				`@2 30`
A06				`@2 4`
A08	`01`	`1`	`ENG`	`@1 A Markovian concurrency measure`
A11	`01`	`1`		`@1 GENIET (D.)`
A11	`02`	`1`		`@1 SCHOTT (R.)`
A11	`03`	`1`		`@1 THIMONIER (L.)`
A14	`01`			`@1 LISI-ENSMA, Téléport 2, Site du Futuroscope @2 86960 Futuroscope @3 FRA @Z 1 aut.`
A14	`02`			`@1 CRIN, Université Nancy-I @2 54506 Vandœuvre-lés-Nancy @3 FRA @Z 2 aut.`
A14	`03`			`@1 LIFIA, UFR Maths Informatique, Université de Picardie, 33, rue Saint-Leu @2 80039 Amiens @3 FRA @Z 3 aut.`
A20				`@1 295-304`
A21				`@1 1996`
A23	`01`			`@0 ENG`
A24	`01`			`@0 fre`
A43	`01`			`@1 INIST @2 9323B2 @5 354000061137250010`
A44				`@0 0000 @1 © 1997 INIST-CNRS. All rights reserved.`
A45				`@0 14 ref.`
A47	`01`	`1`		`@0 97-0057725`
A60				`@1 P`
A61				`@0 A`
A64	`01`	`1`		`@0 Informatique théorique et applications`
A66	`01`			`@0 FRA`
C01	`01`		`ENG`	`@0 We show how to modelize concurrency between several processors in terms of automata and Markov chains; then, we define a concurrency measure which reflects more faithfully the behaviour of the processes and is in addition easy to compute with a symbolic manipulator like Maple (this is an improvement over a previous measure [3] whose computation appears to be expensive.`
C02	`01`	`X`		`@0 001D02A03`
C02	`02`	`X`		`@0 001D02A05`
C03	`01`	`1`	`FRE`	`@0 Système traitement parallèle @3 P @5 01`
C03	`01`	`1`	`ENG`	`@0 Parallel processing systems @3 P @5 01`
C03	`02`	`X`	`FRE`	`@0 Simultanéité informatique @5 37`
C03	`02`	`X`	`ENG`	`@0 Concurrency @5 37`
C03	`02`	`X`	`SPA`	`@0 Simultaneidad informatica @5 37`
C03	`03`	`X`	`FRE`	`@0 Chaîne Markov @5 38`
C03	`03`	`X`	`ENG`	`@0 Markov chain @5 38`
C03	`03`	`X`	`SPA`	`@0 Cadena Markov @5 38`
C03	`04`	`X`	`FRE`	`@0 Automate @5 39`
C03	`04`	`X`	`ENG`	`@0 Automaton @5 39`
C03	`04`	`X`	`SPA`	`@0 Autómata @5 39`
N21				`@1 027`

Format Inist (serveur)

NO :	PASCAL 97-0057725 INIST
ET :	A Markovian concurrency measure
AU :	GENIET (D.); SCHOTT (R.); THIMONIER (L.)
AF :	LISI-ENSMA, Téléport 2, Site du Futuroscope/86960 Futuroscope/France (1 aut.); CRIN, Université Nancy-I/54506 Vandœuvre-lés-Nancy/France (2 aut.); LIFIA, UFR Maths Informatique, Université de Picardie, 33, rue Saint-Leu/80039 Amiens/France (3 aut.)
DT :	Publication en série; Niveau analytique
SO :	Informatique théorique et applications; ISSN 0988-3754; Coden RITAE4; France; Da. 1996; Vol. 30; No. 4; Pp. 295-304; Abs. français; Bibl. 14 ref.
LA :	Anglais
EA :	We show how to modelize concurrency between several processors in terms of automata and Markov chains; then, we define a concurrency measure which reflects more faithfully the behaviour of the processes and is in addition easy to compute with a symbolic manipulator like Maple (this is an improvement over a previous measure [3] whose computation appears to be expensive.
CC :	001D02A03; 001D02A05
FD :	Système traitement parallèle; Simultanéité informatique; Chaîne Markov; Automate
ED :	Parallel processing systems; Concurrency; Markov chain; Automaton
SD :	Simultaneidad informatica; Cadena Markov; Autómata
LO :	INIST-9323B2.354000061137250010
ID :	97-0057725

Links to Exploration step

Pascal:97-0057725

Le document en format XML

<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">A Markovian concurrency measure</title>
<author><name sortKey="Geniet, D" sort="Geniet, D" uniqKey="Geniet D" first="D." last="Geniet">D. Geniet</name>
<affiliation><inist:fA14 i1="01"><s1>LISI-ENSMA, Téléport 2, Site du Futuroscope</s1>
<s2>86960 Futuroscope</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Schott, R" sort="Schott, R" uniqKey="Schott R" first="R." last="Schott">R. Schott</name>
<affiliation><inist:fA14 i1="02"><s1>CRIN, Université Nancy-I</s1>
<s2>54506 Vandœuvre-lés-Nancy</s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Thimonier, L" sort="Thimonier, L" uniqKey="Thimonier L" first="L." last="Thimonier">L. Thimonier</name>
<affiliation><inist:fA14 i1="03"><s1>LIFIA, UFR Maths Informatique, Université de Picardie, 33, rue Saint-Leu</s1>
<s2>80039 Amiens</s2>
<s3>FRA</s3>
<sZ>3 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">97-0057725</idno>
<date when="1996">1996</date>
<idno type="stanalyst">PASCAL 97-0057725 INIST</idno>
<idno type="RBID">Pascal:97-0057725</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000C86</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">A Markovian concurrency measure</title>
<author><name sortKey="Geniet, D" sort="Geniet, D" uniqKey="Geniet D" first="D." last="Geniet">D. Geniet</name>
<affiliation><inist:fA14 i1="01"><s1>LISI-ENSMA, Téléport 2, Site du Futuroscope</s1>
<s2>86960 Futuroscope</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Schott, R" sort="Schott, R" uniqKey="Schott R" first="R." last="Schott">R. Schott</name>
<affiliation><inist:fA14 i1="02"><s1>CRIN, Université Nancy-I</s1>
<s2>54506 Vandœuvre-lés-Nancy</s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Thimonier, L" sort="Thimonier, L" uniqKey="Thimonier L" first="L." last="Thimonier">L. Thimonier</name>
<affiliation><inist:fA14 i1="03"><s1>LIFIA, UFR Maths Informatique, Université de Picardie, 33, rue Saint-Leu</s1>
<s2>80039 Amiens</s2>
<s3>FRA</s3>
<sZ>3 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
</analytic>
<series><title level="j" type="main">Informatique théorique et applications</title>
<title level="j" type="abbreviated">Inform. théor. appl.</title>
<idno type="ISSN">0988-3754</idno>
<imprint><date when="1996">1996</date>
</imprint>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt><title level="j" type="main">Informatique théorique et applications</title>
<title level="j" type="abbreviated">Inform. théor. appl.</title>
<idno type="ISSN">0988-3754</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Automaton</term>
<term>Concurrency</term>
<term>Markov chain</term>
<term>Parallel processing systems</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr"><term>Système traitement parallèle</term>
<term>Simultanéité informatique</term>
<term>Chaîne Markov</term>
<term>Automate</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">We show how to modelize concurrency between several processors in terms of automata and Markov chains; then, we define a concurrency measure which reflects more faithfully the behaviour of the processes and is in addition easy to compute with a symbolic manipulator like Maple (this is an improvement over a previous measure [3] whose computation appears to be expensive.</div>
</front>
</TEI>
<inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>0988-3754</s0>
</fA01>
<fA02 i1="01"><s0>RITAE4</s0>
</fA02>
<fA03 i2="1"><s0>Inform. théor. appl.</s0>
</fA03>
<fA05><s2>30</s2>
</fA05>
<fA06><s2>4</s2>
</fA06>
<fA08 i1="01" i2="1" l="ENG"><s1>A Markovian concurrency measure</s1>
</fA08>
<fA11 i1="01" i2="1"><s1>GENIET (D.)</s1>
</fA11>
<fA11 i1="02" i2="1"><s1>SCHOTT (R.)</s1>
</fA11>
<fA11 i1="03" i2="1"><s1>THIMONIER (L.)</s1>
</fA11>
<fA14 i1="01"><s1>LISI-ENSMA, Téléport 2, Site du Futuroscope</s1>
<s2>86960 Futuroscope</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</fA14>
<fA14 i1="02"><s1>CRIN, Université Nancy-I</s1>
<s2>54506 Vandœuvre-lés-Nancy</s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
</fA14>
<fA14 i1="03"><s1>LIFIA, UFR Maths Informatique, Université de Picardie, 33, rue Saint-Leu</s1>
<s2>80039 Amiens</s2>
<s3>FRA</s3>
<sZ>3 aut.</sZ>
</fA14>
<fA20><s1>295-304</s1>
</fA20>
<fA21><s1>1996</s1>
</fA21>
<fA23 i1="01"><s0>ENG</s0>
</fA23>
<fA24 i1="01"><s0>fre</s0>
</fA24>
<fA43 i1="01"><s1>INIST</s1>
<s2>9323B2</s2>
<s5>354000061137250010</s5>
</fA43>
<fA44><s0>0000</s0>
<s1>© 1997 INIST-CNRS. All rights reserved.</s1>
</fA44>
<fA45><s0>14 ref.</s0>
</fA45>
<fA47 i1="01" i2="1"><s0>97-0057725</s0>
</fA47>
<fA60><s1>P</s1>
</fA60>
<fA61><s0>A</s0>
</fA61>
<fA64 i1="01" i2="1"><s0>Informatique théorique et applications</s0>
</fA64>
<fA66 i1="01"><s0>FRA</s0>
</fA66>
<fC01 i1="01" l="ENG"><s0>We show how to modelize concurrency between several processors in terms of automata and Markov chains; then, we define a concurrency measure which reflects more faithfully the behaviour of the processes and is in addition easy to compute with a symbolic manipulator like Maple (this is an improvement over a previous measure [3] whose computation appears to be expensive.</s0>
</fC01>
<fC02 i1="01" i2="X"><s0>001D02A03</s0>
</fC02>
<fC02 i1="02" i2="X"><s0>001D02A05</s0>
</fC02>
<fC03 i1="01" i2="1" l="FRE"><s0>Système traitement parallèle</s0>
<s3>P</s3>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="1" l="ENG"><s0>Parallel processing systems</s0>
<s3>P</s3>
<s5>01</s5>
</fC03>
<fC03 i1="02" i2="X" l="FRE"><s0>Simultanéité informatique</s0>
<s5>37</s5>
</fC03>
<fC03 i1="02" i2="X" l="ENG"><s0>Concurrency</s0>
<s5>37</s5>
</fC03>
<fC03 i1="02" i2="X" l="SPA"><s0>Simultaneidad informatica</s0>
<s5>37</s5>
</fC03>
<fC03 i1="03" i2="X" l="FRE"><s0>Chaîne Markov</s0>
<s5>38</s5>
</fC03>
<fC03 i1="03" i2="X" l="ENG"><s0>Markov chain</s0>
<s5>38</s5>
</fC03>
<fC03 i1="03" i2="X" l="SPA"><s0>Cadena Markov</s0>
<s5>38</s5>
</fC03>
<fC03 i1="04" i2="X" l="FRE"><s0>Automate</s0>
<s5>39</s5>
</fC03>
<fC03 i1="04" i2="X" l="ENG"><s0>Automaton</s0>
<s5>39</s5>
</fC03>
<fC03 i1="04" i2="X" l="SPA"><s0>Autómata</s0>
<s5>39</s5>
</fC03>
<fN21><s1>027</s1>
</fN21>
</pA>
</standard>
<server><NO>PASCAL 97-0057725 INIST</NO>
<ET>A Markovian concurrency measure</ET>
<AU>GENIET (D.); SCHOTT (R.); THIMONIER (L.)</AU>
<AF>LISI-ENSMA, Téléport 2, Site du Futuroscope/86960 Futuroscope/France (1 aut.); CRIN, Université Nancy-I/54506 Vandœuvre-lés-Nancy/France (2 aut.); LIFIA, UFR Maths Informatique, Université de Picardie, 33, rue Saint-Leu/80039 Amiens/France (3 aut.)</AF>
<DT>Publication en série; Niveau analytique</DT>
<SO>Informatique théorique et applications; ISSN 0988-3754; Coden RITAE4; France; Da. 1996; Vol. 30; No. 4; Pp. 295-304; Abs. français; Bibl. 14 ref.</SO>
<LA>Anglais</LA>
<EA>We show how to modelize concurrency between several processors in terms of automata and Markov chains; then, we define a concurrency measure which reflects more faithfully the behaviour of the processes and is in addition easy to compute with a symbolic manipulator like Maple (this is an improvement over a previous measure [3] whose computation appears to be expensive.</EA>
<CC>001D02A03; 001D02A05</CC>
<FD>Système traitement parallèle; Simultanéité informatique; Chaîne Markov; Automate</FD>
<ED>Parallel processing systems; Concurrency; Markov chain; Automaton</ED>
<SD>Simultaneidad informatica; Cadena Markov; Autómata</SD>
<LO>INIST-9323B2.354000061137250010</LO>
<ID>97-0057725</ID>
</server>
</inist>
</record>

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 000C86 | SxmlIndent | more

HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Corpus/biblio.hfd -nk 000C86 | 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:97-0057725
   |texte=   A Markovian concurrency measure
}}

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

A Markovian concurrency measure

A Markovian concurrency measure

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