In this paper, we study the information system verification problem as a parameterized verification one. Informations systems are modeled as multi-parameterized systems in a formal language based on the Algebraic State-Transition Diagrams (ASTD) notation. Then, we use the Well Structured Transition Systems (WSTS) theory to solve the coverability problem for an unbounded ASTD state space. Moreover, we define a new framework to prove the effective pred-basis condition of WSTSs, i.e. the computability of a base of predecessors for every states.

中文翻译：

---

单调信息系统的参数化验证

在本文中，我们将信息系统验证问题作为参数化验证问题进行研究。信息系统被建模为基于代数状态转换图 (ASTD) 符号的形式语言中的多参数化系统。然后，我们使用结构良好的转换系统 (WSTS) 理论来解决无界 ASTD 状态空间的可覆盖性问题。此外，我们定义了一个新的框架来证明WSTSs 的有效的pred-basis 条件，即每个状态的pred-basis 的可计算性。