Abstract
Under study is one of the mathematical models of parallel computational processes, i.e., an asynchronous transition system. Some methods are proposed for calculating the homology groups and the Poincaré polynomial of a finite asynchronous transition system. Conditions are obtained for the decomposability of an asynchronous transition system as a parallel product.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
E. Goubault, The Geometry of Concurrency, PhD Thesis (Ecole Normale Supérieure, 1995) (see also http://www.di.ens.fr/%7Egoubault/GOUBAULTpapers.html).
P. Gaucher, “About the Globular Homology of Higher Dimensional Automata,” Cahiers Topologie Geom. Differentielle Categ. 43(2), 107–156 (2002).
A. A. Khusainov and V. V. Tkachenko, “Homology Groups of Asynchronous Transition Systems,” in Mathematical Modeling and Adjoining Mathematical Problems (Khabarovsk. Gos. Pedagog. Univ., Khabarovsk, 2003), pp. 23–33.
A. A. Khusainov and V. V. Tkachenko, “About Homology Groups of Asynchronous Transition Systems,” Dal’nevostochnyi Mat. Zh. 6(1–2), 23–38 (2005).
U. Fahrenberg, “A Category of Higher-Dimensional Automata,” in Lecture Notes in Mathematical Science, Vol. 3441: Foundation of Software Science and Computational Structures (Springer, Berlin, 2005), pp. 187–201 (see also http://www.cs.aau.dk/uli/Test/Research/2005/fahrenberg05-hda.pdf).
G. Winskel and M. Nielsen, “Models for Concurrency,” in Handbook of Logic in Computer Science, Vol. 4 (Univ. Press, Oxford, 1995), pp. 1–148.
A. Husainov, “On the Homology of Small Categories and Asynchronous Transition Systems,” Homology Homotopy Appl. 6(1), 439–471 (2004) (see also http://www.rmi.acnet.ge/hha).
L. Yu. Polyakova, “Resolutions for Free Partially Commutative Monoids,” Sibirsk. Mat. Zh. 48(6), 1295–1304 (2007) [SiberianMath, J. 48 (6), 1038–1045 (2007)].
A. A. Husainov, On the Cubical Homology Groups of Free Partially Commutative Monoids, Preprint (Cornell Univ., New York, 2006) (see also http://www.arxiv.org/abs/math.CT/0611011).
G. Havas and B. S. Majewski, “Integer Matrix Diogonalization,” J. Symbolic Comput. 24(3/4), 399–408 (1997).
V. Diekert and Y. Métivier, “Partial Commutation and Traces,” in Handbook of Formal Languages, Vol. 3 (Springer, New York, 1997), pp. 457–533.
R. Morin, “Decompositions of Asynchronous Systems,” in Lecture Notes in Computer Science, Vol. 1466: 9 International Conference on Concurrency Theory (CONCUR’98), Ed. by D. Sangiorgi and R. de Simone, (Springer, London, 1998), pp. 549–564.
Author information
Authors and Affiliations
Corresponding author
Additional information
Original Russian Text © A.A. Khusainov, V.E. Lopatkin, I.A. Treshchev, 2008, published in Sibirskii Zhurnal Industrial’noi Matematiki, 2008, Vol. XI, No. 1, pp. 141–151.
Rights and permissions
About this article
Cite this article
Khusainov, A.A., Lopatkin, V.E. & Treshchev, I.A. Studying a mathematical model of parallel computation by algebraic topology methods. J. Appl. Ind. Math. 3, 353–363 (2009). https://doi.org/10.1134/S1990478909030053
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S1990478909030053