LIX Colloquium

Reachability Problems'09

September 23rd-25th 2009

Ecole Polytechnique, France

## Main.HomePage History

Show minor edits - Show changes to markup

- Proceedings Flyer
- Link to the proceedings web page
- Cover File Δ

**INDICATIONS WITH PICTURES**for coming to Ecole Polytechique from a RER B station to Ecole Polytechnique (Other details here))

**INDICATIONS WITH PICTURES**(Printable Version) for coming to Ecole Polytechique from a RER B station to Ecole Polytechnique (Other details here))

**INDICATIONS WITH PICTURES**for coming to Ecole Polytechique from a RER B station to Ecole Polytechnique (More details on )

**INDICATIONS WITH PICTURES**for coming to Ecole Polytechique from a RER B station to Ecole Polytechnique (Other details here))

**INDICATIONS WITH PICTURES**for coming to Ecole Polytechique from a RER B station to Ecole Polytechnique (More details on )

# Reachability Problems'09

\\

\\

# Main Page

# Reachability Problems'09

# Main Page

# NEWS

NEWS: LNCS Volume is online

Registration is FREE IF done BEFORE July 27th

They will appear as volume 5797 of Lecture Notes in Computer Science.

NEWS: Registration server is open

NEWS

*NEWS:* *Registration server is open*

* registration is* **FREE** *if done* **BEFORE** *JULY 27 TH*

NEWS: Registration server is open

Registration is FREE IF done BEFORE July 27th

'+' *NEWS:* *Registration server is open*

* registration is* **FREE** *if done* **BEFORE** *JULY 27 TH*+'

NEWS

*NEWS:* *Registration server is open*

* registration is* **FREE** *if done* **BEFORE** *JULY 27 TH*

'+NEWS: *Registration server is open*

'+' *NEWS:* *Registration server is open*

NEWS: *Registration server is open*

* registration is* **FREE** *if done* **BEFORE** *JULY 27 TH*

'+NEWS: *Registration server is open*

* registration is* **FREE** *if done* **BEFORE** *JULY 27 TH*+'

* registration is FREE if done BEFORE JULY 27 TH*

* registration is* **FREE** *if done* **BEFORE** *JULY 27 TH*

NEWS: ''Registration server is open and registration is
FREE IF DONE **BEFORE** JULY 27 TH''

NEWS: *Registration server is open*

* registration is FREE if done BEFORE JULY 27 TH*

NEWS: *Registration server is open and registration is FREE IF DONE BEFORE JULY 27 TH*

NEWS: ''Registration server is open and registration is
FREE IF DONE **BEFORE** JULY 27 TH''

NEWS: **REGISTRATION IS OPEN AND FREE IF BEFORE JULY 27 TH**

NEWS: *Registration server is open and registration is FREE IF DONE BEFORE JULY 27 TH*

**REGISTRATION IS OPEN AND FREE IF BEFORE JULY 27 TH**

NEWS: **REGISTRATION IS OPEN AND FREE IF BEFORE JULY 27 TH**

**REGISTRATION IS OPEN**

**REGISTRATION IS OPEN AND FREE IF BEFORE JULY 27 TH**

**REGISTRATION IS OPEN**

(:html:) <big> <strong>Submission deadline <blink> EXTENDED </blink>: 11 May, 2009 </strong> </big> (:htmlend:)

RP2009 submission server

RP2009 submission server is now open.

RP2009 submission server

<big> <strong>Submission deadline <blink> EXTENDED: 11 May, 2009 </blink> </strong> </big>

<big> <strong>Submission deadline <blink> EXTENDED </blink>: 11 May, 2009 </strong> </big>

**Submission deadline EXTENDED: 11 May, 2009**

(:htmlend:)

<blink> Submission deadline EXTENDED: 11 May, 2009 </blink> (:htmlend:)

<big> <strong>Submission deadline <blink> EXTENDED: 11 May, 2009 </blink> </strong> </big>

(:html:) <blink> Submission deadline EXTENDED: 11 May, 2009 </blink> (:htmlend:)

**Submission deadline EXTENDED: 11 May, 2009**

RP2009 submission server is open now.

RP2009 submission server is now open.

%*RP2009 submission server is open now.*%

RP2009 submission server is open now.

*RP2009 submission server is open now.*

%*RP2009 submission server is open now.*%

*RP2009 submission server is open now.*

**Proceedings**

### Proceedings

**Proceedings**

The proceedings of the conference will be published in the Springer Verlag LNCS series and distributed during the conference.

Selected papers will be invited to the special issue of a high quality journal devoted to RP 2009.

(:div id="eXTReMe":) [[http://extremetracking.com/open?login=rp09| %apply=img style="border: 0;" height="38" width="41" id="EXim" %http://t1.extreme-dm.com/i.gif%% ]] <script type="text/javascript"><!-- var EXlogin='rp09' // Login var EXvsrv='s11' // VServer EXs=screen;EXw=EXs.width;navigator.appName!="Netscape"? EXb=EXs.colorDepth:EXb=EXs.pixelDepth;EXsrc="src"; navigator.javaEnabled()==1?EXjv="y":EXjv="n"; EXd=document;EXw?"":EXw="na";EXb?"":EXb="na"; EXd.write("<img "+EXsrc+"=http://e2.extreme-dm.com", "/"+EXvsrv+".g?login="+EXlogin+"&", "jv="+EXjv+"&j=y&srw="+EXw+"&srb="+EXb+"&", "l="+escape(parent.document.referrer)+" height=1 width=1>");//--> </script><noscript><div id="neXTReMe">%apply=img height="1" width="1" alt="" %http://e2.extreme-dm.com/s11.g?login=rp09&j=n&jv=n%% (:divend:) </noscript></div>

(:div id="eXTReMe":) [[http://extremetracking.com/open?login=rp09| %apply=img style="border: 0;" height="38" width="41" id="EXim" %http://t1.extreme-dm.com/i.gif%% ]] <script type="text/javascript"><!-- var EXlogin='rp09' // Login var EXvsrv='s11' // VServer EXs=screen;EXw=EXs.width;navigator.appName!="Netscape"? EXb=EXs.colorDepth:EXb=EXs.pixelDepth;EXsrc="src"; navigator.javaEnabled()==1?EXjv="y":EXjv="n"; EXd=document;EXw?"":EXw="na";EXb?"":EXb="na"; EXd.write("<img "+EXsrc+"=http://e2.extreme-dm.com", "/"+EXvsrv+".g?login="+EXlogin+"&", "jv="+EXjv+"&j=y&srw="+EXw+"&srb="+EXb+"&", "l="+escape(parent.document.referrer)+" height=1 width=1>");//--> </script><noscript><div id="neXTReMe">%apply=img height="1" width="1" alt="" %http://e2.extreme-dm.com/s11.g?login=rp09&j=n&jv=n%% (:divend:) </noscript></div>

4hl482 bjkjhlgujuoh, [url=http://epohiluewfdh.com/]epohiluewfdh[/url], [link=http://sbvtscaqcmvj.com/]sbvtscaqcmvj[/link], http://bvwreanxjjyd.com/

The annual fall colloquium organized by the computer science department of Ecole Polytechnique (LIX) will host Reachability Problems RP'2009.

Reachability Problems RP'2009 will take place at Ecole Polytechnique (on-site at Palaiseau, a suburb district of Paris).

Papers presenting original contributions related to reachability problems in different computational models and systems are being sought.

This will also be the occasion to review recent breakthroughs by renown invited experts and survey emerging trends and emphasize on key open challenges. Participants are kindly encouraged to discuss on core scientific issues that need to be further tackled.

### Topics

Reachability Problems is specifically aimed at gathering together scholars from diverse disciplines and backgrounds interested in reachability problems that appear in

- Algebraic structures
- Computational models
- Hybrid systems
- Verification

Topics of interest include (but are not limited to): Reachability problems in infinite state systems, rewriting systems, dynamical and hybrid systems; reachability problems in logic and verification; reachability analysis in different computational models, counter/ timed/ cellular/ communicating automata; Petri-Nets; computational aspects of algebraic structures (semigroups, groups and rings); predictability in iterative maps and new computational paradigms.

### Ecole Polytechnique

Virtual visit of the campus by means of panoramic images

### Previous LIX Automn Colloquium

Previous LIX/Ecole Polytechnique autumn colloquium:

- 2008: Emerging Trends in Visual Computing (ETVC'08)
- 2007: Complex Industrial Systems: Modelling, Verification and Optimization.
- 2006: Colloquium Emerging Trends in Concurrency Theory.

### Previous Reachability Problems

- 2008: RP'08 in Liverpool, UK
- 2007: RP'07 in Turku, Finland

### Sponsors

The annual fall colloquium organized by the computer science department of Ecole Polytechnique (LIX) will host Reachability Problems RP'2009.

Reachability Problems RP'2009 will take place at Ecole Polytechnique (on-site at Palaiseau, a suburb district of Paris).

Papers presenting original contributions related to reachability problems in different computational models and systems are being sought.

This will also be the occasion to review recent breakthroughs by renown invited experts and survey emerging trends and emphasize on key open challenges. Participants are kindly encouraged to discuss on core scientific issues that need to be further tackled.

### Topics

Reachability Problems is specifically aimed at gathering together scholars from diverse disciplines and backgrounds interested in reachability problems that appear in

- Algebraic structures
- Computational models
- Hybrid systems
- Verification

Topics of interest include (but are not limited to): Reachability problems in infinite state systems, rewriting systems, dynamical and hybrid systems; reachability problems in logic and verification; reachability analysis in different computational models, counter/ timed/ cellular/ communicating automata; Petri-Nets; computational aspects of algebraic structures (semigroups, groups and rings); predictability in iterative maps and new computational paradigms.

### Ecole Polytechnique

Virtual visit of the campus by means of panoramic images

### Previous LIX Automn Colloquium

Previous LIX/Ecole Polytechnique autumn colloquium:

- 2008: Emerging Trends in Visual Computing (ETVC'08)
- 2007: Complex Industrial Systems: Modelling, Verification and Optimization.
- 2006: Colloquium Emerging Trends in Concurrency Theory.

### Previous Reachability Problems

- 2008: RP'08 in Liverpool, UK
- 2007: RP'07 in Turku, Finland

### Sponsors

4hl482 bjkjhlgujuoh, [url=http://epohiluewfdh.com/]epohiluewfdh[/url], [link=http://sbvtscaqcmvj.com/]sbvtscaqcmvj[/link], http://bvwreanxjjyd.com/

### Previous Reachability Problems

- 2008: RP'08 in Liverpool, UK
- 2007: RP'07 in Turku, Finland

### Sponsors

The annual colloquium organized by the computer science department of Ecole Polytechnique (LIX) will host Reachability Problems RP'2009.

The annual fall colloquium organized by the computer science department of Ecole Polytechnique (LIX) will host Reachability Problems RP'2009.

### Ecole Polytechnique

Virtual visit of the campus by means of panoramic images

- 2008:

Emerging Trends in Visual Computing (ETVC'08)

- 2008: Emerging Trends in Visual Computing (ETVC'08)

### Previous LIX Automn Colloquium

Previous LIX/Ecole Polytechnique autumn colloquium:

- 2008:

Emerging Trends in Visual Computing (ETVC'08)

- 2007: Complex Industrial Systems: Modelling, Verification and Optimization.
- 2006: Colloquium Emerging Trends in Concurrency Theory.

The annual colloquium organized by the computer science department of Ecole Polytechnique (LIX) will host Reachability Problems RP'2009

Reachability Problems RP'2009 will take place at Ecole Polytechnique.

The annual colloquium organized by the computer science department of Ecole Polytechnique (LIX) will host Reachability Problems RP'2009.

Reachability Problems RP'2009 will take place at Ecole Polytechnique (on-site at Palaiseau, a suburb district of Paris).

Topics of interest include (but are not limited to): Reachability probelms in infinite state systems, rewriting systems, dynamical and hybrid systems; reachability problems in logic and verification; reachability analysis in different computational models, counter/ timed/ cellular/ communicating automata; Petri-Nets; computational aspects of algebraic structures (semigroups, groups and rings); predictability in iterative maps and new computational paradigms.

Topics of interest include (but are not limited to): Reachability problems in infinite state systems, rewriting systems, dynamical and hybrid systems; reachability problems in logic and verification; reachability analysis in different computational models, counter/ timed/ cellular/ communicating automata; Petri-Nets; computational aspects of algebraic structures (semigroups, groups and rings); predictability in iterative maps and new computational paradigms.

# Topics

### Topics

The annual colloquium organized by the computer science department of Ecole Polytechnique (LIX) will take place at the Ecole Polytechnique (on-site at Palaiseau, a suburb district of Paris) at the **Pierre Faurre** auditorium on November 18-20, 2008. A **direct bus shuttle** downtown Paris<->Ecole Polytechnique? will be provided to participants.

- Indications with pictures? for coming to Ecole Polytechique from Denfert-Rochereau (RER B+Bus 91.06)
- RER B from Denfert-Rochereau to Lozere(Ecole Polytechnique) + hill climbing (ascent method, recommended without lugagges): See .
- Pictures of the Pierre Faurre auditorium/Grand Hall?

This year, the international colloquium of LIX (Ecole Polytechnique) focuses on the emerging trends and challenges of the foundations of the cross-disciplinary area of visual computing. Visual computing encompasses computational geometry, computer graphics, machine vision and learning (just to name a few), and relies at its very heart on information geometry. Visual computing is underpinning major industrial applications as attested recently by the emerging fields of computational photography, 3D cinematography and advanced biomedical imaging.

The colloquium will review recent breakthroughs by renown invited experts and survey emerging trends and emphasize on key open challenges. Participants are kindly *encouraged* to discuss on core scientific and technological issues that need to be further tackled.

The bus will depart at Noon 30 (12h30) Hotel Montparnasse Alesia (147 ter rue d'Alesia, 75014 Paris)List of abstracts? in PDF format (12 pages)(detailed programme?)

ecole.gif Ecole Polytechnique | ETVC08-Poster-small.jpg? Download poster? | Xsky2.jpg Aerial view of "X" |

Virtual visit of the campus by means of panoramic images (auditorium Pierre Faure is located in the Grand Hall)

A state-of-the-art peer-reviewed edited book will be available from Springer-Verlag in the LNCS series.

lncs.gif 150logofr.gif

150th anniversary of franco-japanese relationships. Previous LIX/Ecole Polytechnique autumn colloquium:

- 2007: Complex Industrial Systems: Modelling, Verification and Optimization.
- 2006: Colloquium Emerging Trends in Concurrency Theory.

Please note that the X-Forum that gathers over 120 industrial partners, schools and universities will also take place in Nov. 19-20th 2008.

x.gif lixlogo.png cnrs.gif digiteo.gif ceregmia.bmp anr.bmp GDR-MathINFO.jpg

* Algebraic structures * Computational models * Hybrid systems * Verification

- Algebraic structures
- Computational models
- Hybrid systems
- Verification

Reachability Problems RP'2009 will indeed take place at Ecole Polytechnique.

Reachability Problems RP'2009 will take place at Ecole Polytechnique.

Topics of interest include (but are not limited to): Reachability probelms in infinite state systems, rewriting systems, dynamical and hybrid systems; reachability problems in logic and verification; reachability analysis in different computational models, counter/ timed/ cellular/ communicating automata; Petri-Nets; computational aspects of algebraic structures (semigroups, groups and rings); predictability in iterative maps and new computational paradigms.

Topics of interest include (but are not limited to): Reachability probelms in infinite state systems, rewriting systems, dynamical and hybrid systems; reachability problems in logic and verification; reachability analysis in different computational models, counter/ timed/ cellular/ communicating automata; Petri-Nets; computational aspects of algebraic structures (semigroups, groups and rings); predictability in iterative maps and new computational paradigms.

The annual colloquium organized by the computer science department of Ecole Polytechnique (LIX) will take place at the Ecole Polytechnique (on-site at Palaiseau, a suburb district of Paris) at the **Pierre Faurre** auditorium on November 18-20, 2008. A **direct bus shuttle** downtown Paris<->Ecole Polytechnique? will be provided to participants.

- Indications with pictures? for coming to Ecole Polytechique from Denfert-Rochereau (RER B+Bus 91.06)
- RER B from Denfert-Rochereau to Lozere(Ecole Polytechnique) + hill climbing (ascent method, recommended without lugagges): See .
- Pictures of the Pierre Faurre auditorium/Grand Hall?

This year, the international colloquium of LIX (Ecole Polytechnique) focuses on the emerging trends and challenges of the foundations of the cross-disciplinary area of visual computing. Visual computing encompasses computational geometry, computer graphics, machine vision and learning (just to name a few), and relies at its very heart on information geometry. Visual computing is underpinning major industrial applications as attested recently by the emerging fields of computational photography, 3D cinematography and advanced biomedical imaging.

The colloquium will review recent breakthroughs by renown invited experts and survey emerging trends and emphasize on key open challenges. Participants are kindly *encouraged* to discuss on core scientific and technological issues that need to be further tackled.

The bus will depart at Noon 30 (12h30) Hotel Montparnasse Alesia (147 ter rue d'Alesia, 75014 Paris)List of abstracts? in PDF format (12 pages)(detailed programme?)

ecole.gif Ecole Polytechnique | ETVC08-Poster-small.jpg? Download poster? | Xsky2.jpg Aerial view of "X" |

Virtual visit of the campus by means of panoramic images (auditorium Pierre Faure is located in the Grand Hall)

A state-of-the-art peer-reviewed edited book will be available from Springer-Verlag in the LNCS series.

lncs.gif 150logofr.gif

150th anniversary of franco-japanese relationships. Previous LIX/Ecole Polytechnique autumn colloquium:

- 2007: Complex Industrial Systems: Modelling, Verification and Optimization.
- 2006: Colloquium Emerging Trends in Concurrency Theory.

Please note that the X-Forum that gathers over 120 industrial partners, schools and universities will also take place in Nov. 19-20th 2008.

x.gif lixlogo.png cnrs.gif digiteo.gif ceregmia.bmp anr.bmp GDR-MathINFO.jpg

The Reachability Workshop is specifically aimed at gathering together scholars from diverse disciplines and backgrounds interested in reachability problems that appear in

Reachability Problems is specifically aimed at gathering together scholars from diverse disciplines and backgrounds interested in reachability problems that appear in

This will also be the occasion to review recent breakthroughs by renown invited experts and survey emerging trends and emphasize on key open challenges. Participants are kindly encouraged to discuss on core scientific issues that need to be further tackled.

Reachability Problems RP'2009 will take place at Ecole Polytechnique.

The annual colloquium organized by the computer science department of Ecole Polytechnique (LIX) will host Reachability Problems RP'2009

Reachability Problems RP'2009 will indeed take place at Ecole Polytechnique.

Reachability Problems RP'2009 will take place at .

Reachability Problems RP'2009 will take place at Ecole Polytechnique.

The Workshop on Reachability Problems will take place at on 2009. Papers presenting original contributions related to reachability problems in different computational models and systems are being sought.

Reachability Problems RP'2009 will take place at .

Papers presenting original contributions related to reachability problems in different computational models and systems are being sought.

The Workshop on Reachability Problems will take place at http://www.polytechnique.fr? on 2009. Papers presenting original contributions related to reachability problems in different computational models and systems are being sought.

The Workshop on Reachability Problems will take place at on 2009. Papers presenting original contributions related to reachability problems in different computational models and systems are being sought.

The Workshop on Reachability Problems will take place at www.polytechnique.fr? on 2009. Papers presenting original contributions related to reachability problems in different computational models and systems are being sought.

The Workshop on Reachability Problems will take place at http://www.polytechnique.fr? on 2009. Papers presenting original contributions related to reachability problems in different computational models and systems are being sought.

The Workshop on Reachability Problems will take place at Ecole Polytechnique on 2009. Papers presenting original contributions related to reachability problems in different computational models and systems are being sought.

The Workshop on Reachability Problems will take place at www.polytechnique.fr? on 2009. Papers presenting original contributions related to reachability problems in different computational models and systems are being sought.

The Workshop on Reachability Problems will take place at Ecole Polytechnique on 2009. Papers presenting original contributions related to reachability problems in different computational models and systems are being sought.

The Workshop on Reachability Problems will take place at Ecole Polytechnique on 2009. Papers presenting original contributions related to reachability problems in different computational models and systems are being sought.

## Thèmes Scientifiques

- thème 1
- thème 2
- thème 3

# Topics

The Reachability Workshop is specifically aimed at gathering together scholars from diverse disciplines and backgrounds interested in reachability problems that appear in * Algebraic structures * Computational models * Hybrid systems * Verification

Un des principaux objectifs du projet Carte est la prise en compte de l'adversité potentielle de certains acteurs d'un calcul dont le comportement est inconnu ou incertain. Nous avons appelé cette approche calcul adverse.

### Algorithmiques robustes et adverses

Un des enjeux essentiels est de prédire le comportement de calculs adverses, de construire des algorithmes robustes, c’est à dire tolérants aux fautes, prenant en compte des intérêts divergents, et résistants aux attaques à caractère viral. Une des originalités du projet est de combiner les deux approches suivantes.

- La première approche est l'analyse du comportement d'un système à grande échelle, qui est envisagée par des outils du continu et de la théorie des jeux.
- Dans la seconde approche, les outils envisagés pour construire des défenses proviennent plutôt de la logique, de la réécriture, et plus généralement de la théorie de la programmation.

### Modèles de calcul, calculabilité, complexité

Notre inspiration est guidée par plusieurs systèmes et modèles de calcul. Nous nous concentrerons sur trois modèles : modèles inspirés des réseaux, modèles hybrides et continus, et modèles inspirés de la virologie. Dans ce cadre, un de nos objectifs est de comprendre la calculabilité, la complexité et l'algorithmique des modèles étudiés.

### Objectifs :

- Théorie de la calculabilité et de la complexité continue
- Théorie algorithmique des jeux et applications aux réseaux
- Preuves coordonnées sur les systèmes formels
- Fondements de la virologie, et étude de mécanismes de défense
- Analyse des ressources, complexité implicite

## Relations scientifiques et industrielles

- ARA SSIA Sogea
- ARA SSIA Virus
- Collaborations avec les universités de Turin, Lisbonne, Bloomington (USA), …
- Computability in Europe (CiE)

- thème 1
- thème 2
- thème 3

- Collaborations avec l’université de Turin, Lisbonne, Bloomington (USA), …
- Computability in Europe (CIE)

- Collaborations avec les universités de Turin, Lisbonne, Bloomington (USA), …
- Computability in Europe (CiE)

- Fondement de la virologie, et étude de mécanismes de défense

- Fondements de la virologie, et étude de mécanismes de défense

* La première approche est l'analyse du comportement d'un système à grande échelle, qui est envisagée par des outils du continu et de la théorie des jeux. * Dans la seconde approche, les outils envisagés pour construire des défenses proviennent plutôt de la logique, de la réécriture, et plus généralement de la théorie de la programmation.

- La première approche est l'analyse du comportement d'un système à grande échelle, qui est envisagée par des outils du continu et de la théorie des jeux.
- Dans la seconde approche, les outils envisagés pour construire des défenses proviennent plutôt de la logique, de la réécriture, et plus généralement de la théorie de la programmation.

* Théorie de la calculabilité et de la complexité continue * Théorie algorithmique des jeux et applications aux réseaux * Preuves coordonnées sur les systèmes formels * Fondement de la virologie, et étude de mécanismes de défense * Analyse des ressources, complexité implicite

- Théorie de la calculabilité et de la complexité continue
- Théorie algorithmique des jeux et applications aux réseaux
- Preuves coordonnées sur les systèmes formels
- Fondement de la virologie, et étude de mécanismes de défense
- Analyse des ressources, complexité implicite

* ARA SSIA Sogea * ARA SSIA Virus * Collaborations avec l’université de Turin, Lisbonne, Bloomington (USA), … * Computability in Europe (CIE)

- ARA SSIA Sogea
- ARA SSIA Virus
- Collaborations avec l’université de Turin, Lisbonne, Bloomington (USA), …
- Computability in Europe (CIE)

coucou Isabelle

coucou Isabelle

* ARA SSIA Sogea

* ARA SSIA Sogea

### Relations scientifiques et industrielles

## Relations scientifiques et industrielles

Welcome to web pages of project CARTE.

(under construction)

## Menu

(:include Site.SideBar:)

## Thèmes Scientifiques

Un des principaux objectifs du projet Carte est la prise en compte de l'adversité potentielle de certains acteurs d'un calcul dont le comportement est inconnu ou incertain. Nous avons appelé cette approche calcul adverse.

### Algorithmiques robustes et adverses

Un des enjeux essentiels est de prédire le comportement de calculs adverses, de construire des algorithmes robustes, c’est à dire tolérants aux fautes, prenant en compte des intérêts divergents, et résistants aux attaques à caractère viral. Une des originalités du projet est de combiner les deux approches suivantes.

* La première approche est l'analyse du comportement d'un système à grande échelle, qui est envisagée par des outils du continu et de la théorie des jeux. * Dans la seconde approche, les outils envisagés pour construire des défenses proviennent plutôt de la logique, de la réécriture, et plus généralement de la théorie de la programmation.

### Modèles de calcul, calculabilité, complexité

Notre inspiration est guidée par plusieurs systèmes et modèles de calcul. Nous nous concentrerons sur trois modèles : modèles inspirés des réseaux, modèles hybrides et continus, et modèles inspirés de la virologie. Dans ce cadre, un de nos objectifs est de comprendre la calculabilité, la complexité et l'algorithmique des modèles étudiés.

### Objectifs :

* Théorie de la calculabilité et de la complexité continue * Théorie algorithmique des jeux et applications aux réseaux * Preuves coordonnées sur les systèmes formels * Fondement de la virologie, et étude de mécanismes de défense * Analyse des ressources, complexité implicite

### Relations scientifiques et industrielles

* ARA SSIA Sogea * ARA SSIA Virus * Collaborations avec l’université de Turin, Lisbonne, Bloomington (USA), … * Computability in Europe (CIE)

(:include Site.SideBar)

(:include Site.SideBar:)

(:include Site.Sidebar)

(:include Site.SideBar)

(include: Site.Sidebar)

(:include Site.Sidebar)

%include: Site.Sidebar

(include: Site.Sidebar)

## Menu

%include: Site.Sidebar

Welcome to the project CARTE.

- qu'est ce qu'on fait quand on est perdu?
- on demande à la carte:

Welcome to web pages of project CARTE.

(under construction)

A local copy of PmWiki's documentation has been installed along with the software, and is available via the documentation index.

To continue setting up PmWiki, see initial setup tasks.

The basic editing page describes how to create pages in PmWiki. You can practice editing in the wiki sandbox.

More information about PmWiki is available from http://www.pmwiki.org .

son chemin

son chemin

- qu'est ce qu'on fait quand on est perdu?
- on demande à la carte:

Welcome to PmWiki!

Welcome to the project CARTE.