View source for Publications/demaille.06.rivf

{{Publication
| published = true
| date = 2006-02-01
| authors = Akim Demaille, Sylvain Peyronnet, Thomas Hérault
| title = Probabilistic Verification of Sensor Networks
| booktitle = Proceedings of the Fourth International Conference on Computer Sciences, Research, Innovation and Vision for the Future (RIVF'06)
| address = Ho Chi Minh City, Vietnam
| project = APMC
| urllrde = 200602-rivf
| abstract = 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 defenseenvironment, 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.
| lrdeslides = http://www.lrde.epita.fr/dload/papers/demaille.06.rivf.slides.pdf
| lrdepaper = http://www.lrde.epita.fr/dload/papers/demaille.06.rivf.pdf
| lrdeprojects = APMC
| type = inproceedings
| id = demaille.06.rivf
| identifier = isbn:1-4244-0316-2
| bibtex = 
@InProceedings<nowiki>{</nowiki>	  demaille.06.rivf,
  author	= <nowiki>{</nowiki>Akim Demaille and Sylvain Peyronnet and Thomas H\'erault<nowiki>}</nowiki>,
  title		= <nowiki>{</nowiki>Probabilistic Verification of Sensor Networks<nowiki>}</nowiki>,
  booktitle	= <nowiki>{</nowiki>Proceedings of the Fourth International Conference on
		  Computer Sciences, Research, Innovation and Vision for the
		  Future (RIVF'06)<nowiki>}</nowiki>,
  year		= 2006,
  address	= <nowiki>{</nowiki>Ho Chi Minh City, Vietnam<nowiki>}</nowiki>,
  isbn		= <nowiki>{</nowiki>1-4244-0316-2<nowiki>}</nowiki>,
  month		= feb,
  project	= <nowiki>{</nowiki>APMC<nowiki>}</nowiki>,
  abstract	= <nowiki>{</nowiki>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.<nowiki>}</nowiki>
<nowiki>}</nowiki>

}}