J'avais oublié de dire que la publi journal suivante a été accepté :
Sophie Laplante, Richard Lassaigne, Frédéric Magniez, Sylvain Peyronnet
and Michel de Rougemont. Probabilistic abstraction for model checking:
An approach based on property testing. accepted to ACM TOCL.
Voili voilo
S.
Thomas, Sylvain et Akim sont heureux de vous faire part de
l'acceptation de leur article à RIVF 2006.
Probabilistic Verification of Sensor Networks
https://publications.lrde.epita.fr/2006-02-rivf
Sensor networks are networks consisting of miniature and low-cost
systems with limited computation power and energy. Thanks to the low
cost of the devices, one can spread a huge number of sensors into a
given area to monitor, for example, physical change of the
environment. Typical applications are in defense, environment, and
design of ad-hoc networks areas.
In this paper, we address the problem of verifying the correctness of
such networks through a case study. We modelize a simple sensor
network whose aim is to detect the apparition of an event in a bounded
area (such as a fire in a forest). The behaviour of the network is
probabilistic, so we use APMC, a tool that allows to approximately
check the correctness of extremely large probabilistic systems, to
verify it.
@InProceedings{ demaille.06.rivf,
author = {Akim Demaille and Sylvain Peyronnet and Thomas
Hérault},
title = {Probabilistic Verification of Sensor Networks},
booktitle = {Proceedings of the Fourth IEEE International
Conference on Computer Sciences, Research,
Innovation and Vision for the Future (RIVF)},
year = {2006},
address = {Ho {C}hi {M}inh City, {V}ietnam},
month = {February},
project = {APMC},
}
Le LRDE vous annonce la disponibilité de la version 0.7.2 de la bibliothèque
de manipulation d'automates finis Vaucanson.
http://vaucanson.lrde.epita.fr
Cette version propose des correctifs afin de rendre la bibliothèque
compatible avec les dernières versions des compilateurs GNU C++ et Intel C++.
--
Louis-Noel Pouchet
pouchet(a)lrde.epita.fr
