Construction of Intersection of Nondeterministic Finite Automata using Z Notation

Functionalities and control behavior are both primary requirements in design of a complex system. Automata theory plays an important role in modeling behavior of a system. Z is an ideal notation which is used for describing state space of a system and then defining operations over it. Consequently, an integration of automata and Z will be an effective tool for increasing modeling power for a complex system. Further, nondeterministic finite automata (NFA) may have different implementations and therefore it is needed to verify the transformation from diagrams to a code. If we describe formal specification of an NFA before implementing it, then confidence over transformation can be increased. In this paper, we have given a procedure for integrating NFA and Z. Complement of a special type of NFA is defined. Then union of two NFAs is formalized after defining their complements. Finally, formal construction of intersection of NFAs is described. The specification of this relationship is analyzed and validated using Z/EVES tool. Keywords—Modeling, Nondeterministic finite automata, Z notation, Integration of approaches, Validation.

[1]  Dino Mandrioli,et al.  From formal models to formally based methods: an industrial experience , 1999, TSEM.

[2]  Eitan M. Gurari,et al.  Introduction to the theory of computation , 1989 .

[3]  Jeannette M. Wing.  A specifier's introduction to formal methods , 1990, Computer.

[4]  Jonathan P. Bowen,et al.  The use of industrial-strength formal methods , 1997, Proceedings Twenty-First Annual International Computer Software and Applications Conference (COMPSAC'97).

[5]  Borivoj Melichar,et al.  Finding Common Motifs with Gaps Using Finite Automata , 2006, CIAA.

[6]  Wang Yi,et al.  Timed Patterns: TCOZ to Timed Automata , 2004, ICFEM.

[7]  Constance L. Heitmeyer,et al.  On the Need for Practical Formal Methods , 1998, FTRTFT.

[8]  Jin Song Dong,et al.  Integrating Object-Z with timed automata , 2005, 10th IEEE International Conference on Engineering of Complex Computer Systems (ICECCS'05).

[9]  Jonathan P. Bowen,et al.  Ten Commandments of Formal Methods , 1995, Computer.

[10]  Robert L. Constable,et al.  Constructively formalizing automata theory , 2000, Proof, Language, and Interaction.

[11]  Erhard Plödereder,et al.  Myths and Facts about the Efficient Implementation of Finite Automata and Lexical Analysis , 1998, CC.

[12]  Robert Geisler,et al.  Specifying Safety-Critical Embedded Systems with Statecharts and Z: A Case Study , 1998, FASE.

[13]  John Kelly,et al.  Experiences Using Lightweight Formal Methods for Requirements Modeling , 1998, IEEE Trans. Software Eng..

[14]  Wolfgang Grieskamp,et al.  A Modular Framework for the Integration of Heterogeneous Notations and Tools , 1999, IFM.

[15]  Jonathan P. Bowen,et al.  Formal Methods , 2010, Computing Handbook, 3rd ed..

[16]  A. S. Thoke,et al.  International Journal of Electrical and Computer Engineering 3:16 2008 Fault Classification of Double Circuit Transmission Line Using Artificial Neural Network , 2022 .

[17]  Jeanine Souquières,et al.  Integration of UML and B specification techniques: systematic transformation from OCL expressions into B , 2002, Ninth Asia-Pacific Software Engineering Conference, 2002..

[18]  Monika Heiner,et al.  Modeling Safety-Critical Systems with Z and Petri Nets , 1999, SAFECOMP.

[19]  Ching-Tsun Chou.  A Formal Theory of Undirected Graphs in Higher-Order Logic , 1994, TPHOLs.

[20]  Xudong He,et al.  PZ nets a formal method integrating Petri nets with Z , 2001, Inf. Softw. Technol..

[21]  Jeanine Souquières,et al.  Integration of UML Views using B Notation , 2002 .

[22]  J. Michael Spivey,et al.  The Z notation - a reference manual , 1992, Prentice Hall International Series in Computer Science.

[23]  Lv Yi,et al.  The State of the Art in Formal Methods:A Survey , 2003 .

[24]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .