Skip to main content
SpringerLink
Log in

Logical Reasoning and Petri Nets

  • Conference paper
  • First Online:
Applications and Theory of Petri Nets 2003 (ICATPN 2003)

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

Included in the following conference series:

Abstract

The main result of the paper states that a set F of propositional-logic formulas is contradictory iff in all net representations of F the empty marking is reproducible.

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. J. Ezpeleta, J. M. Couvreur and M. Silva. A new technique for finding a generating family of siphons, traps and st-components. Application to colored Petri Nets. Lecture Notes in Computer Science; Advances in Petri Nets 1993, 674:126–147, 1993.

    Google Scholar 

  2. J.H. Gallier. Logic for Computer Science: Foundations of Automated Theorem Proving. Wiley, 1987.

    Google Scholar 

  3. H. J. Genrich and G. Thieler-Mevissen. The Calculus of Facts. Mazurkiewicz, Mathematical Foundations of Computer Science 1976, Lecture Notes in Computer Science 45, S. 588–595. Springer, 1976.

    Google Scholar 

  4. K. Lautenbach. Reproducibility of the Empty Marking. Javier Esparza and Charles Lakos, Applications and Theory of Petri Nets 2002, 23rd International Conference, ICATPN 2002, Adelaide, Australia, June 24–30, 2002, Proceedings, Band 2360 von Lecture Notes in Computer Science, S. 237–253. Springer, 2002.

    Google Scholar 

  5. Tadao Murata. Petri Nets: Properties, Analysis and Applications. Proceedings of the IEEE, S. 541–580, April 1989.

    Google Scholar 

  6. G. Peterka and Tadao Murata. Proof Procedure and Answer Extraction in Petri Net Model of Logic Programs. IEEE Trans. Software Eng., 15(2):209–217, 1989.

    Article  MATH  MathSciNet  Google Scholar 

  7. W. Reisig. Petri Nets., Band 4. Springer-Verlag EATCS Monographs on Theoretical Computer Science, 1985.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Koblenz-Landau, Universitätsstr. 1, 56075, Koblenz, Germany

    Kurt Lautenbach

Authors
  1. Kurt Lautenbach
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Technology and Management, Eindhoven University of Technology, P.O. Box 513, 5600 MB, Eindhoven, The Netherlands

    Wil M. P. van der Aalst

  2. Computer Science Department Parallel Systems Group, University of Oldenburg, 26111, Oldenburg, Germany

    Eike Best

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lautenbach, K. (2003). Logical Reasoning and Petri Nets. In: van der Aalst, W.M.P., Best, E. (eds) Applications and Theory of Petri Nets 2003. ICATPN 2003. Lecture Notes in Computer Science, vol 2679. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44919-1_19

Download citation

  • DOI: https://doi.org/10.1007/3-540-44919-1_19

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40334-0

  • Online ISBN: 978-3-540-44919-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation