Extending the Petri Box Calculus with Time

  • Olga Marroquín Alonso
  • David Frutos de Escrig
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2075)


PBC (Petri Box Calculus) is a process algebra where real parallelism of concurrent systems can be naturally expressed. One of its main features is the definition of a denotational semantics based on Petri nets, which emphasizes the structural aspects of the modelled systems. However, this formal model does not include temporal aspects of processes, which are necessary when considering real-time systems. The aim of this paper is to extend the existing calculus with those temporal aspects. We consider that actions are not instantaneous, that is, their execution takes time. We present an operational semantics and a denotational semantics based on timed Petri nets. Finally, we discuss the introduction of other new features such as time-outs and delays. Throughout the paper we assume that the reader is familiar with both Petri nets and PBC.


Operational Semantic Conveyor Belt Process Algebra Exception Handler Denotational Semantic 
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.
    E. Best, R. Devillers and J. Hall The Petri Box Calculus: A New Causal Algebra with Multi-label Communication. Advances in Petri Nets 1992, LNCS vol.609, pp.21–69. Springer-Verlag, 1992.Google Scholar
  2. 2.
    E. Best and M. Koutny A Refined View of the Box Algebra. Petri Net Conference’95, LNCS vol.935, pp.1–20. Springer-Verlag, 1995.Google Scholar
  3. 3.
    M. Koutny and E. Best Operational and Denotational Semantics for the Box Algebra. Theoretical Computer Science 211, pp.1–83, 1999.zbMATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    M. Koutny A Compositional Model of Time Petri Nets. Application and Theory of Petri Nets 2000, LNCS vol.1825, pp.303–322. Springer-Verlag, 2000.CrossRefGoogle Scholar
  5. 5.
    O. Marroquín Alonso and D. Frutos Escrig. TPBC: Timed Petri Box Calculus. Technical Report, Dept. Sistemas Informáticos y Programación. UCM, 2000. In Spanish.Google Scholar
  6. 6.
    P. Merlin A Study of the Recoverability of Communication Protocols. PhD. Thesis, University of California, 1974.Google Scholar
  7. 7.
    F. Moller and C. Tofts A Temporal Calculus of CommunicatingSystems. CONCUR’90:Theories of Concurrency: Unification and Extension, LNCS vol.458, pp.401–415. Springer-Verlag, 1990.CrossRefGoogle Scholar
  8. 8.
    Y. Ortega Mallén En Busca del Tiempo Perdido. PhD. Thesis, Universidad Complutense de Madrid. 1990.Google Scholar
  9. 9.
    C. Ramchandani Analysis of Asynchronous Concurrent Systems by Timed Petri Nets. Technical Report 120. Project MAC. 1974.Google Scholar
  10. 10.
    G.M. Reed and A.W. Roscoe Metric Spaces as Models for Real-time Concurrency. Mathematical Foundations of Programming, LNCS vol.298, pp.331–343. Springer-Verlag, 1987.Google Scholar
  11. 11.
    Wang Yi A Calculus of Real Time Systems. PhD. Thesis, Chalmers University of Technology, 1991.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Olga Marroquín Alonso
    • 1
  • David Frutos de Escrig
    • 1
  1. 1.Departamento de Sistemas Informáticos y ProgramaciónUniversidad Complutense de MadridMadridSpain

Personalised recommendations