Name
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. |
Year | DOI | Venue |
|---|---|---|
2018 | https://doi.org/10.1007/s10703-017-0285-8 | Formal Methods in System Design |
Keywords | Field | DocType |
Labeled transition systems,Asynchronous communication,Equivalence checking | Formal equivalence checking,Asynchronous communication,FIFO (computing and electronics),Computer science,Automaton,Decidability,Theoretical computer science,Models of communication,Equivalence (measure theory),Bounded function,Distributed computing | Journal |
Volume | Issue | ISSN |
52 | 3 | 0925-9856 |
Citations | PageRank | References |
0 | 0.34 | 35 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Lakhdar Akroun | 1 | 6 | 1.46 |
| Gwen Salaün | 2 | 988 | 71.03 |