Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
SpringerLink
Log in

On the Semantics of Place/Transition Nets

  • Conference paper
  • First Online:
CONCUR’99 Concurrency Theory (CONCUR 1999)

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

Included in the following conference series:

Abstract

We present several interpretations of the behavior of P/T nets in terms of traces, event structures, and partial orders. Starting from results of Hoogers, Kleijn and Thiagarajan, we show how Petri nets determine local trace languages; these may be represented by local event structures in many ways, each method leading to a particular coreflection. One of these semantics is finally proved to be appropriate for the construction of a behavior preserving unfolding of Petri nets.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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.

Similar content being viewed by others

References

  1. Badouel E., Bernardinello L., Darondeau Ph.: Polynomial algorithms for the synthesis of bounded nets. CAAP, LNCS 915 (1995) 647–679

    Google Scholar 

  2. Droste M.: Event structures and domains. TCS 68 (1989) 37–47

    Article  MATH  MathSciNet  Google Scholar 

  3. Engelfriet J.: Branching processes of Petri nets. Act. Inf. 28 (1991) 575–591

    Article  MATH  MathSciNet  Google Scholar 

  4. Esparza J.: Model Checking Using Net Unfoldings. LNCS 668 (1993) 613–628

    Google Scholar 

  5. Van Glabbeek R. J., Plotkin G. D.: Configuration Structures. LICS 95 (1995) 199–209

    Google Scholar 

  6. Hoogers P. W.: Behavioural aspects of Petri nets. Thesis, av. at ftp://ftp.wi.leidenuniv.nl/pub/CS/PhDTheses/hoogers-94.ps.gz (Leiden University, 1994)

    Google Scholar 

  7. Hoogers P. W., Kleijn H. C. M., Thiagarajan P. S.: A Trace Semantics for Petri Nets. Information and Computation 117 (1995) 98–114

    Article  MATH  MathSciNet  Google Scholar 

  8. Hoogers P. W., Kleijn H. C. M., Thiagarajan P. S.: An Event Structure Semantics for General Petri Nets. Theoretical Computer Science 153 (1996) 129–170

    Article  MATH  MathSciNet  Google Scholar 

  9. Janicki R., Koutny M.: Semantics of inhibitors nets. Inf. and Comp. 123 (1995) 1–15

    Article  MATH  MathSciNet  Google Scholar 

  10. Kleijn H. C. M., Morin R., Rozoy B.: Event Structures for Local Traces. Electronic Notes in Theoretical Computer Science 16-2 (1998)-16 p.

    Google Scholar 

  11. Kleijn H. C. M., Morin R., Rozoy B.: Categorical Connections between Local Event Structures and Local Traces. Technical Report 99-01, Univ. Leiden (1999)-10 p.

    Google Scholar 

  12. MacMillan K. L.: Using unfoldings to avoid the state explosion problem in the verification of asynchronous circuits. CAV’92, LNCS 663 (1992) 165–177

    Google Scholar 

  13. Mazurkiewicz A.: Concurrent program schemes and their interpretations. Aarhus University Publication (DAIMI PB-78, 1977)

    Google Scholar 

  14. Meseguer J., Montanari U., Sassone V.: On the Semantics of Petri Nets. Concur’92, LNCS 630 (1992) 286–301

    Chapter  Google Scholar 

  15. Montanari U., Rossi F.: Contextual nets. Act. Inf. 36 (1995) 545–596

    MathSciNet  Google Scholar 

  16. Mukund M.: Petri Nets and Step Transition Systems. International Journal of Foundations of Computer Science 3 (1992) 443–478

    Article  MATH  MathSciNet  Google Scholar 

  17. Nielsen M., Plotkin G., Winskel G.: Petri nets, events structures and domains, Part I. Theoretical Computer Science 13 (1981) 85–108

    Article  MATH  MathSciNet  Google Scholar 

  18. Nielsen M., Sassone V., Winskel G.: Relationships between Models of Concurrency. LNCS 803 (1994) 425–475

    Google Scholar 

  19. Pierce B. C.: Category Theory for Computer Scientists. (The MIT Press, 1991)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. L.R.I., Bât. 490, Université de Paris Sud, 91405, Orsay Cedex, France

    Rémi Morin & Brigitte Rozoy

Authors
  1. Rémi Morin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Brigitte Rozoy
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computing Science, Eindhoven University of Technology, P.O. Box 513, 5600 MB, Eindhoven, The Netherlands

    Jos C. M. Baeten  & Sjouke Mauw  & 

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Morin, R., Rozoy, B. (1999). On the Semantics of Place/Transition Nets. In: Baeten, J.C.M., Mauw, S. (eds) CONCUR’99 Concurrency Theory. CONCUR 1999. Lecture Notes in Computer Science, vol 1664. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48320-9_31

Download citation

  • DOI: https://doi.org/10.1007/3-540-48320-9_31

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation