Behaviour Equivalences in Timed Distributed π-Calculus

  • Gabriel Ciobanu
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5380)


The complexity of the software-intensive systems requires working with notions as explicit locations in a distributed system, interaction among the mobile processes restricted by interaction timeouts, time scheduling, and restricted resource access. In order to work these notions, we use a timed and distributed variant of the π-calculus having explicit locations, types for restricting the resource access, and time constraints for interaction in distributed systems. Using observation predicates, several behavioural notions are defined and related: (global) barbed bisimulations, (global) typed barbed bisimulation, timed (global) barbed bisimulations, timed (global) typed barbed bisimulation and full timed global typed barbed bisimulation. These bisimulations form a lattice according to their distinguishing power.


Behaviour Equivalence Locate Process Output Channel Channel Type Resource Access 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Aman, B., Ciobanu, G.: Mobile Ambients with Timers and Types. In: Jones, C.B., Liu, Z., Woodcock, J. (eds.) ICTAC 2007. LNCS, vol. 4711, pp. 50–63. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  2. 2.
    Ciobanu, G.: Interaction in Time and Space. Electronic Notes in Theoretical Computer Science 203, 5–18 (2008)CrossRefzbMATHGoogle Scholar
  3. 3.
    Ciobanu, G., Prisacariu, C.: Timers for Distributed Systems. Electronic Notes in Theoretical Computer Science 164, 81–99 (2006)CrossRefGoogle Scholar
  4. 4.
    Ciobanu, G., Prisacariu, C.: Barbed Bisimulations for Timed Distributed π-Calculus. In: 2nd Int’l Conference on Intelligent Computer Communication and Processing, Cluj-Napoca, pages 6 (2006)Google Scholar
  5. 5.
    Felleisen, M., Wright, A.K.: A Syntactic Approach to Type Soundness. Information and Computation 115, 38–94 (1994)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Hennessy, M., Regan, T.: A Process Algebra For Timed Systems. Information and Computation 117, 221–239 (1995)MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    Hennessy, M., Riely, J.: Resource Access Control in Systems of Mobile Agents. Information and Computation 173, 82–120 (2002)MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    Milner, R.: Communicating and Mobile Systems: the π-calculus. Cambridge University Press, Cambridge (1999)zbMATHGoogle Scholar
  9. 9.
    Milner, R., Sangiorgi, D.: Barbed Bisimulation. LNCS, vol. 623, pp. 685–695. Springer, Heidelberg (1992)Google Scholar
  10. 10.
    Sangiorgi, D.: Expressing Mobility in Process Algebras: First-Order and Higher-Order Paradigms, PhD Thesis, University of Edinburgh (1992)Google Scholar
  11. 11.
    van Glabbeek, R.J.: The Linear Time - Branching Time Spectrum. Handbook of Process Algebra, pp. 3–99 (2001)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Gabriel Ciobanu
    • 1
    • 2
  1. 1.Institute of Computer ScienceRomanian AcademyIaşiRomania
  2. 2.“A.I. Cuza” University of IaşiRomania

Personalised recommendations