Verification of Flat FIFO Systems
The decidability and complexity of reachability problems and model-checking for flat counter machines have been explored in detail. However, only few results are known for flat (lossy) FIFO machines, only in some particular cases (a single loop or a single bounded expression). We prove, by establish...
Tallennettuna:
| Päätekijät: | , |
|---|---|
| Aineistotyyppi: | Artigo |
| Kieli: | Inglês |
| Julkaistu: |
Logical Methods in Computer Science e.V.
2020-10-01
|
| Sarja: | Logical Methods in Computer Science |
| Aiheet: | |
| Linkit: | https://lmcs.episciences.org/5999/pdf |
| Tagit: |
Ei tageja, Lisää ensimmäinen tagi!
|