InforLorV4, PascalFrancis, Corpus, bibRecord, 000388

Proving positive almost sure termination under strategies

Identifieur interne : 000388 ( PascalFrancis/Corpus ); précédent : 000387; suivant : 000389

Proving positive almost sure termination under strategies

Auteurs : Olivier Bournez ; Florent Garnier

Source :

Lecture notes in computer science [ 0302-9743 ] ; 2006.

RBID : Pascal:07-0517966

Descripteurs français

Pascal (Inist)
- Réécriture, Système réécriture, Problème terminaison, Approche probabiliste, Modélisation, ..

English descriptors

KwdEn :
- Modeling, Probabilistic approach, Rewriting, Rewriting systems, Termination problem.

Abstract

In last RTA, we introduced the notion of probabilistic rewrite systems and we gave some conditions entailing termination of those systems within a finite mean number of reduction steps. Termination was considered under arbitrary unrestricted policies. Policies correspond to strategies for non-probabilistic rewrite systems. This is often natural or more useful to restrict policies to a subclass. We introduce the notion of positive almost sure termination under strategies, and we provide sufficient criteria to prove termination of a given probabilitic rewrite system under strategies. This is illustrated with several examples.

Notice en format standard (ISO 2709)

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

A01	`01`	`1`		`@0 0302-9743`
A05				`@2 4098`
A08	`01`	`1`	`ENG`	`@1 Proving positive almost sure termination under strategies`
A09	`01`	`1`	`ENG`	`@1 Term rewriting and applications : 17th international conference, RTA 2006, Seattle, WA, USA, August 12-14, 2006 : proceedings`
A11	`01`	`1`		`@1 BOURNEZ (Olivier)`
A11	`02`	`1`		`@1 GARNIER (Florent)`
A12	`01`	`1`		`@1 PFENNING (Frank) @9 ed.`
A14	`01`			`@1 LORIA/INRIA, 615 Rue du Jardin Botanique @2 54602 Villers lès Nancy @3 FRA @Z 1 aut. @Z 2 aut.`
A20				`@1 357-371`
A21				`@1 2006`
A23	`01`			`@0 ENG`
A26	`01`			`@0 3-540-36834-5`
A43	`01`			`@1 INIST @2 16343 @5 354000153621310270`
A44				`@0 0000 @1 © 2007 INIST-CNRS. All rights reserved.`
A45				`@0 27 ref.`
A47	`01`	`1`		`@0 07-0517966`
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 In last RTA, we introduced the notion of probabilistic rewrite systems and we gave some conditions entailing termination of those systems within a finite mean number of reduction steps. Termination was considered under arbitrary unrestricted policies. Policies correspond to strategies for non-probabilistic rewrite systems. This is often natural or more useful to restrict policies to a subclass. We introduce the notion of positive almost sure termination under strategies, and we provide sufficient criteria to prove termination of a given probabilitic rewrite system under strategies. This is illustrated with several examples.
C02	`01`	`X`		`@0 001D02B02`
C03	`01`	`X`	`FRE`	`@0 Réécriture @5 01`
C03	`01`	`X`	`ENG`	`@0 Rewriting @5 01`
C03	`01`	`X`	`SPA`	`@0 Reescritura @5 01`
C03	`02`	`3`	`FRE`	`@0 Système réécriture @5 06`
C03	`02`	`3`	`ENG`	`@0 Rewriting systems @5 06`
C03	`03`	`X`	`FRE`	`@0 Problème terminaison @5 23`
C03	`03`	`X`	`ENG`	`@0 Termination problem @5 23`
C03	`03`	`X`	`SPA`	`@0 Problema terminación @5 23`
C03	`04`	`X`	`FRE`	`@0 Approche probabiliste @5 24`
C03	`04`	`X`	`ENG`	`@0 Probabilistic approach @5 24`
C03	`04`	`X`	`SPA`	`@0 Enfoque probabilista @5 24`
C03	`05`	`X`	`FRE`	`@0 Modélisation @5 25`
C03	`05`	`X`	`ENG`	`@0 Modeling @5 25`
C03	`05`	`X`	`SPA`	`@0 Modelización @5 25`
C03	`06`	`X`	`FRE`	`@0 . @4 INC @5 82`
N21				`@1 337`
N44	`01`			`@1 OTO`
N82				`@1 OTO`

A30	`01`	`1`	`ENG`	`@1 International Conference on Rewriting Techniques and Applications @2 17 @3 Seattle WA USA @4 2006`

Format Inist (serveur)

