A Spatio-Temporal Logic for the Specification and Refinement of Mobile Systems

  • Stephan Merz
  • Martin Wirsing
  • Júlia Zappe
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2621)


We define a variant of Lamport’s Temporal Logic of Actions, extended by spatial modalities, that is intended for the specification of mobile systems with distributed state. We discuss notions of refinement appropriate for mobile systems, specifically concerning the topological structure of the system, and show how these can be represented in the logic via quantification and implication, ensuring transitivity and compositionality of refinements.


Temporal Logic Spatial Modality Mobile System Predicate Symbol Spatial Extension 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    Martín Abadi and Leslie Lamport. The existence of refinement mappings. Theoretical Computer Science, 81(2):253–284, May 1991.MathSciNetCrossRefGoogle Scholar
  2. 2.
    Luis Caires and Luca Cardelli. A spatial logic for concurrency (part I). In Theoretical Aspects of Computer Software, Lecture Notes in Computer Science, pages 1–37. Springer-Verlag, 2001. Revised version to appear in Information and Computation.CrossRefGoogle Scholar
  3. 3.
    Luca Cardelli and Andrew Gordon. Anytime, anywhere. Modal logics for mobile ambients. In Proceedings of the 27th ACMSymposium on Principles of Programming Languages, pages 365–377. ACM Press, 2000.Google Scholar
  4. 4.
    Luca Cardelli and Andrew Gordon. Mobile ambients. Theoretical Computer Science, 240:177–213, 2000.MathSciNetMATHCrossRefGoogle Scholar
  5. 5.
    Cédric Fournet and Georges Gonthier. The reflexive chemical abstract machine and the Join-calculus. In Proceedings of the 23rd ACM Symposium on Principles of Programming Languages, pages 372–385, St. Petersburg Beach, Florida, January 1996. ACM.Google Scholar
  6. 6.
    Leslie Lamport. How to write a long formula. Research Report 119, Digital Equipment Corporation, Systems Research Center, December 1993.Google Scholar
  7. 7.
    Leslie Lamport. The Temporal Logic of Actions. ACM Transactions on Programming Languages and Systems, 16(3):872–923, May 1994.CrossRefGoogle Scholar
  8. 8.
    Stephan Merz. A more complete TLA. In J.M. Wing, J. Woodcock, and J. Davies, editors, FM’99: World Congress on Formal Methods, volume 1709 of Lecture Notes in Computer Science, pages 1226–1244, Toulouse, September 1999. Springer-Verlag.Google Scholar
  9. 9.
    Robin Milner, Joachim Parrow, and David Walker. A calculus of mobile processes, part I/II. Journal of Information and Computation, 100:1–77, September 1992.Google Scholar
  10. 10.
    R. De Nicola, G. Ferrari, and R. Pugliese. Klaim: a kernel language for agents interaction and mobility. IEEE Trans. on Software Engineering, 24(5):315–330, 1998.CrossRefGoogle Scholar
  11. 11.
    R. De Nicola and M. Loreti. A modal logic for Klaim. In T. Rus, editor, Proc. AlgebraicMethodology and Software Technology (AMAST 2000), volume 1816 of Lecture Notes in Computer Science, pages 339–354, Iowa, 2000. Springer-Verlag.Google Scholar
  12. 12.
    Davide Sangiorgi. Extensionality and intensionality of the ambient logic. In Proc. of the 28th Intl. Conf. on Principles of Programming Languages (POPL’01), pages 4–17. ACM Press, 2001.Google Scholar
  13. 13.
    Jan Vitek and Giuseppe Castagna. Seal: A framework for secure mobile computations. In ICCL Workshop: Internet Programming Languages, pages 47–77, 1998.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Stephan Merz
    • 1
  • Martin Wirsing
    • 2
  • Júlia Zappe
    • 2
  1. 1.INRIA LorraineLORIANancy
  2. 2.Institut für InformatikLudwig-Maximilians-Universität MünchenGermany

Personalised recommendations