The Decidability of Model Checking Mobile Ambients

@inproceedings{Charatonik2001TheDO,
  title={The Decidability of Model Checking Mobile Ambients},
  author={Witold Charatonik and Jean-Marc Talbot},
  booktitle={CSL},
  year={2001}
}
The ambient calculus is a formalism for describing the mobility of both software and hardware. The ambient logic is a modal logic designed to specify properties of distributed and mobile computations programmed in the ambient calculus. In this paper we investigate the border between decidable and undecidable cases of model checking mobile ambients for some fragments of the ambient calculus and the ambient logic. Recently, Cardelli and Gordon presented a model-checking algorithm for a… CONTINUE READING

Similar Papers

Citations

Publications citing this paper.
SHOWING 1-10 OF 42 CITATIONS

Finite-Control Mobile Ambients

VIEW 7 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Elimination of Quantifiers and Undecidability in Spatial Logics for Concurrency

VIEW 4 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Separability, expressiveness, and decidability in the ambient logic

  • Proceedings 17th Annual IEEE Symposium on Logic in Computer Science
  • 2002
VIEW 5 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Decision problems for Spatial Logics revisited

VIEW 4 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Design-time formal verification for smart environments: an exploratory perspective

  • J. Ambient Intelligence and Humanized Computing
  • 2014
VIEW 2 EXCERPTS
CITES METHODS

Decidability of Modular Logics for Concurrency

  • Ershov Memorial Conference
  • 2011
VIEW 3 EXCERPTS
CITES METHODS & BACKGROUND

References

Publications referenced by this paper.
SHOWING 1-10 OF 17 REFERENCES

S

W. Charatonik, S. Dal Zilio, A. D. Gordon
  • Mukhopadhyay , nd J.-M. Talbot. The complexity of model checking mobile ambients. In Proceedings FoSSaCS’01 , volume 2030 of LNCS, pages 152–167. Springer,
  • 2001
VIEW 7 EXCERPTS
HIGHLY INFLUENTIAL

The complexity of model checking mobile ambients

S. Dal Zilio W. Charatonik, A. D. Gordon, S. Mukhopadhyay
  • Proceedings FoSSaCS ’ 01 , volume 2030 of LNCS , pages
  • 2001

The impossibility of an algorithm for the decision problem for finite models

B. A. Trakhtenbrot
  • Doklady Akademii Nauk SSR
  • 2001

The impossibility of an algorithm for the decision problem for finite models

B. A. Trakhtenbrot
  • Doklady Akademii Nauk SSR
  • 2001

Post . Recursively Enumerable Sets of Positive Integers and their Decision Problems

L. E.
  • Bulletion of the American Mathematical Society
  • 2000