Constructive formal conversion of Moore machine to deterministic finite automata
Abstract
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.
References
[1]
A. Hall, "Correctness by Construction: Integrating Formality into a Commercial Development Process", Praxis Critical Systems Limited, U.K. Springer-Verlag, London. ISBN:3-540-43928-5.
[2]
C. J. Burgess, "The Role of Formal Methods in Software Engineering Education and Industry", University of Bristol, UK. 1995.
[3]
B. A. L. Gwandu and D. J. Creasey," The importance of formal specification in the design of hardware systems", School of Electron. & Electr. Eng., Birmingham University, 1994.
[4]
H. A. Gabbar, "Fundamentals of Formal Methods, Modern Formal Methods and Applications", Springer Netherlands, ISBN, 978-1-4020-4222-5, 2006.
[5]
E. A. Boiten, J. Derrick and G. Smith, "Integrated Formal Methods", IFM 2004, Canterbury, UK, Springer-Verlag, 2004.
[6]
J. Davies and J. Gibbons, "Integrated Formal Methods", IFM 2007, Oxford, UK, Springer-Verlag, 2007.
[7]
J. Romijn, G. Smith and J. v.d. Pol, "Integrated Formal Methods, IFM 2005, Eindhoven, The Netherlands, Springer-Verlag, 2005.
[8]
K. Araki, A. Galloway and K. Taguchi, "Integrated Formal Methods", IFM 99, York, UK, Springer-Verlag, 1999.
[9]
M. Butler, L. Petre and K. Sere, "Integrated Formal Methods", IFM 2002, Turku, Finland, Springer-Verlag, 2002.
[10]
W. Grieskamp, T. Santen, and B. Stoddart, "Integrated Formal Methods", IFM 2000, Dagstuhl Castle, Germany, Springer-Verlag, 2000.
[11]
R. T. Bout, "Integrating Formal Methods by Unifying Abstractions", Intec, Ghent University, Belgique, 2006.
[12]
J. S. Dong, R. Duke and P. Hao, "Integrating Object-Z with Timed Automata", ICECCS'05, pp 488-497, 2005.
[13]
J. S. Dong, et al., "Timed Patterns: TCOZ to Timed Automata", The 6th International Conference on Formal Engineering Methods (ICFEM'04), LNCS, pp 483-498, 2004.
[14]
C.T. Chou, "A Formal Theory of Undirected Graphs in Higher Order Logic", 7th Internationall Workshop on Higher Order Logic Theorem Proving and Application, pp.144-157, 1994.
[15]
R. Bussow and W. Grieskamp, A Modular Framework for the Integration of Heterogeneous Notations and Tools, Integrated Formal Methods (IFM 99), York, UK, Springer-Verlag, 211-230, 1999.
[16]
M. Heiner and M. Heisel, "Modeling safety-critical systems with Z and Petri nets", International Conference on Computer Safety, Reliability and Security, LNCS, Springer, pages 361-374, 1999.
[17]
X. He, PZ Nets - A Formal Method Integrating Petri Nets with Z", Information & Software Technology, 43(1):1-18, 2001.
[18]
M. Conrad, D. Hotzer, "Selective Integration of Formal Methods in the Development of Electronic Control Units", Research Institute for Automotive Engineering and Vehicle Engines, 1998.
[19]
B. P. Mahony, J. S. Dong, "Blending Object-Z and Timed CSP: An Introduction to TCOZ" 1998.
[20]
J. A. Anderson, "Automata Theory with Modern Applications", Cambridge University Press. ISBN: 9780511223013, 2006
[21]
C. L. Lucchesi and T. Kowaltowski, "Applications of Finite Automata Representing Large Vocabularies", 1992.
[22]
M. Y. Vardi, "Nontraditional Applications of Automata Theory", In Theoretical Aspects of Computer Software, ISBN:3-540-57887-0 (1994).
[23]
J. M. Wing, A Specifier, "Introduction to Formal Methods", IEEE Computer, Vol.23, No.9, pp.8-24, 1990.
[24]
J.M. Spivey, "The Z notation: A Reference Manual", Englewood Cliffs, NJ, Printice-Hall, 1989.
[25]
T. D. Pham, "Computing with words in formal methods", University of Canberra, ACT 2601, Australie, 2000.
[26]
J. P. Bowen, "Formal Specification and Documentation Using Z: A Case Study Approach", International Thomson Computer Press, 1996.
[27]
S. A. Vilkomir and J. P. Bowen, "Formalization of Software Testing Criterion", South Bank University, London, ISBN: 0-7695-1372-7, 2001.
[28]
D. I. A. Cohen, "Introduction to Computer Theory", 2ns Edition, City University of New York, pp. 149-152, 2000.
[29]
N. Sabir, A. Ali, and N. A. Zafar, "Linking Finite Automata and Formal Methods Enhancing Modeling Power for Complex Systems", International Conference on Computer Science and Information Technology (ICCSIT 2008), Singapore, 2008. (Accepted).
Index Terms
- Constructive formal conversion of Moore machine to deterministic finite automata
Recommendations
Algorithmic Formal Proof of Equivalence of Nondeterministic and Deterministic Finite Automata
ICECT '09: Proceedings of the 2009 International Conference on Electronic Computer TechnologyThe design of a complex system requires both functional and behavior representation. Formal methods are mathematical based techniques used for specifications of properties hardware and software systems. The Znotation is a formal technique used for ...
Minimizing Deterministic Lattice Automata
Traditional automata accept or reject their input and are therefore Boolean. In contrast, weighted automata map each word to a value from a semiring over a large domain. The special case of lattice automata, in which the semiring is a finite lattice, ...
Minimal cover-automata for finite languages
A cover-automaton A of a finite language L Σ is a finite deterministic automaton (DFA) that accepts all words in L and possibly other words that are longer than any word in L. A minimal deterministic finite cover automaton (DFCA) of a finite language L ...
Comments
Information & Contributors
Information
Published In
October 2008
510 pages
ISBN:9789604740123
Publisher
World Scientific and Engineering Academy and Society (WSEAS)
Stevens Point, Wisconsin, United States
Publication History
Published: 26 October 2008
Author Tags
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 29 Jan 2025