Conjoined Events

Many existing synchronous message-passing systems support choice: engaging in one event XOR another. This paper introduces the AND operator that allows a process to engage in multiple events together (one AND one more AND another; all conjoined), engaging in each event only if it can atomically engage in all the conjoined events. We demonstrate using several examples that this operator supports new, more ?exible models of programming. We show that the AND operator allows the behaviour of processes to be expressed in local rules rather than system-wide constructs. We give an optimised implementation of the AND operator and explore the performance effect on standard communications of supporting this new operator

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

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

Life of occam-Pi

This paper considers some questions prompted by a brief review of the history of computing. Why is programming so hard? Why is concurrency considered an “advanced” subject? What’s the matter with Objects? Where did all the Maths go? In searching for answers, the paper looks at some concerns over fundamental ideas within object orientation (as represented by modern programming languages), before focussing on the concurrency model of communicating processes and its particular expression in the occam family of languages. In that focus, it looks at the history of occam, its underlying philosophy (Ockham’s Razor), its semantic foundation on Hoare’s CSP, its principles of process oriented design and its development over almost three decades into occam-? (which blends in the concurrency dynamics of Milner’s ?-calculus). Also presented will be an urgent need for rationalisation – occam-? is an experiment that has demonstrated significant results, but now needs time to be spent on careful review and implementing the conclusions of that review. Finally, the future is considered. In particular, is there a future

Process Calculi Abstractions for Biology

Several approaches have been proposed to model biological systems by means of the formal techniques and tools available in computer science. To mention just a few of them, some representations are inspired by Petri Nets theory, and some other by stochastic processes. A most recent approach consists in interpreting the living entities as terms of process calculi where the behavior of the represented systems can be inferred by applying syntax-driven rules. A comprehensive picture of the state of the art of the process calculi approach to biological modeling is still missing. This paper goes in the direction of providing such a picture by presenting a comparative survey of the process calculi that have been used and proposed to describe the behavior of living entities. This is the preliminary version of a paper that was published in Algorithmic Bioprocesses. The original publication is available at http://www.springer.com/computer/foundations/book/978-3-540-88868-

Memory transition between communicating agents

Abstract: What happens to a memory when it has been externalised and embodied but has not reached its addressee yet? A letter that has been written but has not been read, a monument before it is unveiled or a Neolithic tool buried in the ground – all these objects harbour human memories engrained in their physicality; messages intended for those who will read the letter, admire the monument and hold the tool. According to Ilyenkov’s theory of objective idealism, the conscious and wilful input encoded in all manmade objects as the ‘ideal’ has an objective existence, independent from the author, but this existence lasts only while memories are shared between communicating parties. If all human minds were absent from the world for a period of time, the ‘ideal’, or memories, would cease to exist. They would spring back to existence, however, once humans re-entered the world. Ilyenkov’s analysis of memories existing outside an individual human consciousness is informative and thorough but, following his line of thought, we would have to accept an ontological gap in the process of memory acquisition, storage and transmission. If there is a period, following memory acquisition and receding its transmission, when memories plainly do not exist, then each time a new reader, spectator or user perceives them, he or she must create the author’s memories ex nihilo. Bergson’s theory of duration and intuition can help us to resolve this paradox. This paper will explore the ontological characteristics of memory passage in communication taken at different stages of the process. There will be an indicationof how the findings of this investigation could be applicable to concrete cases of memory transmission. In particular, this concerns intergenerational communication, technological memory, the use of digital devices and the Internet