Synchronized elementary net systems

  • Charles Andre
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 424)


The behaviour of distributed systems with temporal constraints can be analyzed by means of Time Petri Nets. We show that this approach leads to a sequential observation of the system. Generally, each subsystem is synchronous: its evolutions are controlled by a "synchronizing" event. The communications between subsystems are asynchronous. To tackle the modelling problem raised by these systems, we introduce a low level model that integrates synchronization constraints. This model is called "Synchronized Elementary net System". It consists of an underlying elementary net system and a constraint structure. Extending the notion of process, we explain how to obtain non-sequential observations of these systems.


Time Petri Nets Elementary net systems Process Labelled POset Synchronization 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

VII. References

  1. [ACPN86]
    Advanced Course on Petri nets: Application and Relationships to Other Models of Concurrency. LNCS 255, Springer-Verlag 87.Google Scholar
  2. [André86]
    C.ANDRE: A semantics of timed Petri nets in terms of low level Petri nets. 7th European Workshop on Petri Nets, OXFORD (UK), 86, 115–130.Google Scholar
  3. [André87]
    C.ANDRE: Etude du comportement d'un système synchronisé. Rapport Technique RR87-3, LASSY, Déc 1987Google Scholar
  4. [André88]
    C.ANDRE: Computing Delays in extended processes. Technical Report RR88-2, LASSY, May 1988Google Scholar
  5. [BeCo85]
    G.BERRY, L.COSSERAT: The Synchronous Programming Language ESTEREL and its Mathematical Semantics. Seminar on Concurrency, Springer-Verlag, LNCS 197, 1985.Google Scholar
  6. [BesFer86]
    E.BEST, C.FERNANDEZ: Notation and Terminology of Petri Net Theory. Arbeitspapiere der GMD, 195, Jan 1986.Google Scholar
  7. [Best85]
    E. BEST: Concurrent behaviour: Sequences, processes and axioms. Seminar on Concurrency, LNCS 197, 1985, 221–245Google Scholar
  8. [BouCas87]
    G. BOUDOL, I. CASTELLANI: On the Semantics of Concurrency: Partial Orders and Transition Systems. Proc Coll on Trees in Algebra in Programming (CAAP), PISA, Italy, 1987.Google Scholar
  9. [Grabow81]
    J. GRABOWSKI: On Partial Languages. Fumdamentæ Informaticæ IV.2 (1981) 427–498.Google Scholar
  10. [Kiehn87]
    A.KIEHN: Infinitary Partial Petri Net Languages and their Relationship to other Petri Net Semantics. 8th European Workshop on Petri Nets, ZARAGOZA, Spain, June 87, 429–450.Google Scholar
  11. [MeBe83]
    M.MENASCHE, B.BERTHOMIEU: An Enumerative Approach for Analyzing Time Petri Nets. IFIP 83, PARIS, Sept 83.Google Scholar
  12. [Menas82]
    M.MENASCHE: Analyse des Réseaux de Petri Temporisés et Application aux Systèmes Distribués. Thèse de Docteur Ingénieur, TOULOUSE, Nov 82.Google Scholar
  13. [Merlin75]
    MERLIN: On the Relation between Timings and Structure of Recoverable Processes. IBM Research Rep RC5551 (24094) 7/31/75.Google Scholar
  14. [NiPlWi81]
    NIELSEN, PLOTKIN, WINSKEL: Petri Nets, Event Structures and Domains. TCS 134 (1981), 85–108.Google Scholar
  15. [Reisig85]
    W.REISIG: On the Semantics of Petri Nets. in Formal Models in Programming (E.J Neuhold, G.Chroust, Eds), North-Holland (1985) 345–372.Google Scholar
  16. [Reisig87]
    W.REISIG: A strong part of concurrency. Advances in Petri Nets 1987, Lecture Note in Computer Science 266, Springer-Verlag, 238–272.Google Scholar
  17. [Rozen86]
    G.ROZENBERG: Behaviour of Elementary Net Systems. in [ACPN86] Part I, 60–94.Google Scholar
  18. [Thiag86]
    P.S.THIAGARAJAN: Elementary Net Systems. in [ACPN86] Part I, 26–59.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1990

Authors and Affiliations

  • Charles Andre
    • 1
  1. 1.Laboratoire de Signaux et Systèmes Equipe de l'U.R.A 1376 du CNRSUniversité de NICE — Sophia AntipolisNice CédexFrance

Personalised recommendations