Advertisement

Representation of a swapping class by one net

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

Abstract

Processes of Petri nets correspond to sets of firing sequences, and processes offer a graphical representation of their sets of compatible firing sequences by one net. For a contact-free C/E-net these sets form a partition of the set of all firing sequences, but this does not hold for a P/T-net. To get a similar, nice result for P/T-nets, swapping and based upon it two equivalence notions, one for processes and one for firing sequences were introduced in [BeDe]. We discuss the problem of representing such an equivalence class of sequences by one net. We obtain a solution for S-nets, thus gainig insight into the nature of the swapping classes for these nets.

Keywords

Partial order semantics P/T-nets processes equivalence of firing sequences equivalence of processes S-nets 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [AaRo]
    Aalbersberg, I.J., Rozenberg, G.: Theory of Traces; Theoret. Comp. Sci. 60 (1988) 1–82Google Scholar
  2. [BeDe]
    Best, E., Devillers, R.: Sequential and Concurrent Behaviour in Petri Net Theory; Theoret. Comp. Sci. 55 (1987) 87–136Google Scholar
  3. [BeFe]
    Best, E., Fernández, C.: Notations and Terminology on Petri Net Theory; Arbeitspapiere GMD 195, 1986Google Scholar
  4. [Br]
    W. Brauer: How to play the token game?; Petri Net Newsletter 16 (1984) 3–13Google Scholar
  5. [Go]
    U. Goltz: How Many Transitions may be in Conflict?; Petri Net Newsletter 25, 1986, 4–9Google Scholar
  6. [GoRe]
    Goltz, U., Reisig, W.: The Non-Sequential Behaviour of Petri Nets; Information and Control 57 (1983) 125–147Google Scholar
  7. [Gr]
    Grabowski, J.: On Partial Languages; Ann. Soc. Math. Pol., Fundamenta Informaticae IV.2 (1981) 428–498Google Scholar
  8. [Ha]
    Halin, R.: Graphentheorie I,II; Wissenschaftliche Buchgesellschaft, Darmstadt, 1980, 1981, Erträge der Forschung Bd. 138/161Google Scholar
  9. [Ki]
    Kiehn, A.: On the Interrelationship Between Synchronized and Non-Synchronized Behaviour of Petri Nets; J. Inf. Process. Cybern. EIK 24 (1988) 3–18Google Scholar
  10. [Ma]
    Mazurkiewicz, A.: Traces, Histories, Graphs: Instances of a Process Monoid; 11th Symp. Math. Foundations of Comp. Sci., 1984, Lect. Notes Comp. Sci. 1976, 115–133Google Scholar
  11. [Pr]
    Pratt, V.: Modelling Concurrency with Partial Orders; Int. J. of Parallel Programming 15, 1986Google Scholar
  12. [Re]
    Reisig, W.: On the Semantics of Petri Nets; in: E.J.Neuhold, G.Chroust (eds.): Formal Models in Programming. Proc. IFIP TC2 Working Conference on the Role of Abstract Models in Information Processing, Wien, 1985. North-Holland 1985, 347–372Google Scholar
  13. [Ro]
    Rozenberg, G.: Behaviour of Elementary Net-Systems; in: W. Brauer, W. Reisig, G. Rozenberg (eds.): Petri Nets: Central Models and Their Properties. Springer 1987, Lect. Notes Comp. Sci. 254, 60–94Google Scholar
  14. [St]
    Starke, P.H.: Processes in Petri Nets; EIK 17 (1981) 389–416Google Scholar
  15. [Ta]
    Taubner, D.: On the Implementation of Petri Nets; in: G. Rozenberg (ed.): Advances in Petri Nets 1988. Springer 1988, Lect. Notes Comp. Sci. 340, 418–439Google Scholar
  16. [Vo]
    Vogler, W.: Executions of Petri Nets; Proc. of the 8th European Workshop on Application and Theory of Petri Nets, Zaragoza, 1987, 551–564Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1990

Authors and Affiliations

  • Walter Vogler
    • 1
  1. 1.Institut für InformatikTechnische Universität MünchenMünchen 2

Personalised recommendations