Petri Nets as Executable Specifications of High-Level Timed Parallel Systems

  • Franck Pommereau
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3038)


We propose to use high-level Petri nets for the semantics of high-level parallel systems. This model is known to be useful for the of verification and we show that it is also executable in a parallel way. Executing a Petri net is easy in general but more complicated in a timed context, which makes necessary to synchronise the internal time of the Petri net with the real time of its environment. Another problem is to relate the execution of a Petri net, which has its own semantics, to that of its environment; i.e., to properly handle input/output.

This paper presents a parallel algorithm to execute Petri nets with time enforcing the even progression of the internal time with respect to the real time and allowing the exchange of information with the environment. We define a class of Petri nets suitable for a parallel execution machine which preserves the step sequence semantics of the nets and ensures time consistent executions while taking into account the solicitation of its environment. The question of the efficient verification of such nets has been addressed in a separate paper [4], the present one is focused on the practical aspects involved in the execution of so modelled systems.


Petri nets parallelism real-time execution machines 


  1. 1.
    Bui Thanh, C., Klaudel, H., Pommereau, F.: Petri nets with causal time for system verification. In: MTCS 2002. ENTCS, vol. 68(5), Elsevier, Amsterdam (2003)Google Scholar
  2. 2.
    Durchholz, R.: Causality, time, and deadlines. In: Data & Knowledge Engineering, vol. 6, North-Holland, Amsterdam (1991)Google Scholar
  3. 3.
    Klaudel, H.: Compositional High-Level Petri nets Semantics of a Parallel Programming Language with Procedures. In: SCP, vol. 41, Elsevier, Amsterdam (2001)Google Scholar
  4. 4.
    Pommereau, F.: Causal Time Calculus. In: Larsen, K.G., Niebert, P. (eds.) FORMATS 2003. LNCS, vol. 2791, Springer, Heidelberg (2004) (to appear)CrossRefGoogle Scholar
  5. 5.
    Richter, G.: Counting interfaces for discrete time modelling. Technical report 26, GMD (September 1998)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Franck Pommereau
    • 1
  1. 1.LACL, Université ParisCréteilFrance

Personalised recommendations