Skip to Main content Skip to Navigation
Conference papers

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

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 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.
Complete list of metadata

Cited literature [21 references]  Display  Hide  Download
Contributor : Hal Ifip Connect in order to contact the contributor
Submitted on : Wednesday, November 16, 2016 - 3:37:58 PM
Last modification on : Saturday, June 8, 2019 - 2:20:03 PM
Long-term archiving on: : Thursday, March 16, 2017 - 4:44:26 PM


Files produced by the author(s)


Distributed under a Creative Commons Attribution 4.0 International License



Rocco De Nicola, Giulio Iacobelli, Mirco Tribastone. Dimming Relations for the Efficient Analysis of Concurrent Systems via Action Abstraction. 34th Formal Techniques for Networked and Distributed Systems (FORTE), Jun 2014, Berlin, Germany. pp.216-231, ⟨10.1007/978-3-662-43613-4_14⟩. ⟨hal-01398017⟩



Record views


Files downloads