NO :	PASCAL 07-0517966 INIST
ET :	Proving positive almost sure termination under strategies
AU :	BOURNEZ (Olivier); GARNIER (Florent); PFENNING (Frank)
AF :	LORIA/INRIA, 615 Rue du Jardin Botanique/54602 Villers lès Nancy/France (1 aut., 2 aut.)
DT :	Publication en série; Congrès; Niveau analytique
SO :	Lecture notes in computer science; ISSN 0302-9743; Allemagne; Da. 2006; Vol. 4098; Pp. 357-371; Bibl. 27 ref.
LA :	Anglais
EA :	In last RTA, we introduced the notion of probabilistic rewrite systems and we gave some conditions entailing termination of those systems within a finite mean number of reduction steps. Termination was considered under arbitrary unrestricted policies. Policies correspond to strategies for non-probabilistic rewrite systems. This is often natural or more useful to restrict policies to a subclass. We introduce the notion of positive almost sure termination under strategies, and we provide sufficient criteria to prove termination of a given probabilitic rewrite system under strategies. This is illustrated with several examples.
CC :	001D02B02
FD :	Réécriture; Système réécriture; Problème terminaison; Approche probabiliste; Modélisation; .
ED :	Rewriting; Rewriting systems; Termination problem; Probabilistic approach; Modeling
SD :	Reescritura; Problema terminación; Enfoque probabilista; Modelización
LO :	INIST-16343.354000153621310270
ID :	07-0517966

Links to Exploration step

Pascal:07-0517966

Le document en format XML

<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">Proving positive almost sure termination under strategies</title>
<author><name sortKey="Bournez, Olivier" sort="Bournez, Olivier" uniqKey="Bournez O" first="Olivier" last="Bournez">Olivier Bournez</name>
<affiliation><inist:fA14 i1="01"><s1>LORIA/INRIA, 615 Rue du Jardin Botanique</s1>
<s2>54602 Villers lès Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Garnier, Florent" sort="Garnier, Florent" uniqKey="Garnier F" first="Florent" last="Garnier">Florent Garnier</name>
<affiliation><inist:fA14 i1="01"><s1>LORIA/INRIA, 615 Rue du Jardin Botanique</s1>
<s2>54602 Villers lès Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">07-0517966</idno>
<date when="2006">2006</date>
<idno type="stanalyst">PASCAL 07-0517966 INIST</idno>
<idno type="RBID">Pascal:07-0517966</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000388</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">Proving positive almost sure termination under strategies</title>
<author><name sortKey="Bournez, Olivier" sort="Bournez, Olivier" uniqKey="Bournez O" first="Olivier" last="Bournez">Olivier Bournez</name>
<affiliation><inist:fA14 i1="01"><s1>LORIA/INRIA, 615 Rue du Jardin Botanique</s1>
<s2>54602 Villers lès Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Garnier, Florent" sort="Garnier, Florent" uniqKey="Garnier F" first="Florent" last="Garnier">Florent Garnier</name>
<affiliation><inist:fA14 i1="01"><s1>LORIA/INRIA, 615 Rue du Jardin Botanique</s1>
<s2>54602 Villers lès Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
</analytic>
<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>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt><title level="j" type="main">Lecture notes in computer science</title>
<idno type="ISSN">0302-9743</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Modeling</term>
<term>Probabilistic approach</term>
<term>Rewriting</term>
<term>Rewriting systems</term>
<term>Termination problem</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr"><term>Réécriture</term>
<term>Système réécriture</term>
<term>Problème terminaison</term>
<term>Approche probabiliste</term>
<term>Modélisation</term>
<term>.</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">In last RTA, we introduced the notion of probabilistic rewrite systems and we gave some conditions entailing termination of those systems within a finite mean number of reduction steps. Termination was considered under arbitrary unrestricted policies. Policies correspond to strategies for non-probabilistic rewrite systems. This is often natural or more useful to restrict policies to a subclass. We introduce the notion of positive almost sure termination under strategies, and we provide sufficient criteria to prove termination of a given probabilitic rewrite system under strategies. This is illustrated with several examples.</div>
</front>
</TEI>
<inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>0302-9743</s0>
</fA01>
<fA05><s2>4098</s2>
</fA05>
<fA08 i1="01" i2="1" l="ENG"><s1>Proving positive almost sure termination under strategies</s1>
</fA08>
<fA09 i1="01" i2="1" l="ENG"><s1>Term rewriting and applications : 17th international conference, RTA 2006, Seattle, WA, USA, August 12-14, 2006 : proceedings</s1>
</fA09>
<fA11 i1="01" i2="1"><s1>BOURNEZ (Olivier)</s1>
</fA11>
<fA11 i1="02" i2="1"><s1>GARNIER (Florent)</s1>
</fA11>
<fA12 i1="01" i2="1"><s1>PFENNING (Frank)</s1>
<s9>ed.</s9>
</fA12>
<fA14 i1="01"><s1>LORIA/INRIA, 615 Rue du Jardin Botanique</s1>
<s2>54602 Villers lès Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
</fA14>
<fA20><s1>357-371</s1>
</fA20>
<fA21><s1>2006</s1>
</fA21>
<fA23 i1="01"><s0>ENG</s0>
</fA23>
<fA26 i1="01"><s0>3-540-36834-5</s0>
</fA26>
<fA43 i1="01"><s1>INIST</s1>
<s2>16343</s2>
<s5>354000153621310270</s5>
</fA43>
<fA44><s0>0000</s0>
<s1>© 2007 INIST-CNRS. All rights reserved.</s1>
</fA44>
<fA45><s0>27 ref.</s0>
</fA45>
<fA47 i1="01" i2="1"><s0>07-0517966</s0>
</fA47>
<fA60><s1>P</s1>
<s2>C</s2>
</fA60>
<fA61><s0>A</s0>
</fA61>
<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>In last RTA, we introduced the notion of probabilistic rewrite systems and we gave some conditions entailing termination of those systems within a finite mean number of reduction steps. Termination was considered under arbitrary unrestricted policies. Policies correspond to strategies for non-probabilistic rewrite systems. This is often natural or more useful to restrict policies to a subclass. We introduce the notion of positive almost sure termination under strategies, and we provide sufficient criteria to prove termination of a given probabilitic rewrite system under strategies. This is illustrated with several examples.</s0>
</fC01>
<fC02 i1="01" i2="X"><s0>001D02B02</s0>
</fC02>
<fC03 i1="01" i2="X" l="FRE"><s0>Réécriture</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="X" l="ENG"><s0>Rewriting</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="X" l="SPA"><s0>Reescritura</s0>
<s5>01</s5>
</fC03>
<fC03 i1="02" i2="3" l="FRE"><s0>Système réécriture</s0>
<s5>06</s5>
</fC03>
<fC03 i1="02" i2="3" l="ENG"><s0>Rewriting systems</s0>
<s5>06</s5>
</fC03>
<fC03 i1="03" i2="X" l="FRE"><s0>Problème terminaison</s0>
<s5>23</s5>
</fC03>
<fC03 i1="03" i2="X" l="ENG"><s0>Termination problem</s0>
<s5>23</s5>
</fC03>
<fC03 i1="03" i2="X" l="SPA"><s0>Problema terminación</s0>
<s5>23</s5>
</fC03>
<fC03 i1="04" i2="X" l="FRE"><s0>Approche probabiliste</s0>
<s5>24</s5>
</fC03>
<fC03 i1="04" i2="X" l="ENG"><s0>Probabilistic approach</s0>
<s5>24</s5>
</fC03>
<fC03 i1="04" i2="X" l="SPA"><s0>Enfoque probabilista</s0>
<s5>24</s5>
</fC03>
<fC03 i1="05" i2="X" l="FRE"><s0>Modélisation</s0>
<s5>25</s5>
</fC03>
<fC03 i1="05" i2="X" l="ENG"><s0>Modeling</s0>
<s5>25</s5>
</fC03>
<fC03 i1="05" i2="X" l="SPA"><s0>Modelización</s0>
<s5>25</s5>
</fC03>
<fC03 i1="06" i2="X" l="FRE"><s0>.</s0>
<s4>INC</s4>
<s5>82</s5>
</fC03>
<fN21><s1>337</s1>
</fN21>
<fN44 i1="01"><s1>OTO</s1>
</fN44>
<fN82><s1>OTO</s1>
</fN82>
</pA>
<pR><fA30 i1="01" i2="1" l="ENG"><s1>International Conference on Rewriting Techniques and Applications</s1>
<s2>17</s2>
<s3>Seattle WA USA</s3>
<s4>2006</s4>
</fA30>
</pR>
</standard>
<server><NO>PASCAL 07-0517966 INIST</NO>
<ET>Proving positive almost sure termination under strategies</ET>
<AU>BOURNEZ (Olivier); GARNIER (Florent); PFENNING (Frank)</AU>
<AF>LORIA/INRIA, 615 Rue du Jardin Botanique/54602 Villers lès Nancy/France (1 aut., 2 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. 4098; Pp. 357-371; Bibl. 27 ref.</SO>
<LA>Anglais</LA>
<EA>In last RTA, we introduced the notion of probabilistic rewrite systems and we gave some conditions entailing termination of those systems within a finite mean number of reduction steps. Termination was considered under arbitrary unrestricted policies. Policies correspond to strategies for non-probabilistic rewrite systems. This is often natural or more useful to restrict policies to a subclass. We introduce the notion of positive almost sure termination under strategies, and we provide sufficient criteria to prove termination of a given probabilitic rewrite system under strategies. This is illustrated with several examples.</EA>
<CC>001D02B02</CC>
<FD>Réécriture; Système réécriture; Problème terminaison; Approche probabiliste; Modélisation; .</FD>
<ED>Rewriting; Rewriting systems; Termination problem; Probabilistic approach; Modeling</ED>
<SD>Reescritura; Problema terminación; Enfoque probabilista; Modelización</SD>
<LO>INIST-16343.354000153621310270</LO>
<ID>07-0517966</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 000388 | SxmlIndent | more

HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Corpus/biblio.hfd -nk 000388 | 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:07-0517966
   |texte=   Proving positive almost sure termination under strategies
}}

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

Proving positive almost sure termination under strategies

Proving positive almost sure termination under strategies

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