Skip to main content

An Extensional Spatial Logic for Mobile Processes

  • Conference paper
CONCUR 2004 - Concurrency Theory (CONCUR 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3170))

Included in the following conference series:

Abstract

Existing spatial logics for concurrency are intensional, in the sense that they induce an equivalence that coincides with structural congruence. In this work, we study a contextual spatial logic for the π-calculus, which lacks the spatial operators to observe emptyness, parallel composition and restriction, and only has composition adjunct and hiding. We show that the induced logical equivalence coincides with strong early bisimilarity. The proof of completeness involves the definition of non-trivial formulas, including characteristic formulas for restriction-free processes up to bisimilarity. This result allows us to isolate the extensional core of spatial logics, decomposing spatial logics into a part that counts (given by the intensional operators) and a part that observes (given by their adjuncts). We also study how enriching the core extensional spatial logic with intensional operators affects its separative power.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Caires, L., Cardelli, L.: A spatial logic for concurrency. In: Kobayashi, N., Pierce, B.C. (eds.) TACS 2001. LNCS, vol. 2215, p. 1. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  2. Cardelli, L., Gordon, A.: Anytime, Anywhere, Modal Logics for Mobile Ambients. In: Proc. of POPL 2000, pp. 365–377. ACM Press, New York (2000)

    Google Scholar 

  3. Cardelli, L., Ghelli, G.: A query language based on the ambient logic. In: Sands, D. (ed.) ESOP 2001. LNCS, vol. 2028, pp. 1–22. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  4. Cardelli, L., Gordon, A.D.: Logical properties of name restriction. In: Abramsky, S. (ed.) TLCA 2001. LNCS, vol. 2044, p. 46. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  5. Conforti, G., Ghelli, G.: Decidability of freshness, undecidability of revelation. In: Walukiewicz, I. (ed.) FOSSACS 2004. LNCS, vol. 2987, pp. 105–120. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  6. Castellani, I., Hennessy, M.: Distributed Bisimulations. J. ACM 36(4), 887–911 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  7. Caires, L., Lozes, É.: Elimination of Quantifiers and Undecidability in Spatial Logics for Concurrency. In: Gardner, P., Yoshida, N. (eds.) CONCUR 2004. LNCS, vol. 3170, pp. 240–257. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  8. Dawar, A., Gardner, P., Ghelli, G.: Games for the Ambient Logic. draft (2004)

    Google Scholar 

  9. Dal Zilio, S., Lugiez, D., Meyssonnier, C.: A Logic You Can Count on. In: Proc. of POPL 2004. ACM Press, New York (2004)

    Google Scholar 

  10. Hirschkoff, D.: An Extensional Spatial Logic for Mobile Processes. Technical report, LIP - ENS Lyon (to appear, 2004)

    Google Scholar 

  11. Hirschkoff, D., Lozes, E., Sangiorgi, D.: Separability, Expressiveness and Decidability in the Ambient Logic. In: Proc. of LICS 2002, pp. 423–432. IEEE Computer Society Press, Los Alamitos (2002)

    Google Scholar 

  12. Hirschkoff, D., Lozes, É., Sangiorgi, D.: Minimality results for the spatial logics. In: Pandya, P.K., Radhakrishnan, J. (eds.) FSTTCS 2003. LNCS, vol. 2914, pp. 252–264. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  13. Kiehn, A.: Distributed Bisimulations for Finite CCS. Technical Report 7/89, University of Sussex (1989)

    Google Scholar 

  14. Lozes, E.: Adjunct Elimination in the Static Ambient Logic. In: Proc. of EXPRESS 2003, ENTCS. Elsevier, Amsterdam (2003)

    Google Scholar 

  15. Lozes, E.: Separation logic preserves the expressiveness of classical logic. In: Proc. of SPACE 2004 (2004)

    Google Scholar 

  16. Milner, R., Parrow, J., Walker, D.: Modal logics for mobile processes. Theoretical Computer Science 114(1), 149–171 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  17. Reynolds, J.: Separation logic: a logic for shared mutable data structures. In: Proc. of LICS 2002. IEEE Computer Society Press, Los Alamitos (2002)

    Google Scholar 

  18. Sangiorgi, D.: Extensionality and Intensionality of the Ambient Logic. In: Proc. of 28th POPL, pp. 4–17. ACM Press, New York (2001)

    Google Scholar 

  19. Sangiorgi, D., Walker, D.: The π-calculus: a Theory of Mobile Processes. Cambridge University Press, Cambridge (2001)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hirschkoff, D. (2004). An Extensional Spatial Logic for Mobile Processes. In: Gardner, P., Yoshida, N. (eds) CONCUR 2004 - Concurrency Theory. CONCUR 2004. Lecture Notes in Computer Science, vol 3170. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-28644-8_21

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-28644-8_21

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22940-7

  • Online ISBN: 978-3-540-28644-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics