EXPSPACE-hardness of behavioural equivalences of succinct one-counter nets

01/03/2018
by   Petr Jancar, et al.
0

We note that the remarkable EXPSPACE-hardness result in [Göller, Haase, Ouaknine, Worrell, ICALP 2010] ([GHOW10] for short) allows us to answer an open complexity question for simulation preorder of succinct one counter nets (i.e., one counter automata with no zero tests where counter increments and decrements are integers written in binary). This problem, as well as bisimulation equivalence, turn out to be EXPSPACE-complete. The technique of [GHOW10] was referred to by Hunter [RP 2015] for deriving EXPSPACE-hardness of reachability games on succinct one-counter nets. We first give a direct self-contained EXPSPACE-hardness proof for such reachability games (by adjusting a known PSPACE-hardness proof for emptiness of alternating finite automata with one-letter alphabet); then we reduce reachability games to (bi)simulation games by using a standard "defender-choice" technique.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/26/2020

Countdown games, and simulation on (succinct) one-counter nets

We answer an open complexity question by Hofman, Lasota, Mayr, Totzke (L...
research
02/04/2023

Parameterized Verification under TSO with Data Types

We consider parameterized verification of systems executing according to...
research
01/28/2021

Continuous One-Counter Automata

We study the reachability problem for continuous one-counter automata, C...
research
09/20/2022

Intrinsic Simulations and Universality in Automata Networks

An automata network (AN) is a finite graph where each node holds a state...
research
03/08/2022

Lower Bounds for the Reachability Problem in Fixed Dimensional VASSes

We study the complexity of the reachability problem for Vector Addition ...
research
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...
research
11/11/2020

The complexity of bounded context switching with dynamic thread creation

Dynamic networks of concurrent pushdown systems (DCPS) are a theoretical...

Please sign up or login with your details

Forgot password? Click here to reset