C. Ferretti
Learning parallel systems by regular trace languages.
Abstract
We study the problem of learning by examples
the structure of regular trace languages,
a useful formalization of systems or programs of concurrent operations.
Negative results are showed about traces with empty and total
concurrency, and we compare them with a positive result derived from a
work by N. Abe, about trace languages generated
by commutative regular languages.