Verifying Properties of Neural Networks
- First Online:
- Cite this paper as:
- Rodrigues P., Costa J.F., Siegelmann H.T. (2001) Verifying Properties of Neural Networks. In: Mira J., Prieto A. (eds) Connectionist Models of Neurons, Learning Processes, and Artificial Intelligence. IWANN 2001. Lecture Notes in Computer Science, vol 2084. Springer, Berlin, Heidelberg
In the beginning of nineties, Hava Siegelmann proposed a new computational model, the Artificial Recurrent Neural Network (ARNN), and proved that it could perform hypercomputation. She also established the equivalence between the ARNN and other analog systems that support hypercomputation, launching the foundations of an alternative computational theory. In this paper we contribute to this alternative theory by exploring the use of formal methods in the verification of temporal properties of ARNNs. Based on the work of Bradfield in verification of temporal properties of infinite systems, we simplify his tableau system, keeping its expressive power, and show that it is suitable to the verification of temporal properties of ARNNs.
Unable to display preview. Download preview PDF.