Scholarlink

<p>In this paper, a classical topic from computer science is reexamined from the perspective of modern control theory. Vector addition systems, first introduced in 1969, saw their first major results published in 1976. More recently, new developments have appeared in the computer science literature. Here, the authors study controllability, positive controllability, and reachability in detail, and establish necessary and sufficient conditions for each of these three concepts. While reachability has been the primary focus of the computer science works, those studies emphasize decidability-a topic not addressed in this paper. Instead, the main contribution of this work is the derivation of necessary and sufficient conditions for reachability expressed in terms of the system matrix.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

The Controllability of Vector Addition Systems

  • 期刊论文

  • 发表日期：

    2026年4月28日

查看全文
  • Xiaochang Wang,
  • Clyde Martin

摘要

In this paper, a classical topic from computer science is reexamined from the perspective of modern control theory. Vector addition systems, first introduced in 1969, saw their first major results published in 1976. More recently, new developments have appeared in the computer science literature. Here, the authors study controllability, positive controllability, and reachability in detail, and establish necessary and sufficient conditions for each of these three concepts. While reachability has been the primary focus of the computer science works, those studies emphasize decidability-a topic not addressed in this paper. Instead, the main contribution of this work is the derivation of necessary and sufficient conditions for reachability expressed in terms of the system matrix.