De Nicola, Rocco and Iacobelli, Giulio and Tribastone, Mirco Dimming relations for the efficient analysis of concurrent systems via action abstraction. In: Formal techniques for distributed objects, components, and systems. Lecture Notes in Computer Science (8461). Springer , pp. 216-231. ISBN 978-3-662-43612-7 (2014)Full text not available from this repository.
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.
|Item Type:||Book Section|
|Additional Information:||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|
|Subjects:||Q Science > QA Mathematics > QA75 Electronic computers. Computer science|
|Research Area:||Computer Science and Applications|
|Depositing User:||Ms T. Iannizzi|
|Date Deposited:||27 Jun 2014 12:18|
|Last Modified:||06 Feb 2015 10:07|
Actions (login required)