Theory and Implementation of a Real-Time Extension to the π-Calculus

  • Ernesto Posse
  • Juergen Dingel
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6117)


We present a real-time extension to the π-calculus and use it to study a notion of time-bounded equivalence. We introduce the notion of timed compositionality and the associated timed congruence which are useful to reason about the timed behaviour of processes under hard constraints. In addition to this meta-theory we develop an abstract machine for our calculus based on event-scheduling and establish its soundness w.r.t. the given operational semantics. We have built an implementation for a realistic language called kiltera based on this machine.


Operational Semantic Hard Constraint Label Transition System Process Algebra Abstract Machine 
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.


  1. 1.
    Berger, M.: Basic Theory of Reduction Congruence for Two Timed Asynchronous π-Calculi. In: Gardner, P., Yoshida, N. (eds.) CONCUR 2004. LNCS, vol. 3170, pp. 115–130. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  2. 2.
    Chen, J.: A proof system for weak congruence in timed π-calculus. Tech. Report 2004-13, LIFO, Université d’Orléans (2004)Google Scholar
  3. 3.
    Ciobanu, G.: Behaviour Equivalences in Timed Distributed π-calculus. In: Wirsing, M., Banâtre, J.-P., Hölzl, M., Rauschmayer, A. (eds.) Soft-Ware Intensive Systems. LNCS, vol. 5380, pp. 190–208. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  4. 4.
    Ciobanu, G., Juravle, C.: MCTools: A Software Platform for Mobility and Timed Interaction. Tech. Report FML-09-01, Formal Methods Laboratory – Romanian Academy – Iasi Branch (February 2009)Google Scholar
  5. 5.
    Honda, K., Tokoro, M.: An object calculus for asynchronous communication. In: America, P. (ed.) ECOOP 1991. LNCS, vol. 512, pp. 133–147. Springer, Heidelberg (1991)CrossRefGoogle Scholar
  6. 6.
    Kuwabara, H., Yuen, S., Agusa, K.: Congruence Properties for a Timed Extension of the π-Calculus. In: Proc. of DSN 2005 Workshop: Dependable Software, Tools and Methods, pp. 207–214 (2005)Google Scholar
  7. 7.
    Lee, J.Y., Zic, J.: On modeling real-time mobile processes. In: Proc. of ACSC 2002, January 2002, pp. 139–147 (2002)Google Scholar
  8. 8.
    Milner, R., Parrow, J., Walker, D.: A calculus of mobile processes, parts I and II. Reports ECS-LFCS-89-85 and ECS-LFCS-89-86 86, Computer Science Dept., University of Edinburgh (March 1989)Google Scholar
  9. 9.
    Posse, E.: Modelling and Simulation of dynamic structure, discrete-event systems. Ph.d. thesis, School of Computer Science. McGill University (August 2008)Google Scholar
  10. 10.
    Posse, E.: A real-time extension to the π-calculus. Tech. Report 2009-557, School of Computing – Queen’s University (2009),
  11. 11.
    Prisacariu, C., Ciobanu, G.: Timed Distributed π-Calculus. Tech. Report FML-05-01, Institute of Computer Science, Romanian Academy (2005)Google Scholar
  12. 12.
    Sangiorgi, D.: A theory of bisimulation for the π-calculus. Tech. Report ECS-LFCS-93-270, University of Edinburgh (1993)Google Scholar
  13. 13.
    Schneider, S.: An operational semantics for Timed CSP. Information and Computation (1995)Google Scholar
  14. 14.
    Turner, D.N.: The polymorphic Pi-calculus: Theory and Implementation. Ph.d. thesis, Univ. of Edinburgh (1996)Google Scholar
  15. 15.
    Zeigler, B.P., Praehofer, H., Kim, T.G.: Theory of modeling and simulation, 2nd edn. Academic Press, London (2000)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Ernesto Posse
    • 1
  • Juergen Dingel
    • 1
  1. 1.School of ComputingQueen’s UniversityKingstonCanada

Personalised recommendations