# Evaluating Learning Algorithms for Stochastic Finite Automata - Comparative Empirical Analyses on Learning Models for Technical Systems

### Asmir Vodenčarević, Alexander Maier, Oliver Niggemann

#### Abstract

Finite automata are used to model a large variety of technical systems and form the basis of important tasks such as model-based development, early simulations and model-based diagnosis. However, such models are today still mostly derived manually, in an expensive and time-consuming manner. Therefore in the past twenty years, several successful algorithms have been developed for learning various types of finite automata. These algorithms use measurements of the technical systems to automatically derive the underlying automata models. However, today users face a serious problem when looking for such model learning algorithm: Which algorithm to choose for which problem and which technical system? This papers closes this gap by comparative empirical analyses of the most popular algorithms (i) using two real-world production facilities and (ii) using artificial datasets to analyze the algorithms’ convergence and scalability. Finally, based on these results, several observations for choosing an appropriate automaton learning algorithm for a specific problem are given.

#### References

- Alur, R., Courcoubetis, C., Halbwachs, N., Henzinger, T. A., h. Ho, P., Nicollin, X., Olivero, A., Sifakis, J., and Yovine, S. (1995). The algorithmic analysis of hybrid systems. Theoretical Computer Science, 138:3- 34.
- Alur, R. and Dill, D. (1994). A theory of timed automata. Theoretical Computer Science, vol. 126:183-235.
- Angluin, D. (1988). Identifying languages from stochastic examples. In Yale University technical report, YALEU/DCS/RR-614.
- Branicky, M. S. (2005). Introduction to hybrid systems. In Handbook of Networked and Embedded Control Systems, pages 91-116.
- Cabasino, M. P., Giua, A., and Seatzu, C. (2010). Fault detection for discrete event systems using petri nets with unobservable transitions. Automatica, 46(9):1531- 1539.
- Carrasco, R. C. and Oncina, J. (1994). Learning stochastic regular grammars by means of a state merging method. In GRAMMATICAL INFERENCE AND APPLICATIONS, pages 139-152. Springer-Verlag.
- Carrasco, R. C. and Oncina, J. (1999). Learning deterministic regular grammars from stochastic samples in polynomial time. In RAIRO (Theoretical Informatics and Applications), volume 33, pages 1-20.
- Cassandras, C. G. and Lafortune, S. (2008). Introduction to Discrete Event Systems. 2.ed. Springer.
- David, R. and Alla, H. (1987). Continuous petri nets. In Proc. of the 8th European Workshop on Application and Theory of Petri Nets, pages 275-294. Zaragoza, Spain.
- David, R. and Alla, H. (2001). On hybrid petri nets. Discrete Event Dynamic Systems, 11(1-2):9-40.
- Hastie, T., Tibshirani, R., and Friedman, J. (2008). The elements of statistical learning: data mining, inference and prediction. Springer, 2 edition.
- Henzinger, T. A. (1996). The theory of hybrid automata. In Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science, LICS 7896, pages 278- 292, Washington, DC, USA. IEEE Computer Society.
- Hoeffding, W. (1963). Probability inequalities for sums of bounded random variables. Journal of the American Statistical Association, 58(301):pp. 13-30.
- Hofbaur, M. W. and Williams, B. C. (2002). Mode estimation of probabilistic hybrid systems. In Intl. Conf. on Hybrid Systems: Computation and Control, pages 253-266. Springer Verlag.
- Kumar, B., Niggemann, O., and Jasperneite, J. (2010). Statistical models of network traffic. In International Conference on Computer, Electrical and Systems Science. Cape Town, South Africa.
- Maier, A., Vodenc?arevic, A., Niggemann, O., Just, R., and Jäger, M. (2011). Anomaly detection in production plants using timed automata. In 8th International Conference on Informatics in Control, Automation and Robotics (ICINCO), pages 363-369. Noordwijkerhout, The Netherlands.
- Narasimhan, S. and Biswas, G. (2007). Model-based diagnosis of hybrid systems. Systems, Man and Cybernetics, Part A: Systems and Humans, IEEE Transactions on, 37(3):348 -361.
- Niggemann, O., Stein, B., Vodenc?arevic, A., Maier, A., and Kleine Büning, H. (2012). Learning behavior models for hybrid timed systems. In Twenty-Sixth Conference on Artificial Intelligence (AAAI-12), pages 1083- 1090, Toronto, Ontario, Canada.
- Niggemann, O. and Stroop, J. (2008). Models for model's sake: why explicit system models are also an end to themselves. In ICSE 7808: Proceedings of the 30th international conference on Software engineering, pages 561-570, New York, NY, USA. ACM.
- Pethig, F., Kroll, B., Niggemann, O., Maier, A., Tack, T., and Maag, M. (2012). A generic synchronized data acquisition solution for distributed automation systems. In Proc. of the 17th IEEE International Conf. on Emerging Technologies and Factory Automation ETFA'2012, Krakow, Poland (in press).
- Reber, A. S. (1967). Implicit learning of artificial grammars. Journal of Verbal Learning and Verbal Behavior, 6(6):855 - 863.
- Thollard, F., Dupont, P., and de la Higuera, C. (2000). Probabilistic DFA inference using Kullback-Leibler divergence and minimality. In Proc. of the 17th International Conf. on Machine Learning, pages 975-982. Morgan Kaufmann.
- Vidal, E., Thollard, F., de la Higuera, C., Casacuberta, F., and Carrasco, R. C. (2005). Probabilistic finite-state machines-part ii. IEEE Transactions on Pattern Analysis and Machine Intelligence, 27:1026-1039.
- Vodenc?arevic, A., Kleine Büning, H., Niggemann, O., and Maier, A. (2011). Identifying behavior models for process plants. In Proc. of the 16th IEEE International Conf. on Emerging Technologies and Factory Automation ETFA'2011, pages 937-944, Toulouse, France.
- Wang, M. and Dearden, R. (2009). Detecting and Learning Unknown Fault States in Hybrid Diagnosis. In Proceedings of the 20th International Workshop on Principles of Diagnosis, DX09, pages 19-26, Stockholm, Sweden.
- Zhao, F., Koutsoukos, X. D., Haussecker, H. W., Reich, J., and Cheung, P. (2005). Monitoring and fault diagnosis of hybrid systems. IEEE Transactions on Systems, Man, and Cybernetics, Part B, 35(6):1225-1240.

