Automated verification of automata communicating via FIFO and bag buffers - Archive ouverte HAL Access content directly
Journal Articles Formal Methods in System Design Year : 2018

Automated verification of automata communicating via FIFO and bag buffers

(1) , (1)
1

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.
Fichier principal
Vignette du fichier
main-fmsd.pdf (413.92 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01898159 , version 1 (18-10-2018)

Identifiers

Cite

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

Altmetric

Share

Gmail Facebook Twitter LinkedIn More