Separability, expressiveness, and decidability in the ambient logic

Hirschkoff, Daniel; Lozes, Étienne; Sangiorgi, Davide

doi:10.1109/lics.2002.1029850

Cited by 32 publications

(36 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…These results build on the definition of bounded characteristic formulas for processes, and on some technical results about solutions of equations on π-calculus processes up to extended structural congruence. Expressiveness and separation results for spatial logics for the public ambient calculus have already been investigated by Sangiorgi, Lozes and Hirshckoff [24,16].…”

Section: Related Work and Conclusionmentioning

confidence: 99%

“…However, spatial properties are expected to be invariant under a natural notion of structural identity; in turn, structural identity is expected to be close to structural congruence [16,24]. For example, the processes m n |p n and m n .p n + p n .m n are equivalent with respect to the standard strong bisimulation semantics, but are distinguished by the formula ¬0|¬0, which holds of systems constructed from at least two separate non-void parallel components.…”

Section: Expressivenessmentioning

confidence: 99%

“…Natural notions of structural bisimulation have been defined [24,16], following the usual coinductive pattern of progressive observation of process commitments. For our purposes we find it more convenient to define structural bisimulations on representations of processes based on finite systems of equations.…”

Section: Definition 31 Extended Structural Congruence ≡mentioning

confidence: 99%

See 2 more Smart Citations

Behavioral and Spatial Observations in a Logic for the π-Calculus

Caires¹

2004

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. In addition to behavioral properties, spatial logics can talk about other key properties of concurrent systems such as secrecy, freshness, usage of resources, and distribution. We study an expressive spatial logic for systems specified in the synchronous π-calculus with recursion, based on a small set of behavioral and spatial observations. We give coinductive and equational characterizations of the equivalence induced on processes by the logic, and conclude that it strictly lies between structural congruence and strong bisimulation. We then show that model-checking is decidable for a useful class of processes that includes the finite-control fragment of the π-calculus.

show abstract

Section: Related Work and Conclusionmentioning

confidence: 99%

Section: Expressivenessmentioning

confidence: 99%

Section: Definition 31 Extended Structural Congruence ≡mentioning

confidence: 99%

See 1 more Smart Citation

Behavioral and Spatial Observations in a Logic for the π-Calculus

Caires¹

2004

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…This order allows us, using the following result, to derive an inductive characterisation of ≃ int [HLS02,HLS05].…”

Section: Intensional Bisimilaritymentioning

confidence: 99%

On the Expressiveness of the Ambient Logic

Hirschkoff¹,

Lozes²,

Sangiorgi³

2006

Logical Methods in Computer Science

View full text Add to dashboard Cite

Abstract. 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.In this paper, we study the expressiveness of AL. We define formulas for capabilities and for communication in MA. We also derive some formulas that capture finitess of a term, name occurrences and persistence. We study extensions of the calculus involving more complex forms of communications, and we define characteristic formulas for the equivalence induced by the logic on a subcalculus of MA. This subcalculus is defined by imposing an image-finiteness condition on the reducts of a MA process.

show abstract

“…Recently, in two independant works [1,19], it has been shown that the ambient calculus with replication but without private names and communication is actually Turing-complete.…”

Section: Calculus With Replicationmentioning

confidence: 99%

The Decidability of Model Checking Mobile Ambients

Charatonik

Talbot

2001

Computer Science Logic

View full text Add to dashboard Cite

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 replication-free calculus and guarantee-free logic we prove that the problem is PSPACE-complete. For the complexity upper-bound, 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 PSPACE-hardness of the problem for several quite simple fragments of the calculus and the logic; this suggests that there are no interesting fragments with polynomial-time model checking algorithms.

show abstract

Separability, expressiveness, and decidability in the ambient logic

Cited by 32 publications

References 20 publications

Behavioral and Spatial Observations in a Logic for the π-Calculus

Behavioral and Spatial Observations in a Logic for the π-Calculus

On the Expressiveness of the Ambient Logic

The Decidability of Model Checking Mobile Ambients

Contact Info

Product

Resources

About