#### Paper Citation

#### in Harvard Style

Vodenčarević A., Maier A. and Niggemann O. (2013). **Evaluating Learning Algorithms for Stochastic Finite Automata - Comparative Empirical Analyses on Learning Models for Technical Systems** . In *Proceedings of the 2nd International Conference on Pattern Recognition Applications and Methods - Volume 1: ICPRAM,* ISBN 978-989-8565-41-9, pages 229-238. DOI: 10.5220/0004255702290238

#### in Bibtex Style

@conference{icpram13,

author={Asmir Vodenčarević and Alexander Maier and Oliver Niggemann},

title={Evaluating Learning Algorithms for Stochastic Finite Automata - Comparative Empirical Analyses on Learning Models for Technical Systems},

booktitle={Proceedings of the 2nd International Conference on Pattern Recognition Applications and Methods - Volume 1: ICPRAM,},

year={2013},

pages={229-238},

publisher={SciTePress},

organization={INSTICC},

doi={10.5220/0004255702290238},

isbn={978-989-8565-41-9},

}

#### in EndNote Style

TY - CONF

JO - Proceedings of the 2nd International Conference on Pattern Recognition Applications and Methods - Volume 1: ICPRAM,

TI - Evaluating Learning Algorithms for Stochastic Finite Automata - Comparative Empirical Analyses on Learning Models for Technical Systems

SN - 978-989-8565-41-9

AU - Vodenčarević A.

AU - Maier A.

AU - Niggemann O.

PY - 2013

SP - 229

EP - 238

DO - 10.5220/0004255702290238