Skip to main content
SpringerLink
Log in

A decomposition theorem for finite persistent transition systems

  • Original Article
  • Published:
Acta Informatica Aims and scope Submit manuscript

Abstract

In this paper, we consider finite labelled transition systems. We show that if such transition systems are deterministic, persistent, and weakly periodic, then they can be decomposed in the following sense. There exists a finite set of label-disjoint cycles such that any other cycle is Parikh-equivalent to a multiset of cycles from this set.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Best E., Darondeau P., Wimmel H.: Making Petri nets safe and free of internal transitions. Fundamenta Informaticae 80, 75–90 (2007)

    MATH  MathSciNet  Google Scholar 

  2. Best, E., Esparza, J., Wimmel, H., Wolf, K.: Separability in conflict-free Petri nets. In: Virbitskaite, I., Voronkov, A. (eds.) Proc. PSI’2006. LNCS, vol. 4378, pp. 1–18. Springer (2006)

  3. Chen, W.K.: Applied Graph Theory. North-Holland, Amsterdam (1971)

  4. Commoner F., Holt A.W., Even S., Pnueli A.: Marked directed graphs. J. Comput. Syst. Sci. 5(5), 511–523 (1971)

    MATH  MathSciNet  Google Scholar 

  5. Darondeau P.: Equality of languages coincides with isomorphism of reachable state graphs for bounded and persistent petri Nets. Inf. Process. Lett. 94, 241–245 (2005)

    Article  MathSciNet  Google Scholar 

  6. Desel, J., Esparza, J.: Free choice Petri nets. In: Cambridge Tracts in Theoretical Computer Science, 242 pp. ISBN:0-521-46519-2 (1995)

  7. Grabowski J.: The decidability of persistence for vector addition systems. Inf. Process. Lett. 11(1), 20–23 (1980)

    Article  MATH  MathSciNet  Google Scholar 

  8. Keller, R.M.: A fundamental theorem of asynchronous parallel computation. In: Parallel Processing. LNCS, vol. 24, pp. 102–112. Springer (1975)

  9. Landweber L.H., Robertson E.L.: Properties of conflict-free and persistent Petri nets. JACM 25(3), 352–364 (1978)

    Article  MATH  MathSciNet  Google Scholar 

  10. Yamasaki H.: On weak persistency of Petri nets. Inf. Process. Lett. 13(3), 94–97 (1981)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Parallel Systems, Department of Computing Science, Carl von Ossietzky Universität Oldenburg, 26111, Oldenburg, Germany

    Eike Best

  2. INRIA, Centre Rennes-Bretagne Atlantique, Campus de Beaulieu, 35042, Rennes Cedex, France

    Philippe Darondeau

Authors
  1. Eike Best
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Philippe Darondeau
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Eike Best.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Best, E., Darondeau, P. A decomposition theorem for finite persistent transition systems. Acta Informatica 46, 237–254 (2009). https://doi.org/10.1007/s00236-009-0095-6

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00236-009-0095-6

Keywords

Search

Navigation