Bounded Context Switching for Valence Systems
Logic in Computer Science
2018-07-06 v4 Formal Languages and Automata Theory
Abstract
We study valence systems, finite-control programs over infinite-state memories modeled in terms of graph monoids. Our contribution is a notion of bounded context switching (BCS). Valence systems generalize pushdowns, concurrent pushdowns, and Petri nets. In these settings, our definition conservatively generalizes existing notions. The main finding is that reachability within a bounded number of context switches is in NP, independent of the memory (the graph monoid). Our proof is genuinely algebraic, and therefore contributes a new way to think about BCS. In addition, we exhibit a class of storage mechanisms for which BCS reachability belongs to P.
Cite
@article{arxiv.1803.09703,
title = {Bounded Context Switching for Valence Systems},
author = {Roland Meyer and Sebastian Muskalla and Georg Zetzsche},
journal= {arXiv preprint arXiv:1803.09703},
year = {2018}
}