InforLorV4, PascalFrancis, Corpus, bibRecord, 000C42

A complete axiomatisation for the inclusion of series-parallel partial orders

Identifieur interne : 000C42 ( PascalFrancis/Corpus ); précédent : 000C41; suivant : 000C43

A complete axiomatisation for the inclusion of series-parallel partial orders

Auteurs : D. Bechet ; P. De Groote ; C. Retore

Source :

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

RBID : Pascal:97-0420272

Descripteurs français

Pascal (Inist)
- Informatique théorique, Algorithmique, Théorie graphe.

English descriptors

KwdEn :
- Algorithmics, Computer theory, Graph theory.

Abstract

Series-parallel orders are defined as the least class of partial orders containing the one-element order and closed by ordinal sum and disjoint union. From this inductive definition, it is almost immediate that any series-parallel order may be represented by an algebraic expression, which is unique up to the associativity of ordinal sum and to the associativivity and commutativity of disjoint union. In this paper, we introduce a rewrite system acting on these algebraic expressions that axiomatises completely the sub-ordering relation for the class of series-parallel orders.

Notice en format standard (ISO 2709)

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

A01	`01`	`1`		`@0 0302-9743`
A05				`@2 1232`
A08	`01`	`1`	`ENG`	`@1 A complete axiomatisation for the inclusion of series-parallel partial orders`
A09	`01`	`1`	`ENG`	`@1 RTA-97 : rewriting techniques and applications : Sitges, June 2-5, 1997`
A11	`01`	`1`		`@1 BECHET (D.)`
A11	`02`	`1`		`@1 DE GROOTE (P.)`
A11	`03`	`1`		`@1 RETORE (C.)`
A12	`01`	`1`		`@1 COMON (Hubert) @9 ed.`
A14	`01`			`@1 Projet CALLIGRAMME, INRIA-Lorraine - CRIN - CNRS, 615, rue du Jardin Botanique - B.P. 101 @2 54602 Villers lès Nancy @3 FRA @Z 1 aut. @Z 2 aut. @Z 3 aut.`
A20				`@1 230-240`
A21				`@1 1997`
A23	`01`			`@0 ENG`
A43	`01`			`@1 INIST @2 16343 @5 354000062541800180`
A44				`@0 0000 @1 © 1997 INIST-CNRS. All rights reserved.`
A45				`@0 8 ref.`
A47	`01`	`1`		`@0 97-0420272`
A60				`@1 P @2 C`
A61				`@0 A`
A64	`01`	`1`		`@0 Lecture notes in computer science`
A66	`01`			`@0 DEU`
A66	`02`			`@0 USA`
C01	`01`		`ENG`	@0 Series-parallel orders are defined as the least class of partial orders containing the one-element order and closed by ordinal sum and disjoint union. From this inductive definition, it is almost immediate that any series-parallel order may be represented by an algebraic expression, which is unique up to the associativity of ordinal sum and to the associativivity and commutativity of disjoint union. In this paper, we introduce a rewrite system acting on these algebraic expressions that axiomatises completely the sub-ordering relation for the class of series-parallel orders.
C02	`01`	`X`		`@0 001D02A05`
C03	`01`	`X`	`FRE`	`@0 Informatique théorique @5 01`
C03	`01`	`X`	`ENG`	`@0 Computer theory @5 01`
C03	`01`	`X`	`SPA`	`@0 Informática teórica @5 01`
C03	`02`	`X`	`FRE`	`@0 Algorithmique @5 02`
C03	`02`	`X`	`ENG`	`@0 Algorithmics @5 02`
C03	`02`	`X`	`SPA`	`@0 Algorítmica @5 02`
C03	`03`	`X`	`FRE`	`@0 Théorie graphe @5 03`
C03	`03`	`X`	`ENG`	`@0 Graph theory @5 03`
C03	`03`	`X`	`SPA`	`@0 Teoría grafo @5 03`
N21				`@1 258`

A30	`01`	`1`	`ENG`	`@1 Rewriting techniques and applications. International conference @2 8 @3 Sitges ESP @4 1997-06-02`

Format Inist (serveur)

NO :	PASCAL 97-0420272 INIST
ET :	A complete axiomatisation for the inclusion of series-parallel partial orders
AU :	BECHET (D.); DE GROOTE (P.); RETORE (C.); COMON (Hubert)
AF :	Projet CALLIGRAMME, INRIA-Lorraine - CRIN - CNRS, 615, rue du Jardin Botanique - B.P. 101/54602 Villers lès Nancy /France (1 aut., 2 aut., 3 aut.)
DT :	Publication en série; Congrès; Niveau analytique
SO :	Lecture notes in computer science; ISSN 0302-9743; Allemagne; Da. 1997; Vol. 1232; Pp. 230-240; Bibl. 8 ref.
LA :	Anglais
EA :	Series-parallel orders are defined as the least class of partial orders containing the one-element order and closed by ordinal sum and disjoint union. From this inductive definition, it is almost immediate that any series-parallel order may be represented by an algebraic expression, which is unique up to the associativity of ordinal sum and to the associativivity and commutativity of disjoint union. In this paper, we introduce a rewrite system acting on these algebraic expressions that axiomatises completely the sub-ordering relation for the class of series-parallel orders.
CC :	001D02A05
FD :	Informatique théorique; Algorithmique; Théorie graphe
ED :	Computer theory; Algorithmics; Graph theory
SD :	Informática teórica; Algorítmica; Teoría grafo
LO :	INIST-16343.354000062541800180
ID :	97-0420272

Links to Exploration step

Pascal:97-0420272

Le document en format XML

