Automated verification of automata communicating via FIFO and bag buffers

Lakhdar Akroun 1 Gwen Salaün 1
1 CONVECS - Construction of verified concurrent systems
Inria Grenoble - Rhône-Alpes, LIG - Laboratoire d'Informatique de Grenoble
Abstract : This article presents new results for the automated verification of automata communicating asynchronously via FIFO or bag buffers. The analysis of such systems is possible by comparing bounded asynchronous compositions using equivalence checking. When the composition exhibits the same behavior for a specific buffer bound, the behavior remains the same for larger bounds. This enables one to check temporal properties on the system for that bound and this ensures that the system will preserve them whatever larger bounds are used for buffers. In this article, we present several decidability results and a semi-algorithm for this problem considering FIFO and bag buffers, respectively, as communication model. We also study various equivalence notions used for comparing the bounded asynchronous systems.
Complete list of metadatas

Cited literature [48 references]  Display  Hide  Download

https://hal.inria.fr/hal-01898159
Contributor : Radu Mateescu <>
Submitted on : Thursday, October 18, 2018 - 10:01:57 AM
Last modification on : Saturday, December 15, 2018 - 1:50:11 AM
Long-term archiving on : Saturday, January 19, 2019 - 12:50:45 PM

File

main-fmsd.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Lakhdar Akroun, Gwen Salaün. Automated verification of automata communicating via FIFO and bag buffers. Formal Methods in System Design, Springer Verlag, 2018, 52 (3), pp.260 - 276. ⟨10.1007/s10703-017-0285-8⟩. ⟨hal-01898159⟩

Share

Metrics

Record views

167

Files downloads

142