Skip to main content
SpringerLink
Log in
Book cover

International Andrei Ershov Memorial Conference on Perspectives of System Informatics

PSI 2006: Perspectives of Systems Informatics pp 1–18Cite as

Separability in Conflict-Free Petri Nets

  • Conference paper

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

Abstract

We study whether transition sequences that transform markings with multiples of a number k on each place can be separated into k sequences, each transforming one k-th of the original marking. We prove that such a separation is possible for marked graph Petri nets, and present an inseparable sequence for a free-choice net.

This is a preview of subscription content, 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Commoner, F., et al.: Marked Directed Graphs. J. Comput. Syst. Sci. 5(5), 511–523 (1971)

    MATH  MathSciNet  Google Scholar 

  2. Desel, J., Esparza, J.: Free Choice Petri Nets. Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, Cambridge (1995)

    MATH  Google Scholar 

  3. Esparza, J., Melzer, S.: Verification of Safety Properties Using Integer Programming: Beyond the State Equation. Formal Methods in System Design 16(2), 159–189 (2000)

    Article  Google Scholar 

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

    MATH  MathSciNet  Google Scholar 

  5. Goltz, U.: Synchronic Distance. In: Brauer, W., Reisig, W., Rozenberg, G. (eds.) APN 1986. LNCS, vol. 254, pp. 338–358. Springer, Heidelberg (1987)

    Google Scholar 

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

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

  8. Schrijver, A.: Theory of Linear and Integer Programming. Wiley, Chichester (1986)

    MATH  Google Scholar 

  9. Yen, H.C., Wang, B.Y., Yang, M.S.: Deciding a Class of Path Formulas for Conflict-Free Petri Nets. Theory of Computing Systems 30(5), 475–494 (1997)

    MATH  MathSciNet  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 & Harro Wimmel

  2. Abteilung Sichere und Zuverlässige Softwaresysteme, Institut für Formale Methoden der Informatik, D-70569 Universität Stuttgart,  

    Javier Esparza

  3. Institut für Informatik, D-18051 Universität Rostock,  

    Karsten Wolf

Authors
  1. Eike Best
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Javier Esparza
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Harro Wimmel
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Karsten Wolf
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Irina Virbitskaite Andrei Voronkov

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Best, E., Esparza, J., Wimmel, H., Wolf, K. (2007). Separability in Conflict-Free Petri Nets. In: Virbitskaite, I., Voronkov, A. (eds) Perspectives of Systems Informatics. PSI 2006. Lecture Notes in Computer Science, vol 4378. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-70881-0_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-70881-0_1

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-70880-3

  • Online ISBN: 978-3-540-70881-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation