Advertisement

Determining processes by violations

  • Horst Wedde
  • Józef Winkowski
Communications
Part of the Lecture Notes in Computer Science book series (LNCS, volume 53)

Keywords

Elementary Event Mutual Exclusion Undesirable Situation Case Graph Converse Mapping 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Genrich, H. J., Thieler-Mevissen, G., The Calculus of Facts. Lecture Notes in Comp. Science Vol.45 (1976), Springer, Berlin-Heidelberg-New YorkGoogle Scholar
  2. 2.
    Lautenbach, K., Wedde, H., Generating Control Mechanisms by Restrictions. Lecture Notes in Comp. Science Vol.45 (1976), Springer, Berlin-Heidelberg--New YorkGoogle Scholar
  3. 3.
    Petri, C. A., Interpretations of Net Theory. GMD-ISF, Internal Report 75-07 (1975)Google Scholar
  4. 4.
    Winkowski, J., Algebras of Arrays — A Tool to Deal with Concurrency. CC PAS Reports 287 (1977)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1977

Authors and Affiliations

  • Horst Wedde
    • 1
  • Józef Winkowski
    • 2
  1. 1.Gesellschaft fur Mathematik und DatenverarbeitungAugustin 1Germany
  2. 2.Instytut Podstaw Informatyki PANWarszawa, PKiNPoland

Personalised recommendations