Logo eprints

Dimming Relations for the Efficient Analysis of Concurrent Systems via Action Abstraction

De Nicola, Rocco and Iacobelli, Giulio and Tribastone, Mirco Dimming Relations for the Efficient Analysis of Concurrent Systems via Action Abstraction. CSA Technical Report #9/2013 IMT Institute for Advanced Studies Lucca

[img]
Preview
PDF - Published Version
Download (725kB) | Preview

Abstract

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, i.e., notions of behavioural equivalence which are able to relate two models if they can match each other's actions whenever they are in the same partition block. We show applicability to a number of situations of practical interest which are apparently heterogeneous but exhibit similar behaviors although 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 permit reducing the state-space complexity from exponential to polynomial in the number of concurrent processes.

Item Type: Working Paper (CSA Technical Report)
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Research Area: Computer Science and Applications
Depositing User: Ms T. Iannizzi
Date Deposited: 09 Aug 2013 08:02
Last Modified: 06 Feb 2015 10:09
URI: http://eprints.imtlucca.it/id/eprint/1655

Actions (login required)

Edit Item Edit Item