Coordinating parallel mobile ambients to solve SAT problem in polynomial number of steps

Authors:
Bogdan Aman;Gabriel Ciobanu
Affiliations:
Institute of Computer Science, Romanian Academy, Iaşi, Romania,"A.I.Cuza" University, Iaşi, Blvd. Carol I no.11, Romania;Institute of Computer Science, Romanian Academy, Iaşi, Romania,"A.I.Cuza" University, Iaşi, Blvd. Carol I no.11, Romania
Venue:
COORDINATION'12 Proceedings of the 14th international conference on Coordination Models and Languages
Year:
2012

Citing 20
Cited 0

Bisimulation can't be traced

POPL '88 Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Communicating and mobile systems: the &pgr;-calculus

Communicating and mobile systems: the &pgr;-calculus
Mobile ambients

Theoretical Computer Science
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Mobile safe ambients

ACM Transactions on Programming Languages and Systems (TOPLAS)
Finite-Control Mobile Ambients

ESOP '02 Proceedings of the 11th European Symposium on Programming Languages and Systems
Using Ambients to Control Resources

CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
An Asynchronous, Distributed Implementation of Mobile Ambients

TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
Access control for mobile agents: The calculus of boxed ambients

ACM Transactions on Programming Languages and Systems (TOPLAS)
On the expressive power of movement and restriction in pure mobile ambients

Theoretical Computer Science - Special issue: Foundations of wide area network computing
BioAmbients: an abstraction for biological compartments

Theoretical Computer Science - Special issue: Computational systems biology
On the computational strength of pure ambient calculi

Theoretical Computer Science - Expressiveness in concurrency
A Timed Linda Language and its Denotational Semantics

Fundamenta Informaticae
Timed Mobile Ambients for Network Protocols

FORTE '08 Proceedings of the 28th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
The Space and Motion of Communicating Agents

The Space and Motion of Communicating Agents
Encoding mobile ambients into the π-calculus

PSI'06 Proceedings of the 6th international Andrei Ershov memorial conference on Perspectives of systems informatics
Mobile ambients with timers and types

ICTAC'07 Proceedings of the 4th international conference on Theoretical aspects of computing
Mobility in Process Calculi and Natural Computing

Mobility in Process Calculi and Natural Computing
On the computational power of the mate/bud/drip brane calculus: interleaving vs. maximal parallelism

WMC'05 Proceedings of the 6th international conference on Membrane Computing
Brane calculi

CMSB'04 Proceedings of the 20 international conference on Computational Methods in Systems Biology

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we present a version of mobile ambients, called parMA, having a weak form of replication and a parallel semantics. We investigate how parMA can solve intractable problems in a polynomial number of computational steps. We use parMA to give a semiuniform solution to a well-known strong NP-complete problem, namely to the Boolean satisfiability problem (SAT).