Tim Lewis
ABSTRACT
This paper describes a combined evolutionary system whereby formal correctness properties are used to augment a standard functional fitness score. This system was applied to the problem of evolving the receive side of an alternating bit protocol, represented by a Petrinet. The fitness function combined a test for freedom from deadlock in addition to a functional scoring system. The efficiency gain produced nets of equal functional fitness requiring approximately one third of the number of evaluations required when functional tests were used alone. This result has wider applicability in any genetic programming evolution where formal correctness tests of the algorithms can be carried out.
- K. A. Bartlett, R. A. Scantlebury, and P. T. Wilkinson. A note on reliable full-duplex transmission over half-duplex links. Communications of the ACM, 12:5:260--261, 1969. Google Scholar
Digital Library
- W. V. Belle, T. Mens, and T. D'Hondt. Using genetic programming to generate protocol adaptors for interprocess communication. In Proceedings of Evolvable Systems: From Biology to Hardware, Fifth International Conference ICES 2003, volume LNCS 2606, pages 795--804, 2003. Google ScholarDigital Library
- B. Berthomieu and F. Vernadat. Time Petri nets analysis with TINA. In Proceedings of 3rd Int. Conf. on The Quantitative Evaluation of Systems (QEST 2006), pages 123--124, 2006. Riverside, California, USA. Google ScholarDigital Library
- T. Lewis, N. Fanning, and G. Clemo. Enhancing IEEE 802.11 DCF using genetic programming. In IEEE Spring Vehicular Technology Conference, Melbourne, Australia, 2006.Google Scholar
- J. H. Moore and L. W. Hahn. Grammatical evolution for the discovery of Petri net models of complex genetic systems. In Lecture Notes in Computer Science GECCO '03, volume 2724, 2004. Google ScholarDigital Library
- M. Nakamura, H. Tohme, K. Hachiman, B. M. Ombuki, and K. Onaga. Cyclic job-shop-scheduling based on evolutionary Petri nets. In IECON 2000 26th Annual Conference of the IEEE, volume 4, pages 2855--2860, October 2000.Google ScholarCross Ref
- J. Nummela and B. A. Julstrom. Evolving petri nets to represent metabolic pathways. In GECCO '05 Proceedings of the 2005 Conference on Genetic and Evolutionary Computation, June 2005. Google ScholarDigital Library
- C. A. Petri. Kommunikation mit Automaten. PhD thesis, University of Bonn, 1962. English translation: Technical Report RADC-TR-65-377, Vol.1, Suppl 1 Applied Data Research Princeton, N.J.Google Scholar
Index Terms
- Formal verification to enhance evolution of protocols
Recommendations
Formal verification of complex coherence protocols using symbolic state models
Directory-based coherence protocols in shared-memory multiprocessors are so complex that verification techniques based on automated procedures are required to establish their correctness. State enumeration approaches are well-suited to the verification ...
Systematic Formal Verification for Fault-Tolerant Time-Triggered Algorithms
Many critical real-time applications are implemented as time-triggered systems. We present a systematic way to derive such time-triggered implementations from algorithms specified as functional programs (in which form their correctness and fault-...
Analyzing encryption protocols using formal verification techniques
An approach to analyzing encryption protocols using machine-aided formal verification techniques is presented. The properties that the protocol should preserve are expressed as state invariants, and the theorems that must be proved to guarantee that the ...
Comments