TY - GEN
T1 - The teachers' crowd
T2 - International Workshops on Software Aspects of Robotic Systems, SARS 2011 and Machine Learning for System Construction, MLSC 2011, Held Under the Auspices of the ISoLA 2011
AU - Howar, Falk
AU - Bauer, Oliver
AU - Merten, Maik
AU - Steffen, Bernhard
AU - Margaria, Tiziana
PY - 2012
Y1 - 2012
N2 - In this paper we address the major bottleneck of active automata learning, the typically huge number of required tests, by investigating the impact of using a distributed testing environment (a crowd of teachers) to execute test cases (membership queries) in parallel. This kind of parallelization of automata learning has the best potential when the time for test case execution is dominant, an assumption valid for most practical applications. Our investigation explicitly focuses on the impact of the structure of the system under learning (number of states, size of alphabet) and the degree of supported parallelism. It comprises three variants of active learning algorithms with different test case generation profiles. These differences can be observed directly at the level of the run-times, which all show a linear speedup for moderate degrees of parallelization, but with different saturation points beyond which further parallelization does not pay off.
AB - In this paper we address the major bottleneck of active automata learning, the typically huge number of required tests, by investigating the impact of using a distributed testing environment (a crowd of teachers) to execute test cases (membership queries) in parallel. This kind of parallelization of automata learning has the best potential when the time for test case execution is dominant, an assumption valid for most practical applications. Our investigation explicitly focuses on the impact of the structure of the system under learning (number of states, size of alphabet) and the degree of supported parallelism. It comprises three variants of active learning algorithms with different test case generation profiles. These differences can be observed directly at the level of the run-times, which all show a linear speedup for moderate degrees of parallelization, but with different saturation points beyond which further parallelization does not pay off.
UR - http://www.scopus.com/inward/record.url?scp=84868362469&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-34781-8_18
DO - 10.1007/978-3-642-34781-8_18
M3 - Conference contribution
AN - SCOPUS:84868362469
SN - 9783642347801
T3 - Communications in Computer and Information Science
SP - 232
EP - 247
BT - Leveraging Applications of Formal Methods, Verification, and Validation - International Workshops, SARS 2011 and MLSC 2011, Held Under the Auspices of ISoLA 2011, Revised Selected Papers
Y2 - 17 October 2011 through 18 October 2011
ER -