The complexity of testing the equivalence of transition sequences

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


By [Best 89] and [Best, Devillers 88] a semantics for place/transition nets has been defined on equivalence classes of firing sequences induced by the exchange relation (two transitions can be exchanged if they are concurrently enabled). This semantics preserves the causal dependences between transitions. For the equivalence relation we show: Given a place/transition net N and two firing sequences u, v ∈ F(N), the question uv is NP-hard. For a corresponding equivalence relation on processes (or partially ordered multisets) the test of equivalence will remain NP-hard.


Causality/partial order theory of concurrency Analysis and synthesis structure and behaviour of nets Net-based semantical logical and algebraic calculi 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [Aalbersberg, Rozenberg 88]
    Ij. J. Aalbersberg, G. Rozenberg: Theory of Traces; Theoretical Computer Science, Vol. 60, pp. 1–82 (1988).Google Scholar
  2. [Best 89]
    E. Best: Kausale Semantik nichtsequentieller Programme; GMD-Bericht Nr. 174, Oldenburg (1988).Google Scholar
  3. [Best, Devillers 85]
    E. Best, R. Devillers: Concurrent Behaviour: Sequences, Processes and Programming Languages; GMD-Studien Nr. 99 (1985).Google Scholar
  4. [Best, Devillers 88]
    E. Best, R. Devillers: Sequential and Concurrent Behaviour in Petri Net Theory; Theoretical Computer Science, Vol. 55 No. 1, pp. 87–136 (1988).Google Scholar
  5. [Diekert 90]
    V. Diekert: Combinatorics on Traces LNCS 454, Springer (1990).Google Scholar
  6. [Genrich, Lautenbach, Thiagarajan 80]
    H. J. Genrich, K. Lautenbach, P. S. Thiagarajan: Elements of General Net Theory, LNCS 84, pp. 21–163 (1980).Google Scholar
  7. [Goltz, Reisig 83]
    U. Goltz, W. Reisig: The Non-Sequential Behaviour of Petri Nets; Information and Control 57, (S. 125–147), 1983.Google Scholar
  8. [Mazurkiewicz 77]
    A. Mazurkiewicz: Concurrent Program Schemes and their Interpretation; Aarhus University, Computer Science Department, DAIMI PB-78 (1977).Google Scholar
  9. [Rozenberg, Verraedt 83]
    G. Rozenberg, R. Verraedt: Subset Languages of Petri Nets, Part I: The Relationship to String Languages and Normal Forms, Part II: Closure Properties; Theoretical Computer Science, Vol. 26, pp. 301–326 and Vol. 27 pp. 85–108 (1983).Google Scholar
  10. [Rozenberg 87]
    G. Rozenberg: Behaviour of Elementary Net Sustems; Advances in Petri nets 1986, Part I, LNCS 254, pp. 60–94 (1987).Google Scholar
  11. [Vogler 90]
    W. Vogler: Representation of a Swapping Class by one Net; Advances in Petri nets 1989, LNCS 424, pp. 467–488 (1990).Google Scholar
  12. [Warmuth, Haussler 84]
    M. K. Warmuth, D. Haussler: On the Complexity of Iterated Shuffle, Journal of Computer and System Science, Vol. 28, pp. 345–358 (1984).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • Heino Carstensen
    • 1
  1. 1.Fachbereich InformatikUniversität HamburgHamburg 13

Personalised recommendations