Skip to main content
SpringerLink
Log in

Separability in Persistent Petri Nets

  • Conference paper
Applications and Theory of Petri Nets (PETRI NETS 2010)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6128))

Included in the following conference series:

Abstract

We prove that plain, bounded, reversible and persistent Petri nets are weakly and strongly separable.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Best, E., Darondeau, P., Wimmel, H.: Making Petri Nets Safe and Free of Internal Transitions. Fundamenta Informaticae, 1–16 (2007)

    Google Scholar 

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

    Chapter  Google Scholar 

  3. Best, E., Darondeau, P.: A Decomposition Theorem for Finite Persistent Transition Systems. Acta Informatica 46, 237–254 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  4. Best, E., Darondeau, P.: Separability in Persistent Petri Nets. TR 04/09, Dep. Comp. Sci., Univ. Oldenburg (December 2009), http://parsys.informatik.uni-oldenburg.de/~best/publications/EB-PhD-sep-long.pdf

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

  6. Genrich, H.J., Lautenbach, K.: Synchronisationsgraphen. Acta Informatica 2(2), 143–161 (1973)

    Article  MATH  MathSciNet  Google Scholar 

  7. van Hee, K., Sidorova, N., Voorhove, M.: Soundness and Separability of Workflow Nets in the Stepwise Refinement Approach. In: van der Aalst, W.M.P., Best, E. (eds.) ICATPN 2003. LNCS, vol. 2679, pp. 337–356. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  8. Keller, R.M.: A Fundamental Theorem of Asynchronous Parallel Computation. In: Tse-Yun, F. (ed.) Parallel Processing. LNCS, vol. 24, pp. 102–112. Springer, Heidelberg (1975)

    Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Eike Best

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

    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

Editor information

Editors and Affiliations

  1. Department of Information Technologies, Åbo Akademi University, Joukahainengatan 3-5, 20520, Turku, Finland

    Johan Lilius

  2. Institute of Computer Science, Polish Academy of Sciences, Ordona 21, 01-237, Warsaw, Poland

    Wojciech Penczek

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Best, E., Darondeau, P. (2010). Separability in Persistent Petri Nets. In: Lilius, J., Penczek, W. (eds) Applications and Theory of Petri Nets. PETRI NETS 2010. Lecture Notes in Computer Science, vol 6128. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13675-7_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-13675-7_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-13674-0

  • Online ISBN: 978-3-642-13675-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation