The Well Structured Problem for Presburger Counter Machines

10/07/2019
by   Alain Finkel, et al.
0

We introduce the well structured problem as the question of whether a model (here a counter machine) is well structured (here for the usual ordering on integers). We show that it is undecidable for most of the (Presburger-defined) counter machines except for Affine VASS of dimension one. However, the strong well structured problem is decidable for all Presburger counter machines. While Affine VASS of dimension one are not, in general, well structured, we give an algorithm that computes the set of predecessors of a configuration; as a consequence this allows to decide the well structured problem for 1-Affine VASS.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

09/26/2019

Affine Extensions of Integer Vector Addition Systems with States

We study the reachability problem for affine Z-VASS, which are integer v...
04/15/2020

On the Linguistic Capacity of Real-Time Counter Automata

Counter machines have achieved a newfound relevance to the field of natu...
08/05/2020

On Decidability of 2-process Affine Models

An affine model of computation is defined as a subset of iterated immedi...
04/14/2020

Squares: A Fast Counter-Based RNG

In this article, we present a new counter-based random number generator ...
04/10/2018

Counter Machines and Distributed Automata: A Story about Exchanging Space and Time

We prove the equivalence of two classes of counter machines and one clas...
07/21/2020

Universality Problem for Unambiguous VASS

We study languages of unambiguous VASS, that is, Vector Addition Systems...
06/07/2021

Truthful allocation in graphs and hypergraphs

We study truthful mechanisms for allocation problems in graphs, both for...
This week in AI

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