Skip to main content
SpringerLink
Log in

The analysis of concurrent logic control algorithms

  • Conference paper
  • First Online:
Fundamentals of Computation Theory (FCT 1987)

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

Included in the following conference series:

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Zakrevskii A.D., Vasiljonok V.K. The formal description of logic control algorithms for designing the discrete systems (Russian). — Elektronnoje modelirovanie, N4 (1984), vol.6, p.79–84.

    Google Scholar 

  2. Zakrevskii A.D. The execution of concurrent logic control algorithms on programmed logic arrays (Russian). — Avtomatica i telemekhanica, N7 (1983), p.116–123.

    Google Scholar 

  3. Cheremisinova L.D. The execution of concurrent discrete control algorithms by asynchronous automata (Russian). — Avtomatica i vychisliteljnaja technika, N2 (1985), p.65–69.

    Google Scholar 

  4. Zakrevskii A.D. Concurrent automaton (Russian). — Doklady AN BSSR, N8 (1984), vol.28, p.717–719.

    Google Scholar 

  5. Zakrevskii A.D. The elements of α-net theory (Russian). — In: Proektirovanie sistem logicheskogo upravlenija, Mn.: ITK AN BSSR, 1986, p.4–12.

    Google Scholar 

  6. Zakharov V.N. Automata with distributed memory (Russian). — M.: Energija, 1975, 136p.

    Google Scholar 

  7. Hack M. Analysis of production schemata by Petri nets. — Project MAC-TR-94. — 264p.

    Google Scholar 

  8. Zakrevskii A.D. The reduction method for verification of the correctness of concurrent logic control algorithms (Russian). — Doklady AN BSSR, N7 (1983), vol.27, p.617–619.

    Google Scholar 

  9. Tropashko V.V. The proveness of the hypothesis on full reducibility of α-nets (Russian). — In: Proektirovanie sistem logicheskogo upravlenija, Mn.: ITK AN BSSR, 1986, p.13–21.

    Google Scholar 

  10. Zakrevskii A.D. Block coding of partial states of automata, performing the concurrent logic control algorithms (Russian). — Jzvestija AN SSSR. Tekhnicheskaja kibernetica, N5 (1983), p.3–11.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Engineering Cybernetics, Minsk, SU

    A. D. Zakrevskii

Authors
  1. A. D. Zakrevskii
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Lothar Budach Rais Gatič Bukharajev Oleg Borisovič Lupanov

Rights and permissions

Reprints and permissions

Copyright information

© 1987 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zakrevskii, A.D. (1987). The analysis of concurrent logic control algorithms. In: Budach, L., Bukharajev, R.G., Lupanov, O.B. (eds) Fundamentals of Computation Theory. FCT 1987. Lecture Notes in Computer Science, vol 278. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-18740-5_109

Download citation

  • DOI: https://doi.org/10.1007/3-540-18740-5_109

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-18740-0

  • Online ISBN: 978-3-540-48138-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation