A Study on Network Protocol Validation Based on Timed Automata

Article Preview

Abstract:

With the increasingly complex of computer software system, traditional software engineering methods for major software development will inevitably produce a lot of mistakes and catastrophic consequences for key industry users. Experiment with software engineering methods cannot guarantee the behavior at infinity reliability and security of the state space. All this requires formal analysis and verification to the complex system. In protocol verification based on automatic machines, the automaton is used to represent the behavior of the system, the time automaton is a formal method can be well applied to the network protocol verification.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

3386-3390

Citation:

Online since:

March 2014

Authors:

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2014 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] Y. Li, B. Peng, D. B. Xiao: Computer network communication protocol verification technology research. Computer engineering, Vol. 28 (2002) No. 11, pp.251-252.

Google Scholar

[2] L. J. Wu, K. L. Su: Study on the method of security protocol authentication formal. Computer engineering, Vol. 40 (2004) No. 17, pp.153-155.

Google Scholar

[3] Alur R, Dill D L: A Theory ofTimed Automata. Theoretical Computer Science, Vol. 126 (1994) No. 2, pp.183-235.

DOI: 10.1016/0304-3975(94)90010-8

Google Scholar

[4] Behrmann G, David A and Larsen K G: A Tutorial on Uppaal. Springer-Verlag, (2004), pp.200-236.

Google Scholar

[5] Yovine S. Kronos: A Verification Tool for Real-time Systems. International Journal on Software Tools for Technology Transfer, (1997) , pp.123-133.

DOI: 10.1007/s100090050009

Google Scholar

[6] W. J. Zhu: Several new models based on timed automata research.

Google Scholar