Skip to main content

A Complete Axiomatic System for a Process-Based Spatial Logic

  • Conference paper
Mathematical Foundations of Computer Science 2008 (MFCS 2008)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5162))

Abstract

The process-based Spatial Logics are multi-modal logics developed for semantics on Process Algebras and designed to specify concurrent properties of dynamic systems. On the syntactic level, they combine modal operators similar to operators of Hennessy-Milner logic, dynamic logic, arrow logic, relevant logic, or linear logic. This combination generates expressive logics, sometimes undecidable, for which a wide range of applications have been proposed.

In the literature, there exist some sound proof systems for spatial logics, but the problem of completeness against process-algebraic semantics is still open. The main goal of this paper is to identify a sound-complete axiomatization for such a logic. We focus on a particular spatial logic that combines the basic spatial operators with dynamic and classical operators. The semantics is based on a fragment of CCS calculus that embodies the core features of concurrent behaviors. We prove the logic decidable both for satisfiability/validity and mode-checking, and we propose a sound-complete Hilbert-style axiomatic system for it.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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.

Similar content being viewed by others

References

  1. van Benthem, J.: Language in action. Categories, Lambdas and Dynamic Logic. Elsevier Science Publisher, Amsterdam (1991)

    MATH  Google Scholar 

  2. Bergstra, J.A., Ponse, A., Smolka, S.A. (eds.): Handbook of Process Algebra. North Holland, Elsevier (2001)

    Google Scholar 

  3. Caires, L., Cardelli, L.: A Spatial Logic for Concurrency (Part I), Information and Computation, vol. 186(2) (2003)

    Google Scholar 

  4. Caires, L., Cardelli, L.: A Spatial Logic for Concurrency (Part II). In: Brim, L., Jančar, P., Křetínský, M., Kucera, A. (eds.) CONCUR 2002. LNCS, vol. 2421. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  5. Caires, L., Lozes, E.: Elimination of Quantifiers and Decidability in Spatial Logics for Concurrency. In: Gardner, P., Yoshida, N. (eds.) CONCUR 2004. LNCS, vol. 3170. Springer, Heidelberg (2004)

    Google Scholar 

  6. Calcagno, C., Cardelli, L., Gordon, A.D.: Deciding validity in a spatial logic for trees. Journal of Functional Programming 15 (2005)

    Google Scholar 

  7. Calcagno, C., et al.: Computability and complexity results for a spatial assertion language for data structures. In: Hariharan, R., Mukund, M., Vinay, V. (eds.) FSTTCS 2001. LNCS, vol. 2245. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  8. Cardelli, L., Gordon, A.D.: Anytime, Anywhere: Modal Logics for Mobile Ambients. In: Proc. 27th ACM Symposium on Principles of Programming Languages (2000)

    Google Scholar 

  9. Charatonik, W., Talbot, J.M.: The decidability of model checking mobile ambients. In: Fribourg, L. (ed.) CSL 2001 and EACSL 2001. LNCS, vol. 2142. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  10. Dam, M.: Model checking mobile processes. Information and Computation 129(1) (1996)

    Google Scholar 

  11. Gyuris, V.: Associativity does not imply undecidability without the axiom of Modal Distribution. In: Marx, M., et al. (eds.) Arrow Logic and Multi-Modal Logic, CSLI and FOLLI (1996)

    Google Scholar 

  12. Harel, D., et al.: Dynamic Logic. MIT Press, Cambridge (2000)

    MATH  Google Scholar 

  13. Hennessy, M., Milner, R.: Algebraic laws for Nondeterminism and Concurrency. Journal of J. ACM 32(1) (1985)

    Google Scholar 

  14. Mardare, R.: Observing distributed computation. In: Mossakowski, T., Montanari, U., Haveraaen, M. (eds.) CALCO 2007. LNCS, vol. 4624. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  15. Mardare, R., Priami, C.: Decidable extensions of Hennessy-Milner Logic. In: Najm, E., Pradat-Peyre, J.-F., Donzeau-Gouge, V.V. (eds.) FORTE 2006. LNCS, vol. 4229. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  16. Mardare, R., Polocriti, A.: Towards a complete axiomatization for Spatial Logics, TechRep. CoSBi, TR-03-2008, www.cosbi.eu

  17. Milner, R.: A Calculus of Communicating Systems. Springer, New York (1982)

    Google Scholar 

  18. Milner, R., Parrow, J., Walker, D.: Modal logics for mobile processes. TCS 114 (1993)

    Google Scholar 

  19. Prior, A.: Past, Present and Future. Clarendon Press, Oxford (1967)

    MATH  Google Scholar 

  20. Sangiorgi, D.: Extensionality and Intensionality of the Ambient Logics. In: Proc. of the 28th ACM Annual Symposium on Principles of Programming Languages (2001)

    Google Scholar 

  21. Stirling, C.: Modal and temporal properties of processes. Springer, New York (2001)

    Google Scholar 

  22. Urquhart, A.: Semantics for Relevant Logics. Journal of Symbolic Logic 37(1) (1972)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Edward Ochmański Jerzy Tyszkiewicz

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Mardare, R., Policriti, A. (2008). A Complete Axiomatic System for a Process-Based Spatial Logic. In: Ochmański, E., Tyszkiewicz, J. (eds) Mathematical Foundations of Computer Science 2008. MFCS 2008. Lecture Notes in Computer Science, vol 5162. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85238-4_40

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-85238-4_40

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-85238-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics