Mobility in process calculi and natural computing.

DOI10.1007/978-3-642-24867-2MaRDI QIDQ653874zbMATH OpenOpenAlexFDO

Authors Bogdan Aman, Gabriel Ciobanu

Publication date 20 December 2011

Published in Natural Computing Series (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-24867-2

zbMATH Keywords

\(\pi\)-calculusbrane calculicomputabilityencodingmembrane computingmobile ambientsreachabilitytimed distributed \(\pi\)-calculus

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Review text

Chapter 1 (Mobility in process calculi) deals, as the title says, with mobility in various process calculi. It starts with the \(\pi\)-calculus as a formalism in which processes can send each other also communication links and in this way one can express moving processes both in a physical space of computing locations and in a virtual space of linked processes. Then the timed distributed \(\pi\)-calculus is presented. It contains two kinds of timers: the timers on channels define timeouts for communications, and timers on the channel types restrict the channel availability. Mobile ambinets and mobile ambients with timers follow and the chapter is concluded with brane calculi. The next chapter (Mobility in membrane computing), after short biological motivations, introduces basics of membrane computing and then it concentrates on mobile membranes. Computability power of mobile membranes and some complexity problems (as SAT, 2QBT, bin packing, subset sum, knapsack and 2-partition problem) of mutual mobile membranes are discussed. At the end some decidability results (reduction of replication rules for mobile membranes with replication and reachability) are presented. The third and last chapter is devoted to various encodings (distributed \(\pi\)-calculus into timed distributed \(\pi\)-calculus, pure mobile ambients into \(\pi\)-calculus, safe mobile ambients into mutual mobile membranes, branes into mobile membranes with objects on surface, and mobile membranes with objects on surface into Petri nets).

Recommendations

• Mobility in computer science and in membrane systems
• Membrane Computing: Basics and Frontiers
• The -calculus: A theory of mobile processes
• scientific article; zbMATH DE number 1543318
• Computing by endocytosis and exocytosis

Cited in

(15)

• Denotational semantics of membrane systems by using complete metric spaces
• Memory associated with membranes systems
• Synchronization of rules in membrane computing
• Synthesising elementary net systems with localities
• Membrane automata for modeling biomolecular processes
• Computational power of protein networks
• Mobility in computer science and in membrane systems
• scientific article; zbMATH DE number 1543318 (Why is no real title available?)
• Efficiently solving the bin packing problem through bio-inspired mobility
• Solving SAT with P systems with anti-membranes
• The power of synchronizing rules in membrane computing
• On the efficiency of synchronized P systems
• Type inference for hierarchical multiset structures in rule-based systems
• The synchronized ambient calculus
• Introducing variables in the evolution rules of P systems

This page was built for publication: Mobility in process calculi and natural computing.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q653874)