Skip to main content
SpringerLink
Log in

Type Abstractions of Name-Passing Processes

  • Conference paper
International Symposium on Fundamentals of Software Engineering (FSEN 2007)

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

Included in the following conference series:

Abstract

We study methods to statically approximate “first-order” process calculi (Pi, Join) by “propositional” models (ccs, bpp, Petri nets). We consider both open and closed behavior of processes. In the case of open behavior, we propose a type system to associate pi-calculus processes with restriction-free ccs types. A process is shown to be in simulation relation with each of its types, hence safety properties that hold of the types also hold of the process. We refine this approach in the case of closed behavior: in this case, types are bpp processes. Sufficient conditions are given under which a minimal bpp type can be computed that is bisimilar to a given process. These results are extended to the Join calculus using place/transition Petri nets as types.

The first author is supported by the French government research grant ACI TRALALA. The second author is supported by the EU within the FET-GC2 initiative, project SENSORIA.

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 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. Milner, R.: The polyadic π-calculus: a tutorial. In: Logic and Algebra of Specification, pp. 203–246. Springer, Heidelberg (1993)

    Google Scholar 

  2. Fournet, C., Gonthier, G.: The reflexive chemical abstract machine and the join calculus. In: POPL, pp. 372–385. ACM Press, New York (1996)

    Google Scholar 

  3. Igarashi, A., Kobayashi, N.: A generic type system for the pi-calculus. TCS 311(1-3), 121–163 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  4. Christensen, S., Hirshfeld, Y., Moller, F.: Decidable subsets of CCS. The Computer Journal 37(4), 233–242 (1994)

    Article  Google Scholar 

  5. Christensen, S., Hishfeld, Y., Moller, F.: Bisimulation equivalence is decidable for basic parallel processes. In: Best, E. (ed.) CONCUR 1993. LNCS, vol. 715, pp. 143–157. Springer, Heidelberg (1993)

    Google Scholar 

  6. Hirshfeld, Y., Moller, F.: Decidability results in automata and process theory. In: Moller, F., Birtwistle, G. (eds.) Logics for Concurrency. LNCS, vol. 1043, pp. 102–148. Springer, Heidelberg (1996)

    Google Scholar 

  7. Burkart, O., Esparza, J.: More infinite results. In: Current Trends in Theoretical Computer Science: entering the 21st centuary, pp. 480–503. World Scientific Publishing Co., Inc., Singapore (2001)

    Google Scholar 

  8. Sangiorgi, D.: The name discipline of uniform receptiveness. TCS 221(1-2), 457–493 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  9. Stirling, C.: Modal logics for communicating systems. TCS 49(2-3), 311–347 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  10. Rajamani, S.K., Rehof, J.: A behavioral module system for the pi-calculus. In: Cousot, P. (ed.) SAS 2001. LNCS, vol. 2126, pp. 375–394. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  11. Chaki, S., Rajamani, S.K., Rehof, J.: Types as models: Model checking message-passing programs. In: POPL, pp. 45–57. ACM Press, New York (2002)

    Chapter  Google Scholar 

  12. Sangiorgi, D.: A theory of bisimulation for π-calculus. Acta Informartica 33 (1996)

    Google Scholar 

  13. Kobayashi, N., Pierce, B.C., Turner, D.N.: Linearity and the Pi-Calculus. ACM Transactions on Programming Languages and Systems 21(5), 914–947 (1999)

    Article  Google Scholar 

  14. Kobayashi, N.: A partially deadlock-free typed process calculus. ACM Transactions on Programming Languages and Systems 20(2), 436–482 (1998)

    Article  Google Scholar 

  15. Kobayashi, N., Saito, S., Sumii, E.: An implicitly-typed deadlock-free process calculus. In: Palamidessi, C. (ed.) CONCUR 2000. LNCS, vol. 1877, pp. 489–503. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  16. Kobayashi, N.: A type system for lock-free processes. Information and Computation 177(2), 122–159 (2002)

    MATH  MathSciNet  Google Scholar 

  17. Kobayashi, N.: Type-based information flow analysis for the pi-calculus. Acta Informartica 42(4-5), 291–347 (2005)

    Article  MATH  Google Scholar 

  18. Kobayashi, N.: A new type system for deadlock-free processes. In: Baier, C., Hermanns, H. (eds.) CONCUR 2006. LNCS, vol. 4137, pp. 233–247. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  19. Kobayashi, N., Suenaga, K., Wischik, L.: Resource usage analysis for the pi-calculus. In: Emerson, E.A., Namjoshi, K.S. (eds.) VMCAI 2006. LNCS, vol. 3855, pp. 298–312. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  20. Fournet, C., Laneve, C., Maranget, L., Rémy, D.: Implicit typing à la ML for the join-calculus. In: Mazurkiewicz, A., Winkowski, J. (eds.) CONCUR 1997. LNCS, vol. 1243, pp. 196–212. Springer, Heidelberg (1997)

    Google Scholar 

  21. Odersky, M., Zenger, C., Zenger, M., Chen, G.: A functional view of join. Technical Report ACRC-99-016, University of South Australia (1999)

    Google Scholar 

  22. Asperti, A., Busi, N.: Mobile petri nets. Technical Report UBLCS 96-10, Università di Bologna (1996)

    Google Scholar 

  23. Odersky, M.: Functional nets. In: Smolka, G. (ed.) ESOP 2000 and ETAPS 2000. LNCS, vol. 1782, pp. 1–25. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  24. Buscemi, M.G., Sassone, V.: High-level petri nets as type theories in the join calculus. In: Honsell, F., Miculan, M. (eds.) ETAPS 2001 and FOSSACS 2001. LNCS, vol. 2030, pp. 104–120. Springer, Heidelberg (2001)

    Google Scholar 

  25. Najm, E., Nimour, A.: Explicit behavioral typing for object interfaces. In: Moreira, A.M.D., Demeyer, S. (eds.) Object-Oriented Technology. ECOOP 1999 Workshop Reader. LNCS, vol. 1743, p. 321. Springer, Heidelberg (1999)

    Google Scholar 

  26. Najm, E., Nimour, A., Stefani, J.B.: Infinite types for distributed object interfaces. In: FMOODS of IFIP Conference Proceedings, vol. 139, p. 450 (1999)

    Google Scholar 

  27. Ravara, A., Vasconcelos, V.T.: Behavioral types for a calculus of concurrent objects. In: Lengauer, C., Griebl, M., Gorlatch, S. (eds.) Euro-Par 1997. LNCS, vol. 1300, pp. 554–561. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  28. Yoshida, N.: Graph types for monadic mobile processes. In: Chandru, V., Vinay, V. (eds.) Foundations of Software Technology and Theoretical Computer Science. LNCS, vol. 1180, pp. 371–386. Springer, Heidelberg (1996)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratoire d’Informatique Fondamentale de Marseille, Université de Provence,  

    Lucia Acciai

  2. Dipartimento di Sistemi e Informatica, Università di Firenze,  

    Michele Boreale

Authors
  1. Lucia Acciai
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Michele Boreale
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Farhad Arbab Marjan Sirjani

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Acciai, L., Boreale, M. (2007). Type Abstractions of Name-Passing Processes. In: Arbab, F., Sirjani, M. (eds) International Symposium on Fundamentals of Software Engineering. FSEN 2007. Lecture Notes in Computer Science, vol 4767. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75698-9_20

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-75698-9_20

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-75697-2

  • Online ISBN: 978-3-540-75698-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation