A remark on equivalence of Mazurkiewicz's finite — control algorithms over nets

  • M. Grabowski
Part of the Lecture Notes in Computer Science book series (LNCS, volume 45)


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    de Bakker I.W. and de Roever W.P., A calculus for recursive program schemes, Proc.IRIA Symp. on Automata Formal Languages and Programming 1972, North-Holland, AmsterdamGoogle Scholar
  2. [2]
    Blikle A., Nets; complete lattices with a composition, Bull. Acad.Polon. Sci.,Sér.Sci.Math.Astr.Phys.19,859–863,1971Google Scholar
  3. [3]
    Blikle A., An extended approach to mathematical analysis of programs, CC PAS Reports 169,1974Google Scholar
  4. [4]
    Griffith T.V., The unsolvability of the equivalence problem for -free nondeterministic generalized machines, Journal of ACM, vol15, No3,pp.409–413.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1976

Authors and Affiliations

  • M. Grabowski
    • 1
  1. 1.Warsaw UniwersityPoland

Personalised recommendations