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...
Main Authors: | Alain Finkel, M. Praveen |
---|---|
Format: | Article |
Language: | English |
Published: |
Logical Methods in Computer Science e.V.
2020-10-01
|
Series: | Logical Methods in Computer Science |
Subjects: | |
Online Access: | https://lmcs.episciences.org/5999/pdf |
Similar Items
-
Bounded Reachability Problems are Decidable in FIFO Machines
by: Benedikt Bollig, et al.
Published: (2022-01-01) -
Ambiguity of {\omega}-Languages of Turing Machines
by: Olivier Finkel
Published: (2014-08-01) -
Survey on Parameterized Verification with Threshold Automata and the Byzantine Model Checker
by: Igor Konnov, et al.
Published: (2023-01-01) -
Modeling and Verification of Infinite Systems with Resources
by: Martin Lang, et al.
Published: (2013-12-01) -
Specification and Verification of Timing Properties in Interoperable Medical Systems
by: Mahsa Zarneshan, et al.
Published: (2022-06-01)