Skip to main content
SpringerLink
Log in

On the relation between firing sequences and processes of Petri nets

  • Communications
  • Conference paper
  • First Online:
Fundamentals of Computation Theory (FCT 1993)

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

Included in the following conference series:

  • 127 Accesses

Abstract

The present paper shows how an equivalence relation on the set of firing sequences of general nets, which have the same set of processes, should be defined. Using this results a construction of a 1-safe Petri net from any net with finite capacities is given, and it preservers, in a certain sense, the set of processes. Some regular properties of the set of processes of bounded nets are obtained.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. E.Best: Concurrent behaviour: sequences, processes and axioms. LNCS 197, 221–245(1984)

    Google Scholar 

  2. E.Best and C.Fernandez: Non-sequential processes. A Petri net view. Springer-Verlag 1988

    Google Scholar 

  3. E.Best and C.Fernandez: Notation and Terminology on Petri net theory. Arbeitspapiere der GMD 195(March 1987)

    Google Scholar 

  4. U.Golst and W.Reisig: The non-sequential behaviour of Petri nets. Information and Control 57 No. 2–3(1983),125–147

    Article  Google Scholar 

  5. D.V. Hung and E. Knuth: Semi-commmutations and Petri nets. Theoretical Computer Science 64(1989), 67–81

    Article  Google Scholar 

  6. Kamal Lodaya, Madhavan Mukund, R Ramanujiam and P.S. Thiagarajian: Models and Logic for true concurrency. Sadhana 17, Part 1, (March 1992),131–165

    Google Scholar 

  7. A.Mazurkiewicz: Concurrent Program Schemes and their Interpretation. Arhus University, Computer Science Department, DAIMI PB-78(July 1977)

    Google Scholar 

  8. W.Reizig: On the semantics of Petri nets. Bericht 100, FB Informatik. University of Hamburg (1984)

    Google Scholar 

  9. W. Zielonka: Notes on finite asynchronous automata. Theoret. Informat. and Appl. 21(1987), 99–135

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Informatics, National Centre for Scientific Research of Vietnam, Vietnam

    Dang Van Hung & Tran Van Dung

Authors
  1. Dang Van Hung
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Tran Van Dung
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Zoltán Ésik

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Van Hung, D., Van Dung, T. (1993). On the relation between firing sequences and processes of Petri nets. In: Ésik, Z. (eds) Fundamentals of Computation Theory. FCT 1993. Lecture Notes in Computer Science, vol 710. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57163-9_26

Download citation

  • DOI: https://doi.org/10.1007/3-540-57163-9_26

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57163-6

  • Online ISBN: 978-3-540-47923-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation