论文标题
在图形转换系统的框架中对不良条件进行建模
Modeling Adverse Conditions in the Framework of Graph Transformation Systems
论文作者
论文摘要
不利条件的概念解决了与对手环境相互作用的系统，并发现在开发新技术时也使用了使用。我们提出了一种通过图转换系统对不良条件进行建模的方法。与图形转换交互系统的其他方法相反，呈现的主要构造是图形转换系统。我们介绍了涉及系统，干扰环境以及对其相互作用建模的自动机的联合图转换系统。对于联合图转换系统，我们在不利条件下介绍了（部分）正确性的概念，其中包含系统的正确性和恢复条件。作为主要结果，我们表明了两个正确性的实例，即k-step正确性（环境干预后的大多数k步骤恢复）和最后一分钟的正确性（直到下一个环境干预恢复）在LTL（线性时间逻辑）中表达了表达，并且在CTL（计算树logic）中表达了k-step正确性的较弱的记录。
The concept of adverse conditions addresses systems interacting with an adversary environment and finds use also in the development of new technologies. We present an approach for modeling adverse conditions by graph transformation systems. In contrast to other approaches for graph-transformational interacting systems, the presented main constructs are graph transformation systems. We introduce joint graph transformation systems which involve a system, an interfering environment, and an automaton modeling their interaction. For joint graph transformation systems, we introduce notions of (partial) correctness under adverse conditions, which contain the correctness of the system and a recovery condition. As main result, we show that two instances of correctness, namely k-step correctness (recovery in at most k steps after an environment intervention) and last-minute correctness (recovery until next environment intervention) are expressible in LTL (linear temporal logic), and that a weaker notion of k-step correctness is expressible in CTL (computation tree logic).
