Generalized Asynchronous Systems

TL;DR

This paper introduces a mathematical model for asynchronous systems, unifying Petri nets and transition systems with independence, and extends to time distributed automata, enhancing the understanding of concurrent asynchronous computations.

Contribution

It develops a generalized framework for asynchronous automata, including time aspects, unifying existing models like Petri nets and transition systems with independence.

Findings

Distributed asynchronous automata are introduced.

Petri nets and transition systems are shown to be special cases.

Time distributed asynchronous automata generalize time Petri nets.

Abstract

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.