Skip to main content

A Study of the Projection Operation

  • Conference paper
Book cover Application and Theory of Petri Nets

Part of the book series: Informatik-Fachberichte ((INFORMATIK,volume 52))

Abstract

By the projection of words or languages to a set of symbols the omission of all those ones not belonging to the given set is meant. This operation has a fundamental role in the algebraic representation of concurrent behaviour of sequential processes. Namely, permissible sequences of a superposed (merged) system of sequential components fin the sense of [43 and [8] have the characteristic property that when projecting one of them into any of the components the resulting sequence will also be a permissible one for that component.

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

Access this chapter

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.

References

  1. Györy,Gy .,Knuth,E.,Ronyai,L.s Grammatical projections. WP II/3, MTA SZTAKT, Budapest, 1979.

    Google Scholar 

  2. Janicki,R. s On atomic nets and concurrency relations. Lecture Notes in Computer Science, 88, 1979.

    Google Scholar 

  3. Jantzen,M.,Valk,R.: Formal properties of place/transition nets. Lecture Notes in Computer Science 84, 1979.

    Google Scholar 

  4. Lauer,P.E.,Shields,M.W.,Best,E.: On the design and certification of asynchronous systems of processes. Final report, ASM/45, University of Newcastle upon Tyne, 1978.

    Google Scholar 

  5. Mazurkiewicz,A.: Concurrent program schemes and their interpretations. Aarhus Workshop on Verification of Parallel Processes, 1977.

    Google Scholar 

  6. Petri,C.A.I Concurrency. Lecture Notes in Computer Science 84, 1979.

    Google Scholar 

  7. Shields,M.W.: Class of adequate path programs. ASM/42, University of Newcastle upon Tyne, 1978.

    Google Scholar 

  8. Kotov,V.E.: An algebra for parallelism based on Petri nets. Lecture Notes in Computer Science 64, 1978.

    Google Scholar 

  9. Knuth,E .i Petri nets and trace languages. First European Conf. on Parallel and Distributed Systems, Toulouse, 1979.

    Google Scholar 

  10. Janicki,R.I Synthesis of concurrent schemes. Lecture Notes in Computer Science 64, 1978.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1982 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Knuth, E., Györy, G., Ronyai, L. (1982). A Study of the Projection Operation. In: Girault, C., Reisig, W. (eds) Application and Theory of Petri Nets. Informatik-Fachberichte, vol 52. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-68353-4_35

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-68353-4_35

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-11189-4

  • Online ISBN: 978-3-642-68353-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics