%0 Book Section
%A De Nicola, Rocco
%A Iacobelli, Giulio
%A Tribastone, Mirco
%B Formal techniques for distributed objects, components, and systems
%D 2014
%F eprints:2212
%I Springer 
%N 8461
%P 216-231
%S Lecture Notes in Computer Science
%T Dimming relations for the efficient analysis of concurrent systems via action abstraction
%U http://eprints.imtlucca.it/2212/
%X We study models of concurrency based on labelled transition systems where abstractions are induced by a partition of the action set. We introduce dimming relations which are able to relate two models if they can mimic each other by using actions from the same partition block. Moreover, we discuss the necessary requirements for guaranteeing compositional verification. We show how our new relations and results can be exploited when seemingly heterogeneous systems exhibit analogous behaviours manifested via different actions. Dimming relations make the models more homogeneous by collapsing such distinct actions into the same partition block. With our examples, we show how these abstractions may considerably reduce the state-space size, in some cases from exponential to polynomial complexity.
%Z 34th IFIP WG 6.1 International Conference, FORTE 2014, Held as Part of the 9th International Federated Conference on Distributed Computing Techniques, DisCoTec 2014, Berlin, Germany, June 3-5, 2014. Proceedings