On the random structure of behavioural transition systems

Onderzoeksoutput: Boek/rapportRapportAcademic

80 Downloads (Pure)

Uittreksel

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.
Originele taal-2Engels
Plaats van productieEindhoven
UitgeverijTechnische Universiteit Eindhoven
Aantal pagina's27
StatusGepubliceerd - 2014

Publicatie series

NaamComputer science reports
Volume1401
ISSN van geprinte versie0926-4515

Vingerafdruk

Random graphs
State space
Modeling
Alternative models
Software
Graph model
Testing
Graph

Citeer dit

Groote, J. F., van der Hofstad, R. W., & Raffelsieper, M. (2014). On the random structure of behavioural transition systems. (Computer science reports; Vol. 1401). Eindhoven: Technische Universiteit Eindhoven.
Groote, J.F. ; van der Hofstad, Remco W. ; Raffelsieper, M. / On the random structure of behavioural transition systems. Eindhoven : Technische Universiteit Eindhoven, 2014. 27 blz. (Computer science reports).
@book{b5667c7aa999442c86f8aca162ff2f50,
title = "On the random structure of behavioural transition systems",
abstract = "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{\"o}s-R{\'e}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.",
author = "J.F. Groote and {van der Hofstad}, {Remco W.} and M. Raffelsieper",
year = "2014",
language = "English",
series = "Computer science reports",
publisher = "Technische Universiteit Eindhoven",

}

Groote, JF, van der Hofstad, RW & Raffelsieper, M 2014, 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.

Eindhoven : Technische Universiteit Eindhoven, 2014. 27 blz. (Computer science reports; Vol. 1401).

Onderzoeksoutput: Boek/rapportRapportAcademic

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 -

Groote JF, van der Hofstad RW, Raffelsieper M. On the random structure of behavioural transition systems. Eindhoven: Technische Universiteit Eindhoven, 2014. 27 blz. (Computer science reports).