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.
Type de document :
Communication dans un congrès
Erika Ábrahám; Catuscia Palamidessi. 34th Formal Techniques for Networked and Distributed Systems (FORTE), Jun 2014, Berlin, Germany. Springer, Lecture Notes in Computer Science, LNCS-8461, pp.216-231, 2014, Formal Techniques for Distributed Objects, Components, and Systems. 〈10.1007/978-3-662-43613-4_14〉
https://hal.inria.fr/hal-01398017
Contributeur : Hal Ifip
<>
Soumis le : mercredi 16 novembre 2016 - 15:37:58
Dernière modification le : mercredi 16 novembre 2016 - 16:23:24
Document(s) archivé(s) le : jeudi 16 mars 2017 - 16:44:26
Rocco Nicola, Giulio Iacobelli, Mirco Tribastone. Dimming Relations for the Efficient Analysis of Concurrent Systems via Action Abstraction. Erika Ábrahám; Catuscia Palamidessi. 34th Formal Techniques for Networked and Distributed Systems (FORTE), Jun 2014, Berlin, Germany. Springer, Lecture Notes in Computer Science, LNCS-8461, pp.216-231, 2014, Formal Techniques for Distributed Objects, Components, and Systems. 〈10.1007/978-3-662-43613-4_14〉. 〈hal-01398017〉
