Work

Formal Modeling of Connectionism using Concurrency Theory, an Approach Based on Automata and Model Checking

Year: 2006
Type: other
Abstract: This paper illustrates a framework for applying formal methods techniques, which are symbolic in nature, to specifying and verifying neural networks, which are subsymbolic 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. Key words: formal methods, communicating automata, timed automata, model checking,
Language: English
Open Access status: green
OpenAlex ID: W7019324351
Cites: 34
Cited by: 1
Related to: 7