Concurrency as a phenomenon is observed in most of the current computer science
trends. However the inherent complexity of analyzing the behavior of such a system
is incremented due to the many different models of concurrency, the variety of applications ...
In this thesis, two methods for automatic enumeration of permutation classes are studied.
The first method extends on the theory of combinatorial exploration. We review how combinatorial exploration works as a two phases process: the first phase ...