InforLorV4, PascalFrancis, Corpus, bibRecord, 000857

Analysis of preemptive periodic real-time systems using the (max, plus) algebra with applications in robotics

Identifieur interne : 000857 ( PascalFrancis/Corpus ); précédent : 000856; suivant : 000858

Analysis of preemptive periodic real-time systems using the (max, plus) algebra with applications in robotics

Auteurs : Francois Baccelli ; Bruno Gaujal ; Daniel Simon

Source :

IEEE transactions on control systems technology [ 1063-6536 ] ; 2002.

RBID : Pascal:02-0504327

Descripteurs français

Pascal (Inist)
- Robotique, Système périodique, Temps réel, Ordonnancement, Graphe, Méthode algébrique, Synchronisation, Priorité, Réponse temporelle, Temps réponse, Modélisation, Algèbre max plus, Contrainte précédence, Préemption.

English descriptors

KwdEn :
- Algebraic method, Graph, Max plus algebra, Modeling, Periodic system, Precedence constraint, Priority, Real time, Response time, Robotics, Scheduling, Synchronization, Time response.

Abstract

In this paper we present the model of a system of periodic real-time tasks with fixed priorities, preemption and synchronization, performed by a robot controller, using marked graphs. Then, with the help of the (max,plus) algebra, we derive simple tests to check real-time constraints on those tasks such as response times and the respect of deadlines. This method takes into account precedence and synchronization constraints and is not limited to a particular scheduling policy.

Notice en format standard (ISO 2709)

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

A01	`01`	`1`		`@0 1063-6536`
A02	`01`			`@0 IETTE2`
A03		`1`		`@0 IEEE trans. control syst. technol.`
A05				`@2 10`
A06				`@2 3`
A08	`01`	`1`	`ENG`	`@1 Analysis of preemptive periodic real-time systems using the (max, plus) algebra with applications in robotics`
A11	`01`	`1`		`@1 BACCELLI (Francois)`
A11	`02`	`1`		`@1 GAUJAL (Bruno)`
A11	`03`	`1`		`@1 SIMON (Daniel)`
A14	`01`			`@1 ENS @2 Paris @3 FRA @Z 1 aut.`
A14	`02`			`@1 Loria @2 Villers lès Nancy @3 FRA @Z 2 aut.`
A14	`03`			`@1 Inria Rhône-Alpes @2 38330 Montbonnot @3 FRA @Z 3 aut.`
A20				`@1 368-380`
A21				`@1 2002`
A23	`01`			`@0 ENG`
A43	`01`			`@1 INIST @2 26265`
A44				`@0 A300`
A45				`@0 19 ref.`
A47	`01`	`1`		`@0 02-0504327`
A60				`@1 P`
A61				`@0 A`
A64	`01`	`1`		`@0 IEEE transactions on control systems technology`
A66	`01`			`@0 USA`
C01	`01`		`ENG`	`@0 In this paper we present the model of a system of periodic real-time tasks with fixed priorities, preemption and synchronization, performed by a robot controller, using marked graphs. Then, with the help of the (max,plus) algebra, we derive simple tests to check real-time constraints on those tasks such as response times and the respect of deadlines. This method takes into account precedence and synchronization constraints and is not limited to a particular scheduling policy.`
C02	`01`	`X`		`@0 001D02D11`
C02	`02`	`X`		`@0 001D02A03`
C03	`01`	`X`	`FRE`	`@0 Robotique @5 01`
C03	`01`	`X`	`ENG`	`@0 Robotics @5 01`
C03	`01`	`X`	`SPA`	`@0 Robótica @5 01`
C03	`02`	`X`	`FRE`	`@0 Système périodique @5 02`
C03	`02`	`X`	`ENG`	`@0 Periodic system @5 02`
C03	`02`	`X`	`SPA`	`@0 Sistema periódico @5 02`
C03	`03`	`X`	`FRE`	`@0 Temps réel @5 03`
C03	`03`	`X`	`ENG`	`@0 Real time @5 03`
C03	`03`	`X`	`SPA`	`@0 Tiempo real @5 03`
C03	`04`	`X`	`FRE`	`@0 Ordonnancement @5 04`
C03	`04`	`X`	`ENG`	`@0 Scheduling @5 04`
C03	`04`	`X`	`SPA`	`@0 Ordonamiento @5 04`
C03	`05`	`X`	`FRE`	`@0 Graphe @5 05`
C03	`05`	`X`	`ENG`	`@0 Graph @5 05`
C03	`05`	`X`	`SPA`	`@0 Grafo @5 05`
C03	`06`	`X`	`FRE`	`@0 Méthode algébrique @5 06`
C03	`06`	`X`	`ENG`	`@0 Algebraic method @5 06`
C03	`06`	`X`	`SPA`	`@0 Método algebraico @5 06`
C03	`07`	`X`	`FRE`	`@0 Synchronisation @5 07`
C03	`07`	`X`	`ENG`	`@0 Synchronization @5 07`
C03	`07`	`X`	`SPA`	`@0 Sincronización @5 07`
C03	`08`	`X`	`FRE`	`@0 Priorité @5 08`
C03	`08`	`X`	`ENG`	`@0 Priority @5 08`
C03	`08`	`X`	`SPA`	`@0 Prioridad @5 08`
C03	`09`	`X`	`FRE`	`@0 Réponse temporelle @5 11`
C03	`09`	`X`	`ENG`	`@0 Time response @5 11`
C03	`09`	`X`	`SPA`	`@0 Respuesta temporal @5 11`
C03	`10`	`X`	`FRE`	`@0 Temps réponse @5 12`
C03	`10`	`X`	`ENG`	`@0 Response time @5 12`
C03	`10`	`X`	`SPA`	`@0 Tiempo respuesta @5 12`
C03	`11`	`X`	`FRE`	`@0 Modélisation @5 21`
C03	`11`	`X`	`ENG`	`@0 Modeling @5 21`
C03	`11`	`X`	`SPA`	`@0 Modelización @5 21`
C03	`12`	`X`	`FRE`	`@0 Algèbre max plus @5 22`
C03	`12`	`X`	`ENG`	`@0 Max plus algebra @5 22`
C03	`12`	`X`	`SPA`	`@0 Algebra max plus @5 22`
C03	`13`	`X`	`FRE`	`@0 Contrainte précédence @5 23`
C03	`13`	`X`	`ENG`	`@0 Precedence constraint @5 23`
C03	`13`	`X`	`SPA`	`@0 Constreñimiento precedencia @5 23`
C03	`14`	`X`	`FRE`	`@0 Préemption @4 INC @5 82`
N21				`@1 294`
N82				`@1 PSI`

Format Inist (serveur)

NO :	PASCAL 02-0504327 CRAN
ET :	Analysis of preemptive periodic real-time systems using the (max, plus) algebra with applications in robotics
AU :	BACCELLI (Francois); GAUJAL (Bruno); SIMON (Daniel)
AF :	ENS/Paris/France (1 aut.); Loria/Villers lès Nancy/France (2 aut.); Inria Rhône-Alpes/38330 Montbonnot/France (3 aut.)
DT :	Publication en série; Niveau analytique
SO :	IEEE transactions on control systems technology; ISSN 1063-6536; Coden IETTE2; Etats-Unis; Da. 2002; Vol. 10; No. 3; Pp. 368-380; Bibl. 19 ref.
LA :	Anglais
EA :	In this paper we present the model of a system of periodic real-time tasks with fixed priorities, preemption and synchronization, performed by a robot controller, using marked graphs. Then, with the help of the (max,plus) algebra, we derive simple tests to check real-time constraints on those tasks such as response times and the respect of deadlines. This method takes into account precedence and synchronization constraints and is not limited to a particular scheduling policy.
CC :	001D02D11; 001D02A03
FD :	Robotique; Système périodique; Temps réel; Ordonnancement; Graphe; Méthode algébrique; Synchronisation; Priorité; Réponse temporelle; Temps réponse; Modélisation; Algèbre max plus; Contrainte précédence; Préemption
ED :	Robotics; Periodic system; Real time; Scheduling; Graph; Algebraic method; Synchronization; Priority; Time response; Response time; Modeling; Max plus algebra; Precedence constraint
SD :	Robótica; Sistema periódico; Tiempo real; Ordonamiento; Grafo; Método algebraico; Sincronización; Prioridad; Respuesta temporal; Tiempo respuesta; Modelización; Algebra max plus; Constreñimiento precedencia
LO :	INIST-26265
ID :	02-0504327

Links to Exploration step

Pascal:02-0504327

Le document en format XML

