Verification of Flat FIFO Systems

Finkel, Alain; Praveen, M.

doi:10.4230/lipics.concur.2019.12

Cited by 1 publication

(6 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…k0 . Furthermore, we can modify gadgets for the clauses (see Figure 7) in order to have the following corollary, which improves a similar result for flat FIFO machines with multiple channels in [FP19].…”

Section: Fifo Machines With a Single Channelmentioning

confidence: 68%

Section: Reachability and Deadlockmentioning

confidence: 99%

“…In [FP19], it was shown that reachability reduces to control-state reachability for flat FIFO machines but the converse is not true. However, using the same reductions as in [FP19], we obtain the following results: Proposition 4.2. IB reachability is (a) recursively equivalent to IB control-state reachability for FIFO machines, and (b) recursively reducible to IB deadlock for FIFO machines.…”

Section: Reachability and Deadlockmentioning

confidence: 99%

“…This is proved by simulating 3-CNF formula with such machines. Our simulation follows the same ideas as the proof of NP-hardness for flat FIFO machines with multiple channels [EGM12,FP19], except that we use a unique channel.…”

Section: Fifo Machines With a Single Channelmentioning

confidence: 99%

“…Flat machines are another subclass of input-bounded machines in which the language of their control-graph, considered as a finite automaton, is a bounded language. For flat FIFO machines, control-state reachability is NP-complete [EGM12]; this result has recently been extended to reachability, channel unboundedness, and other classical properties [FP19].…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Bounded Reachability Problems are Decidable in FIFO Machines

Bollig¹,

Finkel²,

Suresh³

2022

Logical Methods in Computer Science

Self Cite

View full text Add to dashboard Cite

The undecidability of basic decision problems for general FIFO machines such as reachability and unboundedness is well-known. In this paper, we provide an underapproximation for the general model by considering only runs that are input-bounded (i.e. the sequence of messages sent through a particular channel belongs to a given bounded language). We prove, by reducing this model to a counter machine with restricted zero tests, that the rational-reachability problem (and by extension, control-state reachability, unboundedness, deadlock, etc.) is decidable. This class of machines subsumes input-letter-bounded machines, flat machines, linear FIFO nets, and monogeneous machines, for which some of these problems were already shown to be decidable. These theoretical results can form the foundations to build a tool to verify general FIFO machines based on the analysis of input-bounded machines.

show abstract

Section: Fifo Machines With a Single Channelmentioning

confidence: 68%

Section: Reachability and Deadlockmentioning

confidence: 99%