𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Computing with truly asynchronous threshold logic networks

✍ Scribed by Pekka Orponen

Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
946 KB
Volume
174
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

✦ Synopsis

We present simulation mechanisms by which any network of threshold logic units with either symmetric or asymmetric interunit connections (i.e. a symmetric or asymmetric "Hopfield net") can be simulated on a network of the same type, but without any a priori constraints on the order of updates of the units. Together with earlier constructions, the results show that the truly asynchronous network model is computationally equivalent to the seemingly more powerful models with either ordered sequential or fully parallel updates.

πŸ“œ SIMILAR VOLUMES

Application of formal methods to biologi
Application of formal methods to biological regulatory networks: extending Thomas’ asynchronous logical approach with temporal logic
✍ Gilles Bernot; Jean-Paul Comet; Adrien Richard; Janine Guespin πŸ“‚ Article πŸ“… 2004 πŸ› Elsevier Science 🌐 English βš– 310 KB

Based on the discrete definition of biological regulatory networks developed by ReneΒ΄Thomas, we provide a computer science formal approach to treat temporal properties of biological regulatory networks, expressed in computational tree logic. It is then possible to build all the models satisfying a s

Optimal Networks with NOR-OR gates and w
Optimal Networks with NOR-OR gates and wired-OR logic: Kawasaki, T. Illinois University, Computer Science Dept. Urbana, USA (Jan 1974) 102 pp
πŸ“‚ Article πŸ“… 1975 πŸ› Elsevier Science 🌐 English βš– 140 KB

Describes some of the limitations and difficulties of the finite element method and discusses implications in relation to the analysis of bridge and building structures. The main limitations of the method are related to difficulties encountered in: (i) cost; (ii) complexity; (iii) convergence proble