Test Case Generation Using Stochastic Automata Networks: Quantitative Analysis

Authors:
Cristiano Bertolini;Farina Farina;Paulo Fernandes;Flavio M. Oliveira
Affiliations:
Pontifícia Universidade Católica do Rio Grande do Sul, Brazil;Pontifícia Universidade Católica do Rio Grande do Sul, Brazil;-;Pontifícia Universidade Católica do Rio Grande do Sul, Brazil
Venue:
SEFM '04 Proceedings of the Software Engineering and Formal Methods, Second International Conference
Year:
2004

Citing 0
Cited 3

Testing software modelling tools using data mutation

Proceedings of the 2006 international workshop on Automation of software test
Neural networks based automated test oracle for software testing

ICONIP'06 Proceedings of the 13th international conference on Neural information processing - Volume Part III
Performance Evaluation of Software Development Teams: a Practical Case Study

Electronic Notes in Theoretical Computer Science (ENTCS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

The software engineering community has been using Markov Chains (MC) to describe usage models. We have been working on the use of a more sophisticated discrete state formalism: Stochastic Automata Networks (SAN). SAN is a formalism with the same power of description as MC; however, a system in SAN is described as a collection of subsystems described by local states, transitions and synchronizing events, allowing higher modularity and maintainability. We present a description of SAN formalism, as well as quantitative analysis of the modeling examples considering the generation time, quality of the test suites.