Membrane Computing

Name: Membrane Computing | 17th International Conference, CMC 2016, Milan, Italy, July 25-29, 2016, Revised Selected Papers
Brand: Springer
Price: 53.49 EUR
Availability: OnlineOnly

17th International Conference, CMC 2016, Milan, Italy, July 25-29, 2016, Revised Selected Papers

Alberto Leporati Grzegorz Rozenberg Arto Salomaa Claudio Zandron(Herausgeber*in)

Springer (Verlag)

Erschienen am 21. Februar 2017

X, 363 Seiten

E-Book

PDF mit Wasserzeichen-DRM

Systemvoraussetzungen

978-3-319-54072-6 (ISBN)

53,49 €inkl. 7% MwSt.

Systemvoraussetzungen

für PDF mit Wasserzeichen-DRM

E-Book Einzellizenz

Als Download verfügbar

Beschreibung

Weitere Details

Weitere Ausgaben

Inhalt

Intro
Preface
Organization
Contents
Invited Papers
The Evolutionary Resilience of Distributed Cellular Computing
1 How Much Cells Can Compute
2 A Colony of Synchronizing Agents (CSA) Computational Framework of Cellular Synchronization
3 The Evolutionary Instability of (Distributed) Cellular Computation
4 Perspective
References
Coping with Dynamical Structures for Interdisciplinary Applications of Membrane Computing
1 Introduction
2 Biological Information Processing Primarily Utilises Dynamical Structures at Different Levels
3 Membrane Systems for Explicit Formalisation of Structural Dynamics at Different Levels
4 Usefulness of Membrane Systems Managing Dynamical Structures
References
Applications of P Systems in Population Biology and Ecology: The Cases of MPP and APP Systems
1 Introduction
2 Modelling Populations with P Systems: MPP and APP Systems
3 Case Study 1: On the Stability of Lake Frog Complexes
4 Case Study 2: Establishment of Dominance Hierarchies in Primate Societies
5 Conclusions
References
Regular Papers
Simulating R Systems by P Systems
1 Introduction -- Differences Between P and R
2 Preliminaries
3 Using Promoters and Inhibitors
3.1 Using Powerful Rules
3.2 Triples of Symbols
3.3 Triples of Sets
3.4 Using only Promoters
3.5 Using only Inhibitors
4 Using Antimatter
5 Non-standard P Systems
6 Conclusions
References
Purely Catalytic P Systems over Integers and Their Generative Power
1 Introduction
2 Preliminaries
2.1 Extending Multisets
2.2 Linear Sets
3 Purely Catalytic P Systems over Integers
4 Results
4.1 Observations and Simplifications
4.2 Generative Power
4.3 Communication
5 Multiple Dissolution
6 Conclusions
References
P Systems Working in Maximal Variants of the Set Derivation Mode
1 Introduction
2 Definitions
2.1 Prerequisites
2.2 Register Machines
3 Variants of P Systems
3.1 Derivation Modes
4 Computational Completeness Proofs also Working for Set Derivation Modes
4.1 P Systems with Cooperative Rules
4.2 Catalytic and Purely Catalytic P Systems
4.3 Computational Completeness of (Purely) Catalytic P Systems with Additional Control Mechanisms
5 P Systems with Toxic Objects
6 Atomic Promoters and Inhibitors
6.1 Atomic Promoters
6.2 Atomic Inhibitors
7 P Systems with Target Selection
8 Conclusion and Future Work
References
Computational Power of Protein Networks
1 Introduction
2 Protein-Protein Interaction Systems
3 Protein-Protein Interactions of the Immune System
4 Computational Power of Interaction Networks
5 Conclusion
References
Comparative Analysis of Statistical Model Checking Tools
1 Introduction
2 A Brief Survey of Current Statistical Model Checkers
2.1 Tools
2.2 Modelling Languages
3 Usability
4 Experimental Findings
5 Conclusion
References
Chemical Term Reduction with Active P Systems
1 Introduction
2 About the -Calculus
3 How to Associate P Systems to g-terms
4 Conclusion
References
P Colonies with Evolving Environment
1 Introduction
2 Definitions
2.1 Catalytic P Systems
2.2 Generalized P Colonies
3 P Colonies with Consumer Agents
4 P Colonies with Rewriting/Communication Rules
5 P Colonies Versus Catalytic P Systems
6 Conclusions
References
Continuation Passing Semantics for Membrane Systems
1 Introduction
1.1 Semantic Investigation of Membrane Systems
1.2 Contribution
2 Mathematical Preliminaries
2.1 Metric Spaces
3 Syntax and Semantics of LMC
4 Conclusion
References
Minimal Multiset Grammars for Recurrent Dynamics
1 Introduction
2 Grammar Computation as a Recurrent Dynamics
3 A Minimization Problem
3.1 Formulation as a Quadratic Problem
4 Computational Complexity
4.1 Weak NP-hardness: The SubsetSum Case (Zero-one Solutions)
4.2 Weak NP-hardness: The UKP Case (Solutions over the Naturals)
4.3 Pseudo-Polynomial Solutions When the Number of Equality Constraints is Bounded
5 Conclusion
References
Solution to Motif Finding Problem in Membranes
1 Introduction
2 Motif Finding Problem
3 A P System for MFP
4 A Solution to Motif Finding Problem Using ECPe-str
4.1 Previous Work: On Alignment Matrices and Computing Score
4.2 Search for Maximum Score
4.3 Integrating All Subsystems to Solve MFP
5 Final Remarks
References
Remarks on the Computational Power of Some Restricted Variants of P Systems with Active Membranes
1 Introduction
2 Preliminaries
3 Results
3.1 The Solution of HORN3SATNORM
3.2 Simulating Turing Machines
4 Conclusions
References
Kernel P Systems Modelling, Testing and Verification - Sorting Case Study
1 Introduction
2 kP Systems - Main Concepts and Definitions
2.1 kP System Rules
2.2 kP System Execution Strategies
3 Sorting with kP Systems
3.1 Sorting Using kP Systems with an Element per Compartment
3.2 Sorting Using kP Systems with Two Compartments
3.3 A kP System for Sorting in Constant Time
4 Simulating and Verifying kP Systems
5 Testing kP Systems Using Automata Based Techniques
6 Conclusions
References
Walking Membranes: Grid-Exploring P Systems with Artificial Evolution for Multi-purpose Topological Optimisation of Cascaded Processes
1 Introduction and Background
2 Identification of Interdisciplinary Application Scenarios
3 General Concept
4 Reflecting Related Paradigms and Heuristic Concepts
5 Grid-Exploring P Systems: Definitions and Formalisms
5.1 Algebraic and String-Operational Prerequisites
5.2 Definition of System Components
5.3 Auxiliary Data to be Obtained Prior to System's Evolution
5.4 Passing the Particles Throughout the Grid for Estimation of Total Overall Execution Time
5.5 Artificial Evolution
6 Case Studies
6.1 Cell Signalling Cascades
6.2 Manufacturing in a Cabinet Maker's Workshop
6.3 Alternative Supermarket
7 Discussion and Conclusions
References
Array-Rewriting P Systems with Basic Puzzle Grammar Rules and Permitting Features
1 Introduction
2 Preliminaries
3 Array Rewriting P Systems with BPG Rules and Permitting Symbols
4 Array P Systems with BPG Rules and t-Communication
5 Conclusion
References
Agent-Based Simulation of Kernel P Systems with Division Rules Using FLAME
1 Introduction
2 Related Work
3 Background
4 Modelling Kernel P Systems with Structure Changing Rules in FLAME
4.1 Implementing kP Systems Division Rules in FLAME
5 Adapting the Modelling Approach to FLAME GPU
6 Case Study: Subset Sum Problem
7 Conclusions and Further Work
A Appendix
References
Shallow Non-confluent P Systems
1 Introduction
2 Basic Notions
3 Simulating Nondeterministic Turing Machines
4 Conclusions
References
Revising the Membrane Computing Model for Byzantine Agreement
1 Introduction
2 Data Structures in cP Systems
3 Byzantine Agreement
4 EIG Trees
5 The EIG-Based Byzantine Agreement Algorithm
6 Revised Byzantine Agreement Solution
7 Initial Configurations
8 Rules for Messaging Phase
9 Rules for Second Phase
10 Static Complexity
11 Conclusions and Open Problems
A Appendix. cP Systems: P Systems with Complex Symbols
A.1 Complex Symbols as Subcells
A.2 Generic Rules
References
Rewriting P Systems with Flat-Splicing Rules
1 Introduction
2 Preliminaries
3 A Rewriting P System with Linear Rewriting Rules and Alphabetic Flat Splicing Rules
4 RPm(REG/AFSR) with Extended Initial Objects
5 Conclusions and Discussions
References
A View of P Systems from Information Theory
1 Introduction
2 Basic Concepts
3 The Entropy of a P System
4 P Systems with Entropic Transitions
5 Conclusion, Further Research and Future Works
References
Author Index

Systemvoraussetzungen

Als PDF speichern Als Link merken