Skip to main content
Springer Nature Link
Log in

Algebraic characterization of petri net pomset semantics

  • Contributions
  • Conference paper
  • First Online:
CONCUR '97: Concurrency Theory (CONCUR 1997)

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

Included in the following conference series:

  • 126 Accesses

Abstract

Sets of pomsets are frequently used as a true-concurrency, linear-time semantics of Petri nets. For a Petri net N, let P(N), a set of pomsets, denote the pomset behaviour of N, and let P:=P(N)|N is a Petri net} denote the class of pomset behaviours of Petri nets, a generalization of L, the class of all Petri net languages. We present here an algebraic characterization for P, similar to the known algebraic characterizations for L.

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.

Similar content being viewed by others

References

  1. E. Best, C. Fernandéz, “Nonsequential Processes: A Petri Net View”, Monographs on Theoretical Computer Science Vol. 13, Springer Verlag, 1988.

    Google Scholar 

  2. J.W. de Bakker, J.H.A. Warmerdam, “Metric Pomset Semantics for a Concurrent Language with Recursion”, Lecture Notes in Computer Science Vol. 469, Springer Verlag, 1990.

    Google Scholar 

  3. P. Degano, J. Meseguer, U. Montanari, “Axiomatizing the algebra of net computations and processes”, Acta Informatica 33, pp. 641–667, 1996.

    Google Scholar 

  4. J. Esparza, “More infinite results”, Proceedings of INFINITY, First International Workshop on Verification of Infinite State Systems, pp.4–20, 1996.

    Google Scholar 

  5. S.A. Greibach, “Remarks on Blind and Partially Blind One-Way Multicounter Machines”, Theoretical Computer Science Vol. 7, pp. 311–324, 1978.

    Google Scholar 

  6. M. Hack, “Petri Net Languages”, Computation Structures Group Memo 124, Project MAC, M.I.T., 1975.

    Google Scholar 

  7. M. Jantzen, “Language Theory of Petri Nets”, Lecture Notes in Computer Science Vol. 254, pp. 397–412, Springer Verlag, 1987.

    Google Scholar 

  8. J. Meseguer, U. Montanari, V. Sassone, “Process versus unfolding semantics for Place/Transition Petri nets”, Theoretical Computer Science Vol. 153, pp. 171–210, 1996.

    Google Scholar 

  9. M. Nielsen, L. Priese, V. Sassone, “Characterizing Behavioural Congruences for Petri Nets”, Lecture Notes in Computer Science Vol. 962, Proceedings CONCUR '95, eds. I. Lee, S. Smolka, pp. 175–189, 1995.

    Google Scholar 

  10. J.L. Peterson, “Petri Nets”, Computing Surveys Vol. 9, No. 3, pp. 223–252, 1977.

    Article  Google Scholar 

  11. L. Pomello, G. Rozenberg, C. Simone, “A Survey of Equivalence Notions for Net Based Systems”, Lecture Notes in Computer Science Vol. 609, pp. 410–472, 1992.

    Google Scholar 

  12. L. Priese, H. Wimmel, “A Uniform Approach to True-Concurrency and Interleaving Semantics for Petri Nets”, to appear in Theoretical Computer Science.

    Google Scholar 

  13. L. Priese, H. Wimmel, “An Application of Compositional Petri Net Semantics”, Technical Report, Fachberichte Informatik 14/96, Institut für Informatik, Fachbereich Informatik, Universität Koblenz

    Google Scholar 

  14. W. Vogler, “Partial Words versus Processes: A Short Comparison”, Lecture Notes in Computer Science Vol. 609, pp. 292–303, 1992.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Universität Koblenz-Landau, D-56075, Koblenz, Germany

    Harro Wimmel & Lutz Priese

Authors
  1. Harro Wimmel
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Lutz Priese
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Antoni Mazurkiewicz Józef Winkowski

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wimmel, H., Priese, L. (1997). Algebraic characterization of petri net pomset semantics. In: Mazurkiewicz, A., Winkowski, J. (eds) CONCUR '97: Concurrency Theory. CONCUR 1997. Lecture Notes in Computer Science, vol 1243. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63141-0_28

Download citation

  • DOI: https://doi.org/10.1007/3-540-63141-0_28

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63141-5

  • Online ISBN: 978-3-540-69188-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation