Skip to main content
SpringerLink
Log in

Checking bisimilarity for finitary π-calculus

  • Session: Mobile Processes I
  • Conference paper
  • First Online:
CONCUR '95: Concurrency Theory (CONCUR 1995)

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

Included in the following conference series:

Abstract

In this paper we associate to every π-calculus agent an irredundant unfolding, i.e., a labeled transition system equipped with the ordinary notion of strong bisimilarity, so that agents are mapped into strongly bisimilar unfoldings if and only if they are early strongly bisimilar. For a class of finitary agents (that strictly contains the finite control agents) without matching, the corresponding unfoldings are finite and can be built efficiently. The main consequence of the results presented in the paper is that the irredundant unfolding can be constructed also for a single agent, and then a minimal realization can be derived from it employing the ordinary partition refinement algorithm. Instead, according toprevious results only pairs of π-calculus agents could be unfolded and tested for bisimilarity, and no minimization of a single agent was possible. Another consequence is the improvement of the complexity bound for checking bisimilarity of finitary agents without matching.

Work supported in part by Esprit Basic Research project CONFER and by Progetto Speciale CNR “Specifica ad Alto Livello e Verifica Formale di Sistemi Digitali”.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. G. Boudol, I. Castellani, M. Hennessy and A. Kiehn. Observing localities. Theoretical Computer Science, 114:31–61, 1993.

    Article  Google Scholar 

  2. F. Corradini and R. De Nicola. Distribution and locality of concurrent systems. In Proc. ICALP'94, LNCS 820. Springer Verlag, 1994.

    Google Scholar 

  3. M. Dam. On the decidability of process equivalences for the π-calculus. SICS Research Report RR:94-20, 1994.

    Google Scholar 

  4. Ph. Darondeau and P. Degano. Causal trees. In Proc. ICALP'89, LNCS 372. Springer Verlag, 1989.

    Google Scholar 

  5. J.-C. Fernandez and L. Mounier. “On the fly” verification of behavioural equivalences and preorders. In Proc. CAV'91, LNCS 575. Springer Verlag, 1991.

    Google Scholar 

  6. G. Ferrari, U. Montanari and P. Quaglia. The weak late π-calculus semantics as observation equivalence. To appear in Proc. CONCUR'95.

    Google Scholar 

  7. P. Inverardi and C. Priami. Evaluation of tools for the analysis of communicating systems. Bulletin of the EATCS, 45:158–185, 1991.

    Google Scholar 

  8. B. Jonsson and J. Parrow. Deciding bisimulation equivalences for a class of non-finite-state programs. Information and Computation, 107:272–302, 1993.

    Article  Google Scholar 

  9. P. C. Kanellakis and S. A. Smolka. CCS expressions, finite state processes, and three problems of equivalence. Information and Computation, 86:43–68, 1990.

    Article  Google Scholar 

  10. E. Madelaine. Verification tools for the CONCUR project. Bulletin of the EATCS, 47:110–126, 1992.

    Google Scholar 

  11. R. Milner. Communication and Concurrency. Prentice Hall, 1989.

    Google Scholar 

  12. R. Milner. The polyadic π-calculus: a tutorial. In Logic and Algebra of Specification, NATO ASI Series F, Vol. 94. Springer Verlag, 1993.

    Google Scholar 

  13. R. Milner, J. Parrow and D. Walker. A calculus of mobile processes (parts I and II). Information and Computation, 100:1–77, 1992.

    Article  Google Scholar 

  14. R. Milner, J. Parrow and D. Walker. Modal logic for mobile processes. In Proc. CONCUR'91, LNCS 527. Springer Verlag, 1992.

    Google Scholar 

  15. R. Paige and R. E. Tarjan. Three partition refinement algorithms. SIAM Journal on Computing, 16(6):973–989, 1987.

    Article  Google Scholar 

  16. D. Sangiorgi. A theory of bisimulation for the π-calculus. In Proc. CONCUR'93, LNCS 715. Springer Verlag, 1993.

    Google Scholar 

  17. D. Sangiorgi. On the bisimulation proof method. Tech. Rep. ECS-LFCS-94-299, LFCS, Dept. of Comp. Sci., Edinburgh Univ., 1994. An extended abstract will appear in Proc. MFCS'95.

    Google Scholar 

  18. D. Sangiorgi. Expressing mobility in process algebras: first-order and higher-order paradigms. PhD Thesis CST-99-93, University of Edinburgh, 1992.

    Google Scholar 

  19. B. Victor and F. Moller. The Mobility Workbench — A tool for the π-calculus. In Proc. CAV'94, LNCS 818. Springer Verlag, 1994.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, University of Pisa, Corso Italia 40, 56100, Pisa, Italy

    Ugo Montanari & Marco Pistore

Authors
  1. Ugo Montanari
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Marco Pistore
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Insup Lee Scott A. Smolka

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Montanari, U., Pistore, M. (1995). Checking bisimilarity for finitary π-calculus. In: Lee, I., Smolka, S.A. (eds) CONCUR '95: Concurrency Theory. CONCUR 1995. Lecture Notes in Computer Science, vol 962. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60218-6_4

Download citation

  • DOI: https://doi.org/10.1007/3-540-60218-6_4

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60218-7

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation