Skip to main content

Determining processes by violations

  • Communications
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1977 (MFCS 1977)

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

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Genrich, H. J., Thieler-Mevissen, G., The Calculus of Facts. Lecture Notes in Comp. Science Vol.45 (1976), Springer, Berlin-Heidelberg-New York

    Google Scholar 

  2. Lautenbach, K., Wedde, H., Generating Control Mechanisms by Restrictions. Lecture Notes in Comp. Science Vol.45 (1976), Springer, Berlin-Heidelberg--New York

    Google Scholar 

  3. Petri, C. A., Interpretations of Net Theory. GMD-ISF, Internal Report 75-07 (1975)

    Google Scholar 

  4. Winkowski, J., Algebras of Arrays — A Tool to Deal with Concurrency. CC PAS Reports 287 (1977)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Jozef Gruska

Rights and permissions

Reprints and permissions

Copyright information

© 1977 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wedde, H., Winkowski, J. (1977). Determining processes by violations. In: Gruska, J. (eds) Mathematical Foundations of Computer Science 1977. MFCS 1977. Lecture Notes in Computer Science, vol 53. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-08353-7_179

Download citation

  • DOI: https://doi.org/10.1007/3-540-08353-7_179

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-37285-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics