Skip to main content
SpringerLink
Log in

Modelling and Verifying Mobile Systems Using π-Graphs

  • Conference paper
SOFSEM 2009: Theory and Practice of Computer Science (SOFSEM 2009)

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

Abstract

This paper introduces the π-graphs, a graphical model of mobile interactions that tries to accommodate the expressivity of the π-calculus and the intuitiveness of place-transition nets. Graph rewriting techniques are used to describe the operational semantics of π-graphs. The bijective encoding/decoding of π-graphs allows to mix transparently graphical and term-based proof techniques, which leads to a dual characterization of bisimilarity. The main originality of this characterization is the synchronous interpretation it provides: each graph/term being attached to a clock evolving at the rate of interactions with the environment. This gives new opportunities for the design of efficient verification algorithms for mobile systems.

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

Access this chapter

Log in via an institution
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. Milner, R.: Communicating and Mobile Systems: The π-Calculus. Cambridge University Press, Cambridge (1999)

    MATH  Google Scholar 

  2. Milner, R.: Pi-nets: A graphical form of pi-calculus. In: Sannella, D. (ed.) ESOP 1994. LNCS, vol. 788, pp. 26–42. Springer, Heidelberg (1994)

    Chapter  Google Scholar 

  3. Parrow, J.: Interaction diagrams. Nord. J. Comput. 2, 407–443 (1995)

    MathSciNet  Google Scholar 

  4. Gadducci, F., Montanari, U.: Observing reductions in nominal calculi via a graphical encoding of processes. In: Middeldorp, A., van Oostrom, V., van Raamsdonk, F., de Vrijer, R. (eds.) Processes, Terms and Cycles: Steps on the Road to Infinity. LNCS, vol. 3838, pp. 106–126. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  5. Laneve, C., Parrow, J., Victor, B.: Solo diagrams. In: Kobayashi, N., Pierce, B.C. (eds.) TACS 2001. LNCS, vol. 2215, pp. 127–144. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  6. Gadducci, F.: Graph rewriting for the π-calculus. Mathematical Structures in Computer Science 17, 407–437 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  7. Victor, B., Moller, F.: The mobility workbench - a tool for the pi-calculus. In: Dill, D.L. (ed.) CAV 1994. LNCS, vol. 818, pp. 428–440. Springer, Heidelberg (1994)

    Chapter  Google Scholar 

  8. Pistore, M., Sangiorgi, D.: A partition refinement algorithm for the π-calculus. Inf. Comput. 164, 264–321 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  9. Peschanski, F.: A tutorial on π-graphs: diagrams of mobile interactions. Technical report, LIP6 - UPMC Paris Universitas (2008), http://www-poleia.lip6.fr/~pesch/pigraphs

  10. Lamport, L.: Time, clocks, and the ordering of events in a distributed system. Commun. ACM 21, 558–565 (1978)

    Article  MATH  Google Scholar 

  11. Löwe, M.: Algebraic approach to single-pushout graph transformation. Theor. Comput. Sci. 109, 181–224 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  12. Paige, R., Tarjan, R.E.: Three partition refinement algorithms. SIAM J. Comput. 16, 973–989 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  13. Rozenberg, G. (ed.): Handbook of graph grammars and computing by graph transformation: volume I. foundations. World Scientific Publishing Co., Inc., River Edge (1997)

    MATH  Google Scholar 

  14. Ferrari, G.L., Gnesi, S., Montanari, U., Pistore, M., Ristori, G.: Verifying mobile processes in the hal environment. In: Y. Vardi, M. (ed.) CAV 1998. LNCS, vol. 1427, pp. 511–515. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  15. Devillers, R.R., Klaudel, H., Koutny, M.: Modelling mobility in high-level petri nets. In: ACSD, pp. 110–119. IEEE Computer Society, Los Alamitos (2007)

    Google Scholar 

  16. Montanari, U., Pistore, M.: pi-calculus, structured coalgebras, and minimal hd-automata. In: Nielsen, M., Rovan, B. (eds.) MFCS 2000. LNCS, vol. 1893, pp. 569–578. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LIP6 - UPMC Paris Universitas, France

    Frédéric Peschanski & Joël-Alexis Bialkiewicz

Authors
  1. Frédéric Peschanski
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Joël-Alexis Bialkiewicz
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Aarhus Graduate School of Science, University of Aarhus, Ny Munkegade Bldg 1521-110, DK-8000, Aarhus C, Denmark

    Mogens Nielsen

  2. Faculty of Informatics, Masaryk University, Botanická 68a, 60200, Brno, Czech Republic

    Antonín Kučera

  3. Department of Computer Science, University of Aarhus, IT-parken, Aabogade 34, DK-8200, Aarhus N., Denmark

    Peter Bro Miltersen

  4. Ecole Polytechnique, Rue de Saclay, 91128, Palaiseau Cedex, France

    Catuscia Palamidessi  & Frank Valencia  & 

  5. Faculty of Mathematics and Physics, Charles University, Malostranské námestí 25, 118 00, Prague 1, Malá Strana, Czech Republic

    Petr Tůma

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Peschanski, F., Bialkiewicz, JA. (2009). Modelling and Verifying Mobile Systems Using π-Graphs. In: Nielsen, M., Kučera, A., Miltersen, P.B., Palamidessi, C., Tůma, P., Valencia, F. (eds) SOFSEM 2009: Theory and Practice of Computer Science. SOFSEM 2009. Lecture Notes in Computer Science, vol 5404. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-95891-8_40

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-95891-8_40

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation