Skip to main content

A Spatial Logic for the Hybrid π-Calculus

  • Conference paper
Hybrid Systems: Computation and Control (HSCC 2004)

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

Included in the following conference series:

Abstract

We present a formal logic for stating properties of systems expressed in the hybrid π-calculus, or Φ-calculus. It is a very expressive logic, subsuming many standard logics like CTL and the modal μ-calculus. Because the π-calculus and the Φ-calculus allow passing of names to achieve reconfigurability of hybrid systems, and because we must abstract over these names, the logic (a hybrid extension of a logic by Caires and Cardelli for the π-calculus) uses a new method of defining abstractions – FM set theory – for expressing syntax and semantics of Φ-calculus models, and for expressing the semantics of spatial logic. We provide several new constructions for this logic, including an assume-guarantee principle, and illustrate many of the semantic features using an extended example of a robotic parts feeder and parts carrier in a minifactory.

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.

References

  1. Blackburn, P., de Rijke, M., de Venema, Y.: Modal Logic. Cambridge Tracts in Theoretical Computer Science, vol. 53. Cambridge University Press, Cambridge (2001)

    MATH  Google Scholar 

  2. Caires, L., Cardelli, L.: A spatial logic for concurrency (part I). In: Proceedings, Theoretical Aspects of Computer Software, 4th International Symposium, Sendai, Japan (2001) (to appear in I & C special issue on TACS 2001)

    Google Scholar 

  3. Gabbay, M.J., Pitts, A.M.: A new approach to abstract syntax with variable binding. Formal Aspects of Computing 13, 341–363 (2001)

    Article  Google Scholar 

  4. Henzinger, T.A., Qadeer, S., Rajamani, S.K.: Decomposing refinement proofs using assume-guarantee reasoning. In: Proceedings of the International Conference on Computer-Aided Design (ICCAD), pp. 245–252. IEEE Computer Society Press, Los Alamitos (2000)

    Google Scholar 

  5. Kozen, D.: Results on the propositional mu-calculus. Theoretical Computer Science 27 (1983)

    Google Scholar 

  6. Milner, R.: Communicating and Mobile Systems: the π-calculus. Cambridge University Press, Cambridge (1999)

    Google Scholar 

  7. Rounds, W., Song, H.: The Φ-calculus - a language for distributed control of reconfigurable embedded systems. In: Hybrid Systems: Computation and control. LNCS, vol. 2263, pp. 435–449. Springer, Heidelberg (2003)

    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

Rounds, W.C. (2004). A Spatial Logic for the Hybrid π-Calculus. In: Alur, R., Pappas, G.J. (eds) Hybrid Systems: Computation and Control. HSCC 2004. Lecture Notes in Computer Science, vol 2993. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24743-2_34

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24743-2_34

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-21259-1

  • Online ISBN: 978-3-540-24743-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics