Concurrent programs

  • Andrzej Skowron
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 148)


Programming System Elementary Condition Maximal Chain Elementary Instruction Program Schema 
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. [ARN 80]
    Arnold A., Nivat M., Controlling behaviours of systems, some basic concepts and some applications, Lecture Notes in Comp. Sci.88, 1980, pp. 113–122Google Scholar
  2. [BED 77]
    Bednarek A.R., Ulam S.M., Some remarks on relational composition in computational theory and practice, Lecture Notes in Comp.Sci.56, 1977, pp. 22–32Google Scholar
  3. [BUR 80]
    Burkhard H.D., The maximum firing strategy in Petri nets gives more power, 3 th Conf.on Math.Problems of Comp.Sic., Zaborów, January 1980, ICS PAS Reports No 411,1980Google Scholar
  4. [DIJ 75]
    Dijkstra E.W., Guarded commands, non determinancy and formal derivation of programs, Comm.ACM, vol. 18, No 8, August 1979, pp. 453–457Google Scholar
  5. [HAC 76]
    Hack M., Decidability questions for Petri nets, Technical Report TR-161, Lab.for Comp.Sci. M.I.T., June 1976Google Scholar
  6. [GEN 80]
    Genrich H.J., Lautenbach K., Thiagarajan P.S., Substitution systems: a family of system models based on concurrency, Lectures Notes in Comp.Sci.,vol.88, 1980, pp.698–723Google Scholar
  7. [KAR 69]
    Karp R.M., Miller R.E., Parallel program schemata, J.Comp. Syst.Sci.vol.3, No2, 1969, pp, 147–195Google Scholar
  8. [KEL 72]
    Keller R.M., Vector replacement system: a formalism modeling asynchronous systems, Princeton University, Technical Report No 117, 1972Google Scholar
  9. [KOT 79]
    Kotov V.E., An integrated trigger function parallel system, Proc.of the 1st European Conf.on Parallel and Distributed Processing,Toulouse-France, February 14–16, 1979, pp. 191–197Google Scholar
  10. [MAZ 77]
    Mazurkiewicz A., Concurrent program schemes and their interpretations,DAIMI PB-78,Aarhus Univ.Publ.July, 1977Google Scholar
  11. [LAU 79]
    Lautenbach K., Thiagarajan P.S., Analysis of a resource allocation problem using Petri nets, Proc.of the 1st European Conf.on Parallel and Distributed Processing,Toulouse-France, February 14–16, 1979, pp. 260–266Google Scholar
  12. [MIL 78]
    Milner R., Algebras for communicating systems,Internal Report CSR-25-78, University of Edinburgh, June 1978Google Scholar
  13. [MÜL 79]
    Müldner T., On semantics of parallel programs, ICS PAS Reports No 348, 1979Google Scholar
  14. [PET 76]
    Petri C.A., Non-sequential processes, ISF GMD, Bonn 1976Google Scholar
  15. [PET 79]
    Petri C.A., Concurrency as basis of system thinking, Proc. 5th Scandinavian Logic Symposium, ed. Jensen, Mayoh and Möller, Aalborg Universitetsforlag 1979Google Scholar
  16. [SKO 80]
    Skowron A.,Concurrent programs /manuscript/Google Scholar
  17. [SUR 80]
    Suraj Z.,Optimal deadlock avoidance /manuscript/Google Scholar
  18. [WIN 80]
    Winkowski J., Towards an algebraic description of discrete processes and systems, ICS PAS No 408, 1980.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1983

Authors and Affiliations

  • Andrzej Skowron
    • 1
  1. 1.Institute of MathematicsWarsaw UniversityWarsaw

Personalised recommendations