Retinal neurons: cell types and coupled networks

Retinal neurons with distinct dendritic morphologies are likely to comprise different cell types, subject to three important caveats. First, it is necessary to avoid creating “artificial” cell types based on arbitrary criteria—for example, the presence of two or three primary dendrites. Second, it is essential to take into account changes in morphology with retinal eccentricity and cell density. Third, the retina contains imperfections like any natural system and a significant number of retinal neurons display aberrant morphologies or make aberrant connections that are not typical of the population as a whole. Many types of retinal ganglion cells show diverse patterns of tracer coupling, with the simplest pattern represented by the homologous coupling shown by On-Off direction-selective (DS) ganglion cells in the rabbit retina. Neighboring DS ganglion cells with a common preferred direction have regularly spaced somata and territorial dendritic fields, whereas DS ganglion cells with different preferred directions may have closely spaced somata and overlapping dendritic fields.

Concurreny based transition refinement for the verification of distributed algorithms

We suggest a new notion of behaviour preserving transition refinement based on partial order semantics. This notion is called transition refinement. We introduced transition refinement for elementary (low-level) Petri Nets earlier. For modelling and verifying complex distributed algorithms, high-level (Algebraic) Petri nets are usually used. In this paper, we define transition refinement for Algebraic Petri Nets. This notion is more powerful than transition refinement for elementary Petri nets because it corresponds to the simultaneous refinement of several transitions in an elementary Petri net. Transition refinement is particularly suitable for refinement steps that increase the degree of distribution of an algorithm, e.g. when synchronous communication is replaced by asynchronous message passing. We study how to prove that a replacement of a transition is a transition refinement.