This is a preview of subscription content, log in via an institution to check access.
References
G. E. Tseitlin, “The problem of identical transformations of structured program schemas with closed logical conditions, parts 1–3”, Kibernetika, No. 3, 50–57, No. 4, 1–18 (1978), No. 5, 44–51 (1979).
V. M. Glushkov, G. E. Tseitlin, and E. L. Yushchenko, Algebra, Languages, and Programming [in Russian], Naukova Dumka, Kiev (1989).
V. P. Panfilenko, “Closed logical conditions in systems of algorithmic algebras”, in: Knowledge Representation in Information Technologies [in Russian], Inst. Kibern. Akad. Nauk UkrSSR, Kiev (1993), p. 13–21.
V. P. Panfilenko, “Classification of deadlocks in parallel regular program schemas,” in: Software and Algorithms for Solving Problems of Applied Mathematics [in Russian], Inst. Kibern. Akad. Nauk UkrSSR, Kiev (1993), p. 81–87.
V. P. Panfilenko, Deadlock and Fictitiousness in Parallel Program Specifications [in Russian], preprint 93-1, Inst. Kibern. Akad. Nauk UkrSSR, Kiev (1993).
V. P. Panfilenko, “An algorithm for deadlock and fictitiousness detection in parallel regular program schemas,” in: Algebraic and Logical Methods of Construction of Software Systems [in Russian], Inst. Kibern. Akad. Nauk UkrSSR, Kiev (1993).
Additional information
Translated from Kibernetika i Sistemnyi Analiz, No. 5, pp. 142–152, Septembe–October, 1994.
Rights and permissions
About this article
Cite this article
Panfilenko, V.P. Deadlock and fictitiousness problem in parallel program specifications. Cybern Syst Anal 30, 755–762 (1994). https://doi.org/10.1007/BF02367758
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02367758