<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">Analysis of preemptive periodic real-time systems using the (max, plus) algebra with applications in robotics</title>
<author><name sortKey="Baccelli, Francois" sort="Baccelli, Francois" uniqKey="Baccelli F" first="Francois" last="Baccelli">Francois Baccelli</name>
<affiliation><inist:fA14 i1="01"><s1>ENS</s1>
<s2>Paris</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Gaujal, Bruno" sort="Gaujal, Bruno" uniqKey="Gaujal B" first="Bruno" last="Gaujal">Bruno Gaujal</name>
<affiliation><inist:fA14 i1="02"><s1>Loria</s1>
<s2>Villers lès Nancy</s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Simon, Daniel" sort="Simon, Daniel" uniqKey="Simon D" first="Daniel" last="Simon">Daniel Simon</name>
<affiliation><inist:fA14 i1="03"><s1>Inria Rhône-Alpes</s1>
<s2>38330 Montbonnot</s2>
<s3>FRA</s3>
<sZ>3 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">02-0504327</idno>
<date when="2002">2002</date>
<idno type="stanalyst">PASCAL 02-0504327 CRAN</idno>
<idno type="RBID">Pascal:02-0504327</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000857</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">Analysis of preemptive periodic real-time systems using the (max, plus) algebra with applications in robotics</title>
<author><name sortKey="Baccelli, Francois" sort="Baccelli, Francois" uniqKey="Baccelli F" first="Francois" last="Baccelli">Francois Baccelli</name>
<affiliation><inist:fA14 i1="01"><s1>ENS</s1>
<s2>Paris</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Gaujal, Bruno" sort="Gaujal, Bruno" uniqKey="Gaujal B" first="Bruno" last="Gaujal">Bruno Gaujal</name>
<affiliation><inist:fA14 i1="02"><s1>Loria</s1>
<s2>Villers lès Nancy</s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Simon, Daniel" sort="Simon, Daniel" uniqKey="Simon D" first="Daniel" last="Simon">Daniel Simon</name>
<affiliation><inist:fA14 i1="03"><s1>Inria Rhône-Alpes</s1>
<s2>38330 Montbonnot</s2>
<s3>FRA</s3>
<sZ>3 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
</analytic>
<series><title level="j" type="main">IEEE transactions on control systems technology</title>
<title level="j" type="abbreviated">IEEE trans. control syst. technol.</title>
<idno type="ISSN">1063-6536</idno>
<imprint><date when="2002">2002</date>
</imprint>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt><title level="j" type="main">IEEE transactions on control systems technology</title>
<title level="j" type="abbreviated">IEEE trans. control syst. technol.</title>
<idno type="ISSN">1063-6536</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Algebraic method</term>
<term>Graph</term>
<term>Max plus algebra</term>
<term>Modeling</term>
<term>Periodic system</term>
<term>Precedence constraint</term>
<term>Priority</term>
<term>Real time</term>
<term>Response time</term>
<term>Robotics</term>
<term>Scheduling</term>
<term>Synchronization</term>
<term>Time response</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr"><term>Robotique</term>
<term>Système périodique</term>
<term>Temps réel</term>
<term>Ordonnancement</term>
<term>Graphe</term>
<term>Méthode algébrique</term>
<term>Synchronisation</term>
<term>Priorité</term>
<term>Réponse temporelle</term>
<term>Temps réponse</term>
<term>Modélisation</term>
<term>Algèbre max plus</term>
<term>Contrainte précédence</term>
<term>Préemption</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">In this paper we present the model of a system of periodic real-time tasks with fixed priorities, preemption and synchronization, performed by a robot controller, using marked graphs. Then, with the help of the (max,plus) algebra, we derive simple tests to check real-time constraints on those tasks such as response times and the respect of deadlines. This method takes into account precedence and synchronization constraints and is not limited to a particular scheduling policy.</div>
</front>
</TEI>
<inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>1063-6536</s0>
</fA01>
<fA02 i1="01"><s0>IETTE2</s0>
</fA02>
<fA03 i2="1"><s0>IEEE trans. control syst. technol.</s0>
</fA03>
<fA05><s2>10</s2>
</fA05>
<fA06><s2>3</s2>
</fA06>
<fA08 i1="01" i2="1" l="ENG"><s1>Analysis of preemptive periodic real-time systems using the (max, plus) algebra with applications in robotics</s1>
</fA08>
<fA11 i1="01" i2="1"><s1>BACCELLI (Francois)</s1>
</fA11>
<fA11 i1="02" i2="1"><s1>GAUJAL (Bruno)</s1>
</fA11>
<fA11 i1="03" i2="1"><s1>SIMON (Daniel)</s1>
</fA11>
<fA14 i1="01"><s1>ENS</s1>
<s2>Paris</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</fA14>
<fA14 i1="02"><s1>Loria</s1>
<s2>Villers lès Nancy</s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
</fA14>
<fA14 i1="03"><s1>Inria Rhône-Alpes</s1>
<s2>38330 Montbonnot</s2>
<s3>FRA</s3>
<sZ>3 aut.</sZ>
</fA14>
<fA20><s1>368-380</s1>
</fA20>
<fA21><s1>2002</s1>
</fA21>
<fA23 i1="01"><s0>ENG</s0>
</fA23>
<fA43 i1="01"><s1>INIST</s1>
<s2>26265</s2>
</fA43>
<fA44><s0>A300</s0>
</fA44>
<fA45><s0>19 ref.</s0>
</fA45>
<fA47 i1="01" i2="1"><s0>02-0504327</s0>
</fA47>
<fA60><s1>P</s1>
</fA60>
<fA61><s0>A</s0>
</fA61>
<fA64 i1="01" i2="1"><s0>IEEE transactions on control systems technology</s0>
</fA64>
<fA66 i1="01"><s0>USA</s0>
</fA66>
<fC01 i1="01" l="ENG"><s0>In this paper we present the model of a system of periodic real-time tasks with fixed priorities, preemption and synchronization, performed by a robot controller, using marked graphs. Then, with the help of the (max,plus) algebra, we derive simple tests to check real-time constraints on those tasks such as response times and the respect of deadlines. This method takes into account precedence and synchronization constraints and is not limited to a particular scheduling policy.</s0>
</fC01>
<fC02 i1="01" i2="X"><s0>001D02D11</s0>
</fC02>
<fC02 i1="02" i2="X"><s0>001D02A03</s0>
</fC02>
<fC03 i1="01" i2="X" l="FRE"><s0>Robotique</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="X" l="ENG"><s0>Robotics</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="X" l="SPA"><s0>Robótica</s0>
<s5>01</s5>
</fC03>
<fC03 i1="02" i2="X" l="FRE"><s0>Système périodique</s0>
<s5>02</s5>
</fC03>
<fC03 i1="02" i2="X" l="ENG"><s0>Periodic system</s0>
<s5>02</s5>
</fC03>
<fC03 i1="02" i2="X" l="SPA"><s0>Sistema periódico</s0>
<s5>02</s5>
</fC03>
<fC03 i1="03" i2="X" l="FRE"><s0>Temps réel</s0>
<s5>03</s5>
</fC03>
<fC03 i1="03" i2="X" l="ENG"><s0>Real time</s0>
<s5>03</s5>
</fC03>
<fC03 i1="03" i2="X" l="SPA"><s0>Tiempo real</s0>
<s5>03</s5>
</fC03>
<fC03 i1="04" i2="X" l="FRE"><s0>Ordonnancement</s0>
<s5>04</s5>
</fC03>
<fC03 i1="04" i2="X" l="ENG"><s0>Scheduling</s0>
<s5>04</s5>
</fC03>
<fC03 i1="04" i2="X" l="SPA"><s0>Ordonamiento</s0>
<s5>04</s5>
</fC03>
<fC03 i1="05" i2="X" l="FRE"><s0>Graphe</s0>
<s5>05</s5>
</fC03>
<fC03 i1="05" i2="X" l="ENG"><s0>Graph</s0>
<s5>05</s5>
</fC03>
<fC03 i1="05" i2="X" l="SPA"><s0>Grafo</s0>
<s5>05</s5>
</fC03>
<fC03 i1="06" i2="X" l="FRE"><s0>Méthode algébrique</s0>
<s5>06</s5>
</fC03>
<fC03 i1="06" i2="X" l="ENG"><s0>Algebraic method</s0>
<s5>06</s5>
</fC03>
<fC03 i1="06" i2="X" l="SPA"><s0>Método algebraico</s0>
<s5>06</s5>
</fC03>
<fC03 i1="07" i2="X" l="FRE"><s0>Synchronisation</s0>
<s5>07</s5>
</fC03>
<fC03 i1="07" i2="X" l="ENG"><s0>Synchronization</s0>
<s5>07</s5>
</fC03>
<fC03 i1="07" i2="X" l="SPA"><s0>Sincronización</s0>
<s5>07</s5>
</fC03>
<fC03 i1="08" i2="X" l="FRE"><s0>Priorité</s0>
<s5>08</s5>
</fC03>
<fC03 i1="08" i2="X" l="ENG"><s0>Priority</s0>
<s5>08</s5>
</fC03>
<fC03 i1="08" i2="X" l="SPA"><s0>Prioridad</s0>
<s5>08</s5>
</fC03>
<fC03 i1="09" i2="X" l="FRE"><s0>Réponse temporelle</s0>
<s5>11</s5>
</fC03>
<fC03 i1="09" i2="X" l="ENG"><s0>Time response</s0>
<s5>11</s5>
</fC03>
<fC03 i1="09" i2="X" l="SPA"><s0>Respuesta temporal</s0>
<s5>11</s5>
</fC03>
<fC03 i1="10" i2="X" l="FRE"><s0>Temps réponse</s0>
<s5>12</s5>
</fC03>
<fC03 i1="10" i2="X" l="ENG"><s0>Response time</s0>
<s5>12</s5>
</fC03>
<fC03 i1="10" i2="X" l="SPA"><s0>Tiempo respuesta</s0>
<s5>12</s5>
</fC03>
<fC03 i1="11" i2="X" l="FRE"><s0>Modélisation</s0>
<s5>21</s5>
</fC03>
<fC03 i1="11" i2="X" l="ENG"><s0>Modeling</s0>
<s5>21</s5>
</fC03>
<fC03 i1="11" i2="X" l="SPA"><s0>Modelización</s0>
<s5>21</s5>
</fC03>
<fC03 i1="12" i2="X" l="FRE"><s0>Algèbre max plus</s0>
<s5>22</s5>
</fC03>
<fC03 i1="12" i2="X" l="ENG"><s0>Max plus algebra</s0>
<s5>22</s5>
</fC03>
<fC03 i1="12" i2="X" l="SPA"><s0>Algebra max plus</s0>
<s5>22</s5>
</fC03>
<fC03 i1="13" i2="X" l="FRE"><s0>Contrainte précédence</s0>
<s5>23</s5>
</fC03>
<fC03 i1="13" i2="X" l="ENG"><s0>Precedence constraint</s0>
<s5>23</s5>
</fC03>
<fC03 i1="13" i2="X" l="SPA"><s0>Constreñimiento precedencia</s0>
<s5>23</s5>
</fC03>
<fC03 i1="14" i2="X" l="FRE"><s0>Préemption</s0>
<s4>INC</s4>
<s5>82</s5>
</fC03>
<fN21><s1>294</s1>
</fN21>
<fN82><s1>PSI</s1>
</fN82>
</pA>
</standard>
<server><NO>PASCAL 02-0504327 CRAN</NO>
<ET>Analysis of preemptive periodic real-time systems using the (max, plus) algebra with applications in robotics</ET>
<AU>BACCELLI (Francois); GAUJAL (Bruno); SIMON (Daniel)</AU>
<AF>ENS/Paris/France (1 aut.); Loria/Villers lès Nancy/France (2 aut.); Inria Rhône-Alpes/38330 Montbonnot/France (3 aut.)</AF>
<DT>Publication en série; Niveau analytique</DT>
<SO>IEEE transactions on control systems technology; ISSN 1063-6536; Coden IETTE2; Etats-Unis; Da. 2002; Vol. 10; No. 3; Pp. 368-380; Bibl. 19 ref.</SO>
<LA>Anglais</LA>
<EA>In this paper we present the model of a system of periodic real-time tasks with fixed priorities, preemption and synchronization, performed by a robot controller, using marked graphs. Then, with the help of the (max,plus) algebra, we derive simple tests to check real-time constraints on those tasks such as response times and the respect of deadlines. This method takes into account precedence and synchronization constraints and is not limited to a particular scheduling policy.</EA>
<CC>001D02D11; 001D02A03</CC>
<FD>Robotique; Système périodique; Temps réel; Ordonnancement; Graphe; Méthode algébrique; Synchronisation; Priorité; Réponse temporelle; Temps réponse; Modélisation; Algèbre max plus; Contrainte précédence; Préemption</FD>
<ED>Robotics; Periodic system; Real time; Scheduling; Graph; Algebraic method; Synchronization; Priority; Time response; Response time; Modeling; Max plus algebra; Precedence constraint</ED>
<SD>Robótica; Sistema periódico; Tiempo real; Ordonamiento; Grafo; Método algebraico; Sincronización; Prioridad; Respuesta temporal; Tiempo respuesta; Modelización; Algebra max plus; Constreñimiento precedencia</SD>
<LO>INIST-26265</LO>
<ID>02-0504327</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 000857 | SxmlIndent | more

HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Corpus/biblio.hfd -nk 000857 | 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:02-0504327
   |texte=   Analysis of preemptive periodic real-time systems using the (max, plus) algebra with applications in robotics
}}

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

Analysis of preemptive periodic real-time systems using the (max, plus) algebra with applications in robotics

Analysis of preemptive periodic real-time systems using the (max, plus) algebra with applications in robotics

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