Automated Analysis of Asynchronously Communicating Systems - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2016

Automated Analysis of Asynchronously Communicating Systems


Analyzing systems communicating asynchronously via reliable FIFO buffers is an undecidable problem. A typical approach is to check whether the system is bounded, and if not, the corresponding state space can be made finite by limiting the presence of communication cycles in behavioral models or by fixing the buffer size. In this paper, our focus is on systems that are likely to be unbounded and therefore result in infinite systems. We do not want to restrict the system by imposing any arbitrary bound. We introduce a notion of stability and prove that once the system is stable for a specific buffer bound, it remains stable whatever larger bounds are chosen for buffers. This enables one to check certain properties on the system for that bound and to ensure that the system will preserve them whatever larger bounds are used for buffers. We also prove that computing this bound is undecidable but we show how we succeed in computing these bounds for many examples using heuristics and equivalence checking.
Fichier principal
Vignette du fichier
Akroun-Salaun-Ye-16.pdf (513.36 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-01280164 , version 1 (09-05-2016)



Lakhdar Akroun, Gwen Salaün, Lina Ye. Automated Analysis of Asynchronously Communicating Systems. 23rd International SPIN symposium on Model Checking of Software, Apr 2016, Eindhoven, Netherlands. ⟨10.1007/978-3-319-32582-8_1⟩. ⟨hal-01280164⟩
953 View
164 Download



Gmail Mastodon Facebook X LinkedIn More