### Uittreksel

Originele taal-2 | Engels |
---|---|

Plaats van productie | Eindhoven |

Uitgeverij | Technische Universiteit Eindhoven |

Aantal pagina's | 27 |

Status | Gepubliceerd - 2014 |

### Publicatie series

Naam | Computer science reports |
---|---|

Volume | 1401 |

ISSN van geprinte versie | 0926-4515 |

### Vingerafdruk

### Citeer dit

*On the random structure of behavioural transition systems*. (Computer science reports; Vol. 1401). Eindhoven: Technische Universiteit Eindhoven.

}

*On the random structure of behavioural transition systems*. Computer science reports, vol. 1401, Technische Universiteit Eindhoven, Eindhoven.

**On the random structure of behavioural transition systems.** / Groote, J.F.; van der Hofstad, Remco W.; Raffelsieper, M.

Onderzoeksoutput: Boek/rapport › Rapport › Academic

TY - BOOK

T1 - On the random structure of behavioural transition systems

AU - Groote, J.F.

AU - van der Hofstad, Remco W.

AU - Raffelsieper, M.

PY - 2014

Y1 - 2014

N2 - Random graphs have the property that they are very predictable. Even by exploring a small part reliable observations are possible regarding their structure and size. An unfortunate observation is that standard models for random graphs, such as the Erdös-Rényi model, do not reflect the structure of the graphs that we find in behavioural modelling. In this paper we propose an alternative model, which we show to be a better reflection of ‘real’ state spaces. We show how we can use this structure to predict the size of state spaces, and we show that in this model software bugs are much easier to find than in the more standard random graph models. Not only gives this theoretical evidence that testing might be more effective than thought by some, but it also gives means to quantify the amount of residual errors based on a limited number of test runs.

AB - Random graphs have the property that they are very predictable. Even by exploring a small part reliable observations are possible regarding their structure and size. An unfortunate observation is that standard models for random graphs, such as the Erdös-Rényi model, do not reflect the structure of the graphs that we find in behavioural modelling. In this paper we propose an alternative model, which we show to be a better reflection of ‘real’ state spaces. We show how we can use this structure to predict the size of state spaces, and we show that in this model software bugs are much easier to find than in the more standard random graph models. Not only gives this theoretical evidence that testing might be more effective than thought by some, but it also gives means to quantify the amount of residual errors based on a limited number of test runs.

M3 - Report

T3 - Computer science reports

BT - On the random structure of behavioural transition systems

PB - Technische Universiteit Eindhoven

CY - Eindhoven

ER -