Diploma. Dipartimento di Scienze dell'Informazione, Università degli Studi di Milano, Italy, 1990/91. In Italian.
Abstract: The aim of this thesis is to compare two formal models of concurrent systems, Finite Asynchronous Automata and Superposed Automata Net Systems, a class of Petri nets with modularity properties. The main result of this thesis consists in showing that the two models can be simulated one by the other. This is carried on by exhibiting a pair of reductions between them. Relations between asynchronous automata and elementary net systems are also discussed; it is shown that to each elementary net system one can associate an asynchronous automaton simulating it, while the converse is not true in the general case.
Keywords: finite asynchronous automata; superposed automata net; modularity; simulation; elementary net system.