%0 Book Section
%A Aceto, Luca
%A Fantechi, Alessandro
%A De Nicola, Rocco
%B Mathematical Models for the Semantics of Parallelism
%D 1986
%E Venturini Zilli, Marisa
%F eprints:388
%I Springer
%P 1-20
%S Lecture Notes in Computer Science
%T Testing Equivalences for Event Structures
%U http://eprints.imtlucca.it/388/
%V 280
%X A flexible abstraction mechanism for models of concurrency, which allows systems which "look the same" to be considered equivalent, is proposed. Using three classes of atomic observations (sequences of actions, sequences of multisets of actions and partial orderings of actions) different information on the causal and temporal structure of Event Structures, a basic model of parallelism, is captured. As a result, three different semantic models for concurrent systems are obtained. These models can be used as the basis for defining interleaving, multisets or partial ordering semantics of concurrent systems. The common framework used to define the models allows us to study the relationship between these three traditional approaches to the semantics of concurrent communicating systems.