An algebra for parallelism based on petri nets

  • V. E. Kotov
Invited Lectures
Part of the Lecture Notes in Computer Science book series (LNCS, volume 64)


Input Place Output Place Head Place Vector Addition System Minimal Enclosure 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Narinyani, A.S. Theory of parallel programming: Formal Models, Advances in Information Systems Sciences, 6, Plenum Press, New York, 1976.Google Scholar
  2. 2.
    Mazurkiewicz, A. Invariants of Concurrent Programs, Infopol Conference Proc., Warsaw, 1976.Google Scholar
  3. 3.
    Winkowski, T. On Algebraic Characterization of the Behavior of Non-Sequential Systems, Information Processing Letters, 6, No. 4, 1977, 105–109.CrossRefGoogle Scholar
  4. 4.
    Campbell, R.H., Habermann, A.N. The Specification of Process Synchronization by Path Expressions, Springer Lecture Notes on Computer Science, 16, Berlin, 1974.Google Scholar
  5. 5.
    Lauer, P.E., Campbell, R.H. Formal Semantics for a Class of High-level Primitives for Coordinating of Concurrent Processes, Acta Informatica, No. 5, 1975, 297–332.Google Scholar
  6. 6.
    Ledanois, P. Multilevel Description and Simulation of Parallel Cooperating Processes, Arbeitsberichte der IMMD, 9, 1977, 247–275.Google Scholar
  7. 7.
    Kotov, V.E. Concurrent Programming with Control Types, Quality Software, North-Hall. Publishing Co., Amsterdam, 1978.Google Scholar
  8. 8.
    Kotov, V.E., Narinyani, A.S. Asynchronous Computational Processes on Common Memory, Kibernetika, No. 3, Kiev, 1966 (in Russian).Google Scholar
  9. 9.
    Kotov, V.E. An Algebra of Regular Nets, Computing Center Reprint No 98, Novosibirsk, 1978 (in Russian).Google Scholar
  10. 10.
    Sacerdate, G.S., Tenney, R.I. The Decidability of the Reachability Problem for Vector Addition Systems, COINS Techn. Report FF-3, University of Massachusetts, 1977.Google Scholar
  11. 11.
    Dennis, T.B. Modular Asynchronous Control Structures for a High Performance Processor, Record of the Project MAC Conference on Concurrent Systems and Parallel Computation, ACM, N.Y., 1970, 55–80.Google Scholar
  12. 12.
    Dennis, T.B. Concurrency in Software Systems, Advanced Course in Software Engineering, Springer-Verlag, Berlin, 1973, 111–127.Google Scholar
  13. 13.
    Hack, M. Petri Net Languages, TR 159, MIT Lab. Computer Science, Cambridge, Mass., 1976.Google Scholar
  14. 14.
    Peterson, T.L. Computation Sequence Sets, J. Comput. System Science, 13, No. 1, 1976, 1–24.Google Scholar
  15. 15.
    Patil, S.S. Limitations and Capabilities of Dijkstra's Semaphore Primitives for Coordination among Processes, Computer Structures Group Memo 5F, MIT Project MAC, Cambridge, 1971.Google Scholar
  16. 16.
    Agerwala, T., Flynn, M. Comments on Capabilities, Limitations and Correctness of Petri Nets, Proc. 1st Annual Symp. Computer Architecture, ACM, N.Y., 1973, 81–86.Google Scholar
  17. 17.
    Peterson, T.L. Petri Nets, ACM Computing Surveys, 9, No. 3, 1977, 223–252CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1978

Authors and Affiliations

  • V. E. Kotov
    • 1
  1. 1.Computing CenterSiberian Branch of the USSR Academy of SciencesNovosibirskUSSR

Personalised recommendations