Advertisement

Delays in synchronized elementary net systems

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

Abstract

Synchronized Elementary Net Systems (SENS) are a model for systems consisting of events, conditions and subject to generalized timing constraints. The constraints are quantified and are relative to some "reference events" such as clock ticks, meters, (multiform time). The partial ordering of event occurrences can be altered by the "timing" constraints which induce additional precedences. This paper provides algorithms which compute delays between event occurrences. The "dioid" algebraic structure is the underlying mathematical model. Applications of delays to some reachability problems are given.

Keywords

Time Petri nets Elementary Net Systems Synchronized Elementary Net Systems POset Process Delay Dioid 

Preview

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é88]
    C.ANDRE: Synchronized Elementary Net Systems. 9th European Workshop on Petri nets, VENICE (I), June 88, published in Advances in Petri Net 1989, LNCS no424, Springer-Verlag 1990.Google Scholar
  4. [André89]
    C.ANDRE: An Algebra for SENS. Technical Report, I3S-LASSY, NICE, December 1989.Google Scholar
  5. [André90]
    C.ANDRE: Delays in Synchronized Elementary Net Systems (Extended version). Technical Report, I3S-LASSY, TR90-1, NICE, January 1990.Google Scholar
  6. [BeCo85]
    G.BERRY, L.COSSERAT:The Synchronous Programming Language ESTEREL and its Mathematical Semantics. Seminar on Concurrency, Springer-Verlag, LNCS 197, 1985.Google Scholar
  7. [BesFer86]
    E.BEST, C.FERNANDEZ: Notation and Terminology of Petri Net Theory. Arbeitspapiere der GMD, 195, Jan 1986.Google Scholar
  8. [Best88]
    E.BEST: Weighted Basic Petri Nets. Concurrency'88, LNCS no, Springer-Verlag 1988, pp 257–276.Google Scholar
  9. [ChrCar84]
    P CHRETIENNE, J CARLIER: Modelling scheduling problems with Timed Petri Nets Advances in Petri Nets 1984, LCNS no188, Springer-Verlag, 1984, pp62–82.Google Scholar
  10. [CMQV89]
    G COHEN, P MOLLER, J.P QUADRAT, M VIOT: Evaluation of Discrete Event Systems. Proceedings of the IEEE, vol 77, no1, Jan 1989, pp39–58.Google Scholar
  11. [GonMin85]
    M.GONDRAN, M.MINOUX: Graphes et algorithmes. Collection de la Direction des Etudes et Recherches d'Electricité de France, no37, Editions EYROLLES, 1985.Google Scholar
  12. [HilLev87]
    H.P HILLION, A.H LEVIS: Timed Event-Graph and Performance evaluation of systems. 8th Europ. Workshop on Appl. and Theory of Petri Nets, Zaragoza, SPAIN, June 1987.Google Scholar
  13. [LevSto87]
    N G. LEVESON, J L STOLZY: Safety Analysis Using Petri Nets. IEEE Trans. on Software Engineering, Vol SE-13, no 3, March 1987, pp386–397.Google Scholar
  14. [MeBe83]
    M.MENASCHE, B.BERTHOMIEU: An Enumerative Approach for Analyzing Time Petri Nets. IFIP 83, PARIS, Sept 83.Google Scholar
  15. [Merlin75]
    MERLIN:On the Relation between Timings and Structure of Recoverable Processes. IBM Research Rep RC5551 (24094) 7/31/75.Google Scholar
  16. [NiPlWi81]
    NIELSEN, PLOTKIN, WINSKEL: Petri Nets, Event Structures and Domains. TCS 134 (1981), 85–108.Google Scholar
  17. [OstWon87]
    J S.OSTROFF, W M.WONHAM:Modelling, Specifying, and Verifying Real-time Embedded Computer Systems. Proceedings of the Real-time Symposium, SAN JOSE (California), Dec 1–3, 1987, pp124–132.Google Scholar
  18. [Petri77]
    C.A PETRI: Non-sequential processes. Internal Report GMD-ISF-77-5 (1977), Gesellschaft für Mathematik und Datenverarbeitung, BONN, (RFA).Google Scholar
  19. [Ramch74]
    C RAMCHANDANI: Analysis of asynchronous concurrent systems by Timed Petri Nets. Technical Report no120, Lab. for Computer Science, M.I.T, Cambridge, MA, 1974.Google Scholar
  20. [Reisig86]
    W.REISIG: Embedded system description using Petri nets. in Embedded System, LNCS no 284, March 1986, pp18–62.Google Scholar
  21. [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
  22. [Rozen86]
    G.ROZENBERG: Behaviour of Elementary Net Systems. in [ACPN86] Part I, 60–94.Google Scholar
  23. [Sifak80]
    J SIFAKIS: Performance evaluation of systems using nets. Net Theory and Applications, Ed Brauer, LNCS no 84, Springer-Verlag, 1980, pp307–319.Google Scholar
  24. [Thiag86]
    P.S.THIAGARAJAN:Elementary Net Systems. in [ACPN86] Part I, 26–59.Google Scholar
  25. [Winskel85]
    G. WINSKEL:Petri Nets, Morphisms and Compositionality, Advances in Petri Nets 1985, LNCS no222, Springer-Verlag, 1985, pp453–477.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • Charles Andre
    • 1
  1. 1.Laboratoire de Signaux et Systèmes Equipe de l'I3S (U.R.A 1376 du CNRS)Université de NICE - Sophia AntipolisNICE CédexFrance

Personalised recommendations