TY  - CHAP
ID  - eprints2212
N1  - 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
EP  - 231
T2  - Formal techniques for distributed objects, components, and systems
Y1  - 2014///
AV  - none
TI  - Dimming relations for the efficient analysis of concurrent systems via action abstraction
UR  - http://dx.doi.org/10.1007/978-3-662-43613-4_14
PB  - Springer 
SN  - 978-3-662-43612-7
A1  - De Nicola, Rocco
A1  - Iacobelli, Giulio
A1  - Tribastone, Mirco
T3  - Lecture Notes in Computer Science
N2  - 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.
SP  - 216
ER  -