Bounded Reachability Problems are Decidable in FIFO Machines

05/14/2021
by   Benedikt Bollig, et al.
0

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.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

08/20/2019

Verification of Flat FIFO Systems

The decidability and complexity of reachability problems and model-check...
07/10/2020

On flat lossy channel machines

We show that reachability, repeated reachability, nontermination and unb...
11/11/2020

The complexity of bounded context switching with dynamic thread creation

Dynamic networks of concurrent pushdown systems (DCPS) are a theoretical...
06/16/2020

On the Decidability of Reachability in Continuous Time Linear Time-Invariant Systems

We consider the decidability of state-to-state reachability in linear ti...
06/25/2021

Decomposition of transition systems into sets of synchronizing state machines

Transition systems (TS) and Petri nets (PN) are important models of comp...
03/31/2020

Verification of Nonblockingness in Bounded Petri Nets: A Novel Semi-Structural Approach

This paper proposes a semi-structural approach to verify the nonblocking...
01/27/2020

On the Flatness of Immediate Observation Petri Nets

In a previous paper we introduced immediate observation (IO) Petri nets,...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.