Results 1 
7 of
7
The decidability of model checking mobile ambients
 In Proceedings of the 15th Annual Conference of the European Association for Computer Science Logic, volume 2142 of LNCS
, 2001
"... We settle the complexity bounds of the model checking problem for the ambient calculus with public names against the ambient logic. We show that if either the calculus contains replication or the logic contains the guarantee operator, the problem is undecidable. In the case of the replicationfree c ..."
Abstract

Cited by 43 (5 self)
 Add to MetaCart
(Show Context)
We settle the complexity bounds of the model checking problem for the ambient calculus with public names against the ambient logic. We show that if either the calculus contains replication or the logic contains the guarantee operator, the problem is undecidable. In the case of the replicationfree calculus and guaranteefree logic we prove that the problem is PSPACEcomplete. For the complexity upperbound, we devise a new representation of processes that remains of polynomial size during process execution; this allows us to keep the model checking procedure in polynomial space. Moreover, we prove PSPACEhardness of the problem for several quite simple fragments of the calculus and the logic; this suggests that there are no interesting fragments with polynomialtime model checking algorithms.
expressiveness and decidability in the ambient logic
 in: Proc. 17th Annual IEEE Symp. Logic in Computer Science (LICS’02), IEEE Computer
, 2002
"... The Ambient Logic (AL) has been proposed for expressing properties of process mobility in the calculus of Mobile Ambients (MA), and as a basis for query languages on semistructured data. We study some basic questions concerning the descriptive and discriminating power of AL, focusing on the equival ..."
Abstract

Cited by 15 (6 self)
 Add to MetaCart
(Show Context)
The Ambient Logic (AL) has been proposed for expressing properties of process mobility in the calculus of Mobile Ambients (MA), and as a basis for query languages on semistructured data. We study some basic questions concerning the descriptive and discriminating power of AL, focusing on the equivalence on processes induced by the logic (=L). We consider MA, and two Turing complete subsets of it, MAIF and MA syn IF, respectively defined by imposing a semantic and a syntactic constraint on process prefixes. The main contributions include: coinductive and inductive operational characterisations of =L; an axiomatisation of =L on MA syn IF; the construc
When Ambients Cannot be Opened
 In Proceedings of FoSSaCS 2003
, 2003
"... We investigate expressiveness of a fragment of the ambient calculus, a formalism for describing distributed and mobile computations. More precisely, we study expressiveness of the pure and public ambient calculus from which the has been removed, in terms of the reachability problem of the reduct ..."
Abstract

Cited by 10 (0 self)
 Add to MetaCart
(Show Context)
We investigate expressiveness of a fragment of the ambient calculus, a formalism for describing distributed and mobile computations. More precisely, we study expressiveness of the pure and public ambient calculus from which the has been removed, in terms of the reachability problem of the reduction relation. Surprisingly, we show that even for this very restricted fragment, the reachability problem is not decidable. At a second step, for a slightly weaker reduction relation, we prove that reachability can be decided by reducing this problem to markings reachability for Petri nets. Finally, we show that the nameconvergence problem as well as the modelchecking problem turn out to be undecidable for both the original and the weaker reduction relation. 1
Minimality results for the spatial logics
 In Proc. of FSTTCS’03, volume 2914 of LNCS
, 2003
"... 1 Introduction Over the last 15 years, a lot of research has gone into calculi of mobile processes.Among these, the sscalculus is the best known. A number of other calculi, however, have been put forward to study aspects of mobility not directly covered ..."
Abstract

Cited by 9 (3 self)
 Add to MetaCart
(Show Context)
1 Introduction Over the last 15 years, a lot of research has gone into calculi of mobile processes.Among these, the sscalculus is the best known. A number of other calculi, however, have been put forward to study aspects of mobility not directly covered
Reduction Semantics for Ambient Calculi
 Trans In) (Trans Cap) P ≻ (ν−→ p )〈M.P ′ 〉P ′′ P M −→CG (ν −→ p )(P ′ P ′′ ) (fn(M) ∩ −→ p = ∅) (Trans Amb) P
, 2004
"... First of all, I would like to thank my supervisor Dr. Iain C. C. Phillips, for his support and collaboration during this period of research. I thank Iain for having taught me to be more precise and sharp, and for long, detailed and inspiring discussions on the topic of this dissertation. Finally I t ..."
Abstract

Cited by 8 (5 self)
 Add to MetaCart
(Show Context)
First of all, I would like to thank my supervisor Dr. Iain C. C. Phillips, for his support and collaboration during this period of research. I thank Iain for having taught me to be more precise and sharp, and for long, detailed and inspiring discussions on the topic of this dissertation. Finally I thank him for his enormous patience towards my stubbornness. I would like to thank Dr. Nobuko Yoshida for many useful discussions and for being very supportive and positive about my work. To Sergio Maffeis go thanks for many discussions on various subjects of research and philosophy during the last two years at Imperial College. He suggested an improvement to the solution for the leader election problem for the Ambient Calculus. I would like to thank also Andrew Phillips, and the concurrency group at Imperial for the Monday lunch meetings. This has been a wonderful forum for discussing various aspects of my work. I like to thank Prof. Chris Hankin and Dr. Sophia Drossopoulou for helping me on various occasions with administrative problems and (especially Chris) for supporting most of my travelling. I do not know how I could have ever achieved this without my husband, Steffen van Bakel. He
Ambient Calculi
, 2004
"... This thesis concerns the Ambient Calculus (MA) and some of its dialects: Safe Ambients (SA), the Push and Pull Ambient Calculus (PAC). For whese calculi we study semantics and expressiveness. On the semantics side, we deal mostly with with Honda and Yoshida’s framework. This means applying a genera ..."
Abstract
 Add to MetaCart
(Show Context)
This thesis concerns the Ambient Calculus (MA) and some of its dialects: Safe Ambients (SA), the Push and Pull Ambient Calculus (PAC). For whese calculi we study semantics and expressiveness. On the semantics side, we deal mostly with with Honda and Yoshida’s framework. This means applying a general method to show how to derive contextual barbed bisimulation equivalences starting from an equational point of view. On the expressiveness side, we show that the ambient calculus is quite expressive in the sense that the matching operator can be faithfully encoded, and leader election problems in symmetric networks can be solved. These facts have profound consequences on the reciprocal encodability of ambient calculus into the calculus. From the encoding of the matching operator, we are able to show that MA is not encodable in the calculus without matching. From the solution of the election leader problem, we establish that a small fragment of MA is not encodable in the calculus with separate choice. Moreover, we show that, in the ambient world, the crucial factor for the solution of the leader election problem in symmetric networks is