Verifying Properties of Neural Networks

  • Pedro Rodrigues
  • J. Félix Costa
  • Hava T. Siegelmann
Conference paper

DOI: 10.1007/3-540-45720-8_19

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2084)
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

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Pedro Rodrigues
    • 1
  • J. Félix Costa
    • 2
  • Hava T. Siegelmann
    • 3
  1. 1.Departamento de InformáticaFaculdade de Cix00EA;ncias da Universidade de LisboaLisboaPortugal
  2. 2.Departamento de MatemáticaInstituto Superior Técnico, Lisbon University of TechnologyLisboaPortugal
  3. 3.Faculty of Industrial Engineering and ManagementTechnion CityHaifaIsrael

Personalised recommendations