Trace inclusion for one-counter nets revisited

Hofman, Piotr and Totzke, Patrick ORCID: 0000-0001-5274-8190 (2018) Trace inclusion for one-counter nets revisited. Theoretical Computer Science, 735. pp. 50-63.

Text
HT2017.pdf - Author Accepted Manuscript
Download (406kB) | Preview

Official URL: http://dx.doi.org/10.1016/j.tcs.2017.05.009

Abstract

One-counter nets (OCN) consist of a nondeterministic finite control and a single integer counter that cannot be fully tested for zero. They form a natural subclass of both One-Counter Automata, which allow zero-tests and Petri Nets/VASS, which allow multiple such weak counters. The trace inclusion problem has recently been shown to be undecidable for OCN. In this paper, we contrast the complexity of two natural restrictions which imply decidability. We show that trace inclusion between a OCN and a deterministic OCN is NL-complete, even with arbitrary binary-encoded initial counter-values as part of the input. Secondly, we show that the trace universality problem of nondeterministic OCN, which is equivalent to checking trace inclusion between a finite system and a OCN-process, is Ackermann-complete.

Item Type:	Article
Additional Information:	timestamp: Tue, 12 Jun 2018 01:00:00 +0200 biburl: https://dblp.org/rec/bib/journals/tcs/HofmanT18 bibsource: dblp computer science bibliography, https://dblp.org
Depositing User:	Symplectic Admin
Date Deposited:	08 Jul 2020 10:02
Last Modified:	28 Oct 2023 10:01
DOI:	10.1016/j.tcs.2017.05.009
Related URLs:	Publisher
URI:	https://livrepository.liverpool.ac.uk/id/eprint/3093260