The Z notation: a reference manual
The Z notation: a reference manual
Introduction to computer theory (revised ed.)
Introduction to computer theory (revised ed.)
Blending Object-Z and Timed CSP: an introduction to TCOZ
Proceedings of the 20th international conference on Software engineering
Proceedings of the Second International Conference on Integrated Formal Methods
IFM '00 Proceedings of the Second International Conference on Integrated Formal Methods
Proceedings of the Third International Conference on Integrated Formal Methods
IFM '02 Proceedings of the Third International Conference on Integrated Formal Methods
Nontraditional Applications of Automata Theory
TACS '94 Proceedings of the International Conference on Theoretical Aspects of Computer Software
A Formal Theory of Undirected Graphs in Higher-Order Logic
Proceedings of the 7th International Workshop on Higher Order Logic Theorem Proving and Its Applications
A Modular Framework for the Integration of Heterogeneous Notations and Tools
IFM '99 Proceedings of the 1st International Conference on Integrated Formal Methods
Integrating Object-Z with Timed Automata
ICECCS '05 Proceedings of the 10th IEEE International Conference on Engineering of Complex Computer Systems
Automata Theory with Modern Applications
Automata Theory with Modern Applications
Linking Finite Automata and Formal Methods Enhancing Modeling Power for Complex Systems
ICCSIT '08 Proceedings of the 2008 International Conference on Computer Science and Information Technology
Proceedings of the 6th international conference on Integrated formal methods
IFM'07 Proceedings of the 6th international conference on Integrated formal methods
Proceedings of the 5th international conference on Integrated Formal Methods
IFM'05 Proceedings of the 5th international conference on Integrated Formal Methods
| Hi-index | 0.00 |
The complexity of a system in terms of its state space and functional aspects enforces to choose most prolific and rigorous approaches to sustain the development of the software systems. Finite automaton is a formal and natural medium to describe the static and dynamic behavior of a complex system. Z notation is an ideal specification language having inherent capability to describe state space of a system and then defining operations over it. This paper deals with the integration of finite automata and Z which can enhance the modeling power for a complex system. Although Moore machine cannot be used for language recognition but its conversion into deterministic finite automata makes it possible to pretend as a language recognizer. Here a formal conversion of Moore machine to deterministic finite automata based on a string as well as a language is proposed using Z. Formal specification of the linkage between Z and automata is analyzed and validated using Z/EVES tool.