Generating random values using Binary Decision Diagrams and Convex Polyhedra - Archive ouverte HAL Access content directly
Book Sections Year : 2007

Generating random values using Binary Decision Diagrams and Convex Polyhedra

Erwan Jahier
Pascal Raymond

Abstract

This article describes algorithms to solve Boolean and numerical constraints, and to randomly select values among the set of solutions. Those algorithms were first designed to generate inputs for testing and simulating reactive real-time programs. As a consequence, the chose a solving technology that allow a fine control in the way solutions are elected. Indeed, a fair selection is sometimes required, while favoring limit cases is often interesting for testing. Moreover, simulating a single reactive execution means generating several hundreds or even several thousands of atomic steps, and thus as many solving steps. Hence, the emphasis is put on efficiency, sometimes sacrificing precision or fairness.
Fichier principal
Vignette du fichier
article.pdf (169.28 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00389766 , version 1 (29-05-2009)

Identifiers

  • HAL Id : hal-00389766 , version 1

Cite

Erwan Jahier, Pascal Raymond. Generating random values using Binary Decision Diagrams and Convex Polyhedra. Frédéric Benhamou and Narendra Jussien and Barry O'Sullivan. Trends in Constraint Programming, ISTE, 416 pp., 2007. ⟨hal-00389766⟩
224 View
258 Download

Share

Gmail Facebook X LinkedIn More