The paper is devoted to a mathematical model of concurrency the special case of which is asynchronous system. Distributed asynchronous automata are introduced here. It is proved that the Petri nets and transition systems with independence can be considered like the distributed asynchronous automata. Time distributed asynchronous automata are defined in standard way by the map which assigns time intervals to events. It is proved that the time distributed asynchronous automata are generalized the time Petri nets and asynchronous systems.

The aim of this paper is to investigate the homology groups of mathematical models of concurrency. We study the Baues-Wirsching homology groups of a small category associated with a partial monoid action on a set. We prove that these groups can be reduced to the Leech homology groups of the monoid. For a trace monoid with an action on a set, we will build a cubical complex of free Abelian groups with homology groups isomorphic to the integral homology groups of the action category. It allows us to solve the problem posed by the author in 2004 of the constructing an algorithm for computing homology groups of the CE nets. We describe the algorithm and give examples of calculating the homology groups.

The paper is devoted to homology groups of cubical sets with coefficients in contravariant systems of Abelian groups. The study is based on the proof of the assertion that the homology groups of the category of cubes with coefficients in the diagram of Abelian groups are isomorphic to the homology groups of normalized complex of the cubical Abelian group corresponding to this diagram. The main result shows that the homology groups of a cubical set with coefficients in a contravariant system of Abelian groups are isomorphic to the values of left derived functors of the colimit functor on this contravariant system. This is used to obtain the isomorphism criterion for homology groups of cubical sets with coefficients in contravariant systems, and also to construct spectral sequences for the covering of a cubical set and for a morphism between cubical sets.

The paper consider a mathematical model of a concurrent system, the special case of which is an asynchronous system. Distributed asynchronous automata are introduced here. It is proved that Petri nets and transition systems with independence can be considered as distributed asynchronous automata. Time distributed asynchronous automata are defined in a standard way by correspondence which relates events with time intervals. It is proved that the time distributed asynchronous automata generalize time Petri nets and asynchronous systems.

No abstract