Skip to main content
SpringerLink
Log in

The complexity of testing the equivalence of transition sequences

  • Conference paper
  • First Online:
Advances in Petri Nets 1991 (ICATPN 1990)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 524))

Included in the following conference series:

  • 123 Accesses

Abstract

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 u ≡ v is NP-hard. For a corresponding equivalence relation on processes (or partially ordered multisets) the test of equivalence will remain NP-hard.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ij. J. Aalbersberg, G. Rozenberg: Theory of Traces; Theoretical Computer Science, Vol. 60, pp. 1–82 (1988).

    Google Scholar 

  2. E. Best: Kausale Semantik nichtsequentieller Programme; GMD-Bericht Nr. 174, Oldenburg (1988).

    Google Scholar 

  3. E. Best, R. Devillers: Concurrent Behaviour: Sequences, Processes and Programming Languages; GMD-Studien Nr. 99 (1985).

    Google Scholar 

  4. 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. V. Diekert: Combinatorics on Traces LNCS 454, Springer (1990).

    Google Scholar 

  6. H. J. Genrich, K. Lautenbach, P. S. Thiagarajan: Elements of General Net Theory, LNCS 84, pp. 21–163 (1980).

    Google Scholar 

  7. U. Goltz, W. Reisig: The Non-Sequential Behaviour of Petri Nets; Information and Control 57, (S. 125–147), 1983.

    Google Scholar 

  8. A. Mazurkiewicz: Concurrent Program Schemes and their Interpretation; Aarhus University, Computer Science Department, DAIMI PB-78 (1977).

    Google Scholar 

  9. 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. G. Rozenberg: Behaviour of Elementary Net Sustems; Advances in Petri nets 1986, Part I, LNCS 254, pp. 60–94 (1987).

    Google Scholar 

  11. W. Vogler: Representation of a Swapping Class by one Net; Advances in Petri nets 1989, LNCS 424, pp. 467–488 (1990).

    Google Scholar 

  12. 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 

Download references

Author information

Authors and Affiliations

  1. Fachbereich Informatik, Universität Hamburg, Rothenbaumchaussee 67/69, D-2000, Hamburg 13

    Heino Carstensen

Authors
  1. Heino Carstensen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Grzegorz Rozenberg

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Carstensen, H. (1991). The complexity of testing the equivalence of transition sequences. In: Rozenberg, G. (eds) Advances in Petri Nets 1991. ICATPN 1990. Lecture Notes in Computer Science, vol 524. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0019968

Download citation

  • DOI: https://doi.org/10.1007/BFb0019968

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-54398-5

  • Online ISBN: 978-3-540-47600-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation