School of Computing

Formal modeling of connectionism using concurrency theory, an approach based on automata and model checking

Li Su, Howard Bowman, and Brad Wyble

Technical Report 1-06, University of Kent, Computing Laboratory, January 2006.

Abstract

This paper illustrates a framework for applying formal methods techniques, which are symbolic in nature, to specifying and verifying neural networks, which are sub-symbolic in nature. The paper describes a communicating automata [Bowman & Gomez, 2006] model of neural networks. We also implement the model using timed automata [Alur & Dill, 1994] and then undertake a verification of these models using the model checker Uppaal [Pettersson, 2000] in order to evaluate the performance of learning algorithms. This paper also presents discussion of a number of broad issues concerning cognitive neuroscience and the debate as to whether symbolic processing or connectionism is a suitable representation of cognitive systems. Additionally, the issue of integrating symbolic techniques, such as formal methods, with complex neural networks is discussed. We then argue that symbolic verifications may give theoretically well-founded ways to evaluate and justify neural learning systems in the field of both theoretical research and real world applications.

Download publication 1321 kbytes (PDF)

Bibtex Record

@techreport{2403,
author = {Li Su and Howard Bowman and Brad Wyble},
title = {Formal Modeling of Connectionism using Concurrency Theory, an Approach Based on Automata and Model Checking},
month = {January},
year = {2006},
pages = {55},
keywords = {formal methods, communicating automata, timed automata, model checking, symbolic, sub-symbolic, neural networks, cognition, learning},
note = {},
doi = {},
url = {http://www.cs.kent.ac.uk/pubs/2006/2403},
    publication_type = {techreport},
    submission_id = {7261_1154594953},
    number = {1-06},
    institution = {University of Kent, Computing Laboratory},
}

School of Computing, University of Kent, Canterbury, Kent, CT2 7NF

Enquiries: +44 (0)1227 824180 or contact us.

Last Updated: 12/03/2012 17:24