Semantics transformation of NFA to Z notation by constructing union of regular languages

  • Authors:
  • Nazir Ahmad Zafar;Nabeel Sabir;Amir Ali

  • Affiliations:
  • Department of Computer and Information Sciences, Pakistan Institute of Engineering Applied Sciences, Nilore, Islamabad, Pakistan;Faculty of Information Technology, University of Central Punjab, Lahore, Pakistan;Faculty of Information Technology, University of Central Punjab, Lahore, Pakistan

  • Venue:
  • ACS'08 Proceedings of the 8th conference on Applied computer scince
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

Automata theory plays a vital role in modeling behavior while Z notation is an ideal specification language for describing state space of a system. Consequently, integration of automata and Z will be a useful tool for increasing modeling power of complex systems. Further, nondeterministic finite automata (NFA) may have different implementations and therefore it is needed to verify the transformation from diagrams to code. If we describe formal specification of an NFA before implementing then confidence over transformation can be increased. In this paper, we have combined NFA with Z and a linkage is established between these approaches. At this level of integration, we have given a formal procedure to transform NFA to Z. A string accepter is designed and then extended to the language accepter. Finally, NFA accepting union of two regular languages is constructed by describing formal specification of their relationships. The specification is analyzed and validated using Z/EVES tool.