Skip to main content

Translating Pi-Calculus into LOTOS NT

  • Conference paper
Integrated Formal Methods (IFM 2010)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 6396))

Included in the following conference series:

Abstract

Process calculi supporting mobile communication, such as the π-calculus, are often seen as an evolution of classical value-passing calculi, in which communication between processes takes place along a fixed network of static channels. In this paper, we attempt to bring these calculi closer by proposing a translation from the finite control fragment of the π-calculus to Lotos NT, a value-passing concurrent language with classical process algebra flavour. Our translation is succinct in the size of the π-calculus specification and preserves the semantics of the language by ensuring a one-to-one correspondence between the states and transitions of the labeled transition systems corresponding to the input π-calculus and the output Lotos NT specifications. We automated this translation by means of the Pic2Lnt tool, which makes it possible to analyze π-calculus specifications using all the state-of-the-art simulation and verification functionalities provided by the Cadp toolbox.

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. Abadi, M., Blanchet, B., Fournet, C.: Just Fast Keying in the Pi-Calculus. ACM Trans. Inf. Syst. Secur. 10(3) (2007)

    Google Scholar 

  2. Banach, R., Balazs, J., Papadoupolous, G.: A Translation of the Pi-Calculus Into MONSTR. J. UCS 1(6), 339–398 (1995)

    MATH  Google Scholar 

  3. Bergamini, D., Descoubes, N., Joubert, C., Mateescu, R.: BISIMULATOR: A Modular Tool for On-the-Fly Equivalence Checking. In: Halbwachs, N., Zuck, L.D. (eds.) TACAS 2005. LNCS, vol. 3440, pp. 581–585. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  4. Champelovier, D., Clerc, X., Garavel, H., Guerte, Y., Lang, F., Serwe, W., Smeding, G.: Reference Manual of the LOTOS NT to LOTOS Translator (Version 5.0). In: INRIA/VASY, 107 pages (March 2010)

    Google Scholar 

  5. OASIS Technical Committee. Web Services Business Process Execution Language Version 2.0 (2007)

    Google Scholar 

  6. Dam, M.: On the Decidability of Process Equivalences for the pi-Calculus. Theor. Comput. Sci. 183(2), 215–228 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  7. Deng, S., Wu, Z., Zhou, M., Li, Y., Wu, J.: Modeling Service Compatibility with Pi-Calculus for Choreography. In: Embley, D.W., Olivé, A., Ram, S. (eds.) ER 2006. LNCS, vol. 4215, pp. 26–39. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  8. Ferrari, G.L., Ferro, G., Gnesi, S., Montanari, U., Pistore, M., Ristori, G.: An Automated Based Verification Environment for Mobile Processes. In: Brinksma, E. (ed.) TACAS 1997. LNCS, vol. 1217, pp. 275–289. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  9. Fredlund, L.-Å., Orava, F.: Modelling Dynamic Communication Structures in LOTOS. In: Proc. of FORTE 1991. IFIP Transactions, vol. C-2, pp. 185–200. North-Holland, Amsterdam (1991)

    Google Scholar 

  10. Garavel, H.: OPEN/CÆSAR: An Open Software Architecture for Verification, Simulation and Testing. In: Steffen, B. (ed.) TACAS 1998. LNCS, vol. 1384, pp. 68–84. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  11. Garavel, H., Lang, F., Mateescu, R.: Compiler Construction using LOTOS NT. In: Horspool, R.N. (ed.) CC 2002. LNCS, vol. 2304, pp. 9–13. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  12. Garavel, H., Lang, F., Mateescu, R., Serwe, W.: CADP 2006: A Toolbox for the Construction and Analysis of Distributed Processes. In: Damm, W., Hermanns, H. (eds.) CAV 2007. LNCS, vol. 4590, pp. 158–163. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  13. Garavel, H., Sighireanu, M.: A Graphical Parallel Composition Operator for Process Algebras. In: Proc. of FORTE/PSTV 1999. IFIP, pp. 185–202. Kluwer Academic Publishers, Dordrecht (October 1999)

    Google Scholar 

  14. Lucchi, R., Mazzara, M.: A Pi-Calculus based Semantics for WS-BPEL. J. Log. Algebr. Program. 70(1), 96–118 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  15. ISO/IEC. Enhancements to LOTOS (E-LOTOS). International Standard 15437:2001, International Organization for Standardization, Genève (September 2001)

    Google Scholar 

  16. ISO/IEC. LOTOS — A Formal Description Technique Based on the Temporal Ordering of Observational Behaviour. International Standard 8807, International Organization for Standardization, Genève (September 1989)

    Google Scholar 

  17. Mateescu, R., Thivolle, D.: A Model Checking Language for Concurrent Value-Passing Systems. In: Cuellar, J., Maibaum, T., Sere, K. (eds.) FM 2008. LNCS, vol. 5014, pp. 148–164. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  18. Milner, R.: Communication and Concurrency. Prentice-Hall, Englewood Cliffs (1989)

    MATH  Google Scholar 

  19. Milner, R.: Communicating and Mobile Systems: the Pi-Calculus. Cambridge University Press, Cambridge (1999)

    MATH  Google Scholar 

  20. Milner, R., Parrow, J., Walker, D.: A Calculus of Mobile Processes. Information and Computation 100(1), 1–77 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  21. Montanari, U., Pistore, M.: Checking Bisimilarity for Finitary Pi-Calculus. In: Lee, I., Smolka, S.A. (eds.) CONCUR 1995. LNCS, vol. 962, pp. 42–56. Springer, Heidelberg (1995)

    Chapter  Google Scholar 

  22. Najm, E., Stefani, J.-B., Février, A.: Towards a Mobile LOTOS. In: FORTE 1995. IFIP Conference Proceedings, vol. 43, pp. 127–142. Chapman & Hall, Boca Raton (1995)

    Google Scholar 

  23. Norman, G., Palamidessi, C., Parker, D., Wu, P.: Model Checking Probabilistic and Stochastic Extensions of the Pi-Calculus. IEEE Trans. Software Eng. 35(2), 209–223 (2009)

    Article  Google Scholar 

  24. Parrow, J.: An introduction to the pi-calculus. In: Handbook of Process Algebra, ch. 8, pp. 479–544. North-Holland, Amsterdam (2001)

    Chapter  Google Scholar 

  25. Puhlmann, F.: Why Do We Actually Need the Pi-Calculus for Business Process Management? In: Proc. of BIS 2006, GI. LNI, vol. 85, pp. 77–89 (2006)

    Google Scholar 

  26. Sangiorgi, D.: A Theory of Bisimulation for the pi-Calculus. Acta Inf. 33(1), 69–97 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  27. Song, H., Compton, K.J.: Verifying Pi-Calculus Processes by Promela Translation. Technical Report CSE-TR-472-03, University of Michigan, USA (2003)

    Google Scholar 

  28. Victor, B., Moller, F.: The Mobility Workbench – A Tool for the π-Calculus. In: Dill, D.L. (ed.) CAV 1994. LNCS, vol. 818, pp. 428–440. Springer, Heidelberg (1994)

    Chapter  Google Scholar 

  29. Wu, P.: Interpreting Pi-Calculus with Spin/Promela. In: Proc. of NCTCS 2003. Computer Science, vol. 8(Suppl.), pp. 7–9 (2003)

    Google Scholar 

  30. Yang, P., Ramakrishnan, C.R., Smolka, S.A.: A Logical Encoding of the Pi-Calculus: Model Checking Mobile Processes using Tabled Resolution. STTT 6(1), 38–66 (2004)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Mateescu, R., Salaün, G. (2010). Translating Pi-Calculus into LOTOS NT. In: Méry, D., Merz, S. (eds) Integrated Formal Methods. IFM 2010. Lecture Notes in Computer Science, vol 6396. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16265-7_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-16265-7_17

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-16264-0

  • Online ISBN: 978-3-642-16265-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics