Cellular automata machines: a new environment for modeling
Cellular automata machines: a new environment for modeling
A parallel machine for multiset transformation and its programming style
Future Generation Computer Systems
The gamma model and its discipline of programming
Science of Computer Programming
Handbook of theoretical computer science (vol. B)
Crystal: theory and pragmatics of generating efficient parallel code
Parallel functional languages and compilers
On the relation between functional and data parallel programming languages
FPCA '93 Proceedings of the conference on Functional programming languages and computer architecture
Connection Machine Lisp: fine-grained parallel symbolic processing
LFP '86 Proceedings of the 1986 ACM conference on LISP and functional programming
The Organization of Computations for Uniform Recurrence Equations
Journal of the ACM (JACM)
Communications of the ACM
Proving termination with multiset orderings
Communications of the ACM
Lindenmayer Systems: Impacts on Theoretical Computer Science, Computer Graphics, and Developmental Biology
Membrane Computing: An Introduction
Membrane Computing: An Introduction
The topological structures of membrane computing
Fundamenta Informaticae - Membrane computing
Data Structure as Topological Spaces
UMC '02 Proceedings of the Third International Conference on Unconventional Models of Computation
Algorithms and Data Structures for Computer Topology
Digital and Image Geometry, Advanced Lectures [based on a winter school held at Dagstuhl Castle, Germany in December 2000]
Declarative definition of group indexed data structures and approximation of their domains
Proceedings of the 3rd ACM SIGPLAN international conference on Principles and practice of declarative programming
Self-Stabilization as a Foundation for Autonomic Computing
ARES '07 Proceedings of the The Second International Conference on Availability, Reliability and Security
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part I
SAMOS'06 Proceedings of the 6th international conference on Embedded Computer Systems: architectures, Modeling, and Simulation
A domain specific language for complex natural and artificial systems simulations
Proceedings of the Tenth Workshop on Language Descriptions, Tools and Applications
Declarative mesh subdivision using topological rewriting in MGS
ICGT'10 Proceedings of the 5th international conference on Graph transformations
Integrated regulatory networks (IRNs): Spatially organized biochemical modules
Theoretical Computer Science
UCNC'12 Proceedings of the 11th international conference on Unconventional Computation and Natural Computation
| Hi-index | 0.00 |
The chemical paradigm is an unconventional programming paradigm well fitted to the high-level specification of parallel systems . Based on the fixed point iterations of local rules, its use has been advocated for the programming of autonomic and amorphous systems . However, this model lacks an explicit handling of spatial relationships . In this contribution, we first show how the chemical paradigm can be extended beyond multisets to arbitrary topological collections . Topological collections handle in a uniform way sophisticated data structures required in algorithmics as well as distributed data structures needed for the programming of autonomic or amorphous systems. Then we adapt a well-known result on multiset ordering to the more general case of topological collections. Well-founded ordering on topological collection can be used to prove the termination of the fixed point iteration of local rules.