<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">A complete axiomatisation for the inclusion of series-parallel partial orders</title>
<author><name sortKey="Bechet, D" sort="Bechet, D" uniqKey="Bechet D" first="D." last="Bechet">D. Bechet</name>
<affiliation><inist:fA14 i1="01"><s1>Projet CALLIGRAMME, INRIA-Lorraine - CRIN - CNRS, 615, rue du Jardin Botanique - B.P. 101</s1>
<s2>54602 Villers lès Nancy </s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="De Groote, P" sort="De Groote, P" uniqKey="De Groote P" first="P." last="De Groote">P. De Groote</name>
<affiliation><inist:fA14 i1="01"><s1>Projet CALLIGRAMME, INRIA-Lorraine - CRIN - CNRS, 615, rue du Jardin Botanique - B.P. 101</s1>
<s2>54602 Villers lès Nancy </s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Retore, C" sort="Retore, C" uniqKey="Retore C" first="C." last="Retore">C. Retore</name>
<affiliation><inist:fA14 i1="01"><s1>Projet CALLIGRAMME, INRIA-Lorraine - CRIN - CNRS, 615, rue du Jardin Botanique - B.P. 101</s1>
<s2>54602 Villers lès Nancy </s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">97-0420272</idno>
<date when="1997">1997</date>
<idno type="stanalyst">PASCAL 97-0420272 INIST</idno>
<idno type="RBID">Pascal:97-0420272</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000C42</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">A complete axiomatisation for the inclusion of series-parallel partial orders</title>
<author><name sortKey="Bechet, D" sort="Bechet, D" uniqKey="Bechet D" first="D." last="Bechet">D. Bechet</name>
<affiliation><inist:fA14 i1="01"><s1>Projet CALLIGRAMME, INRIA-Lorraine - CRIN - CNRS, 615, rue du Jardin Botanique - B.P. 101</s1>
<s2>54602 Villers lès Nancy </s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="De Groote, P" sort="De Groote, P" uniqKey="De Groote P" first="P." last="De Groote">P. De Groote</name>
<affiliation><inist:fA14 i1="01"><s1>Projet CALLIGRAMME, INRIA-Lorraine - CRIN - CNRS, 615, rue du Jardin Botanique - B.P. 101</s1>
<s2>54602 Villers lès Nancy </s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Retore, C" sort="Retore, C" uniqKey="Retore C" first="C." last="Retore">C. Retore</name>
<affiliation><inist:fA14 i1="01"><s1>Projet CALLIGRAMME, INRIA-Lorraine - CRIN - CNRS, 615, rue du Jardin Botanique - B.P. 101</s1>
<s2>54602 Villers lès Nancy </s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 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="1997">1997</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>Algorithmics</term>
<term>Computer theory</term>
<term>Graph theory</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr"><term>Informatique théorique</term>
<term>Algorithmique</term>
<term>Théorie graphe</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">Series-parallel orders are defined as the least class of partial orders containing the one-element order and closed by ordinal sum and disjoint union. From this inductive definition, it is almost immediate that any series-parallel order may be represented by an algebraic expression, which is unique up to the associativity of ordinal sum and to the associativivity and commutativity of disjoint union. In this paper, we introduce a rewrite system acting on these algebraic expressions that axiomatises completely the sub-ordering relation for the class of series-parallel orders.</div>
</front>
</TEI>
<inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>0302-9743</s0>
</fA01>
<fA05><s2>1232</s2>
</fA05>
<fA08 i1="01" i2="1" l="ENG"><s1>A complete axiomatisation for the inclusion of series-parallel partial orders</s1>
</fA08>
<fA09 i1="01" i2="1" l="ENG"><s1>RTA-97 : rewriting techniques and applications : Sitges, June 2-5, 1997</s1>
</fA09>
<fA11 i1="01" i2="1"><s1>BECHET (D.)</s1>
</fA11>
<fA11 i1="02" i2="1"><s1>DE GROOTE (P.)</s1>
</fA11>
<fA11 i1="03" i2="1"><s1>RETORE (C.)</s1>
</fA11>
<fA12 i1="01" i2="1"><s1>COMON (Hubert)</s1>
<s9>ed.</s9>
</fA12>
<fA14 i1="01"><s1>Projet CALLIGRAMME, INRIA-Lorraine - CRIN - CNRS, 615, rue du Jardin Botanique - B.P. 101</s1>
<s2>54602 Villers lès Nancy </s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</fA14>
<fA20><s1>230-240</s1>
</fA20>
<fA21><s1>1997</s1>
</fA21>
<fA23 i1="01"><s0>ENG</s0>
</fA23>
<fA43 i1="01"><s1>INIST</s1>
<s2>16343</s2>
<s5>354000062541800180</s5>
</fA43>
<fA44><s0>0000</s0>
<s1>© 1997 INIST-CNRS. All rights reserved.</s1>
</fA44>
<fA45><s0>8 ref.</s0>
</fA45>
<fA47 i1="01" i2="1"><s0>97-0420272</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>
<fA66 i1="02"><s0>USA</s0>
</fA66>
<fC01 i1="01" l="ENG"><s0>Series-parallel orders are defined as the least class of partial orders containing the one-element order and closed by ordinal sum and disjoint union. From this inductive definition, it is almost immediate that any series-parallel order may be represented by an algebraic expression, which is unique up to the associativity of ordinal sum and to the associativivity and commutativity of disjoint union. In this paper, we introduce a rewrite system acting on these algebraic expressions that axiomatises completely the sub-ordering relation for the class of series-parallel orders.</s0>
</fC01>
<fC02 i1="01" i2="X"><s0>001D02A05</s0>
</fC02>
<fC03 i1="01" i2="X" l="FRE"><s0>Informatique théorique</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="X" l="ENG"><s0>Computer theory</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="X" l="SPA"><s0>Informática teórica</s0>
<s5>01</s5>
</fC03>
<fC03 i1="02" i2="X" l="FRE"><s0>Algorithmique</s0>
<s5>02</s5>
</fC03>
<fC03 i1="02" i2="X" l="ENG"><s0>Algorithmics</s0>
<s5>02</s5>
</fC03>
<fC03 i1="02" i2="X" l="SPA"><s0>Algorítmica</s0>
<s5>02</s5>
</fC03>
<fC03 i1="03" i2="X" l="FRE"><s0>Théorie graphe</s0>
<s5>03</s5>
</fC03>
<fC03 i1="03" i2="X" l="ENG"><s0>Graph theory</s0>
<s5>03</s5>
</fC03>
<fC03 i1="03" i2="X" l="SPA"><s0>Teoría grafo</s0>
<s5>03</s5>
</fC03>
<fN21><s1>258</s1>
</fN21>
</pA>
<pR><fA30 i1="01" i2="1" l="ENG"><s1>Rewriting techniques and applications. International conference</s1>
<s2>8</s2>
<s3>Sitges ESP</s3>
<s4>1997-06-02</s4>
</fA30>
</pR>
</standard>
<server><NO>PASCAL 97-0420272 INIST</NO>
<ET>A complete axiomatisation for the inclusion of series-parallel partial orders</ET>
<AU>BECHET (D.); DE GROOTE (P.); RETORE (C.); COMON (Hubert)</AU>
<AF>Projet CALLIGRAMME, INRIA-Lorraine - CRIN - CNRS, 615, rue du Jardin Botanique - B.P. 101/54602 Villers lès Nancy /France (1 aut., 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. 1997; Vol. 1232; Pp. 230-240; Bibl. 8 ref.</SO>
<LA>Anglais</LA>
<EA>Series-parallel orders are defined as the least class of partial orders containing the one-element order and closed by ordinal sum and disjoint union. From this inductive definition, it is almost immediate that any series-parallel order may be represented by an algebraic expression, which is unique up to the associativity of ordinal sum and to the associativivity and commutativity of disjoint union. In this paper, we introduce a rewrite system acting on these algebraic expressions that axiomatises completely the sub-ordering relation for the class of series-parallel orders.</EA>
<CC>001D02A05</CC>
<FD>Informatique théorique; Algorithmique; Théorie graphe</FD>
<ED>Computer theory; Algorithmics; Graph theory</ED>
<SD>Informática teórica; Algorítmica; Teoría grafo</SD>
<LO>INIST-16343.354000062541800180</LO>
<ID>97-0420272</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 000C42 | SxmlIndent | more

HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Corpus/biblio.hfd -nk 000C42 | 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-0420272
   |texte=   A complete axiomatisation for the inclusion of series-parallel partial orders
}}

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 complete axiomatisation for the inclusion of series-parallel partial orders

A complete axiomatisation for the inclusion of series-parallel partial orders

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