Formal specification of finite automata and regular expressions. | [Proceedings of International Conference on Information Communication Technologies • 2008]

Author(s):

1. Syed Hasnain Haider Gilani: Faculty of Information Technology, University of Central Punjab, Lahore, Pakistan

2. Nazir Ahmad Zafar: Department of Computer and Information Sciences, Pakistan Institute of Engineering and Applied Sciences, Nilore, Islamabad, Pakistan

Abstract:

The design of a complex system requires both functional and behavior representation. Formal methods are mathematical based techniques for the specifications of hardware and software systems. The Z notation is an ideal specification language for capturing functionality of the system. It uses abstract data type to represent a system. Automata theory is a powerful tool to capture the control behavior of the system. As a result integration of Z notation and automata will be an efficient tool increase modeling power for a complex system. In this paper, the authors described a relationship between both approaches. The authors constructed deterministic finite automata then string acceptor as well as language acceptor. Finally then they formally specify the nondeterministic finite automata and regular expressions. These specifications are analyzed and validate with Z/EVES tool.

Page(s): 45-50

DOI: DOI not available

Published: Journal: Proceedings of International Conference on Information Communication Technologies, Volume: 27, Issue: 0, Year: 2008

Keywords:

Keywords are not available for this article.

References:

References are not available for this document.

Citations

Citations are not available for this document.

Citations

Downloads

Views