The process algebra tock-CSP provides textual notations for modelling discrete-time behaviours, with the support of various tools for verification. Similarly, automatic verification of Timed Automata (TA) is supported by the real-time verification toolbox UPPAAL. TA and tock-CSP differ in both modelling and verification approaches. For instance, liveness requirements are difficult to specify with the constructs of tock-CSP, but they are easy to verify in UPPAAL. In this work, we translate tock-CSP into TA to take advantage of UPPAAL. We have developed a translation technique and tool; our work uses rules for translating tock-CSP into a network of small TA, which address the complexity of capturing the compositionality of tock-CSP . For validation, we use an experimental approach based on finite approximations to trace sets. We plan to use mathematical proof to establish the correctness of the rules that will cover an infinite set of traces.

中文翻译：

---

tock-CSP 到定时自动机的自动翻译

过程代数 tock-CSP 提供用于建模离散时间行为的文本符号，并支持各种验证工具。同样，实时验证工具箱 UPPAAL 支持定时自动机 (TA) 的自动验证。TA 和 tock-CSP 在建模和验证方法上有所不同。例如，活性要求很难用 tock-CSP 的构造来指定，但它们很容易在 UPPAAL 中验证。在这项工作中，我们将 tock-CSP 转换为 TA 以利用 UPPAAL。我们开发了一种翻译技术和工具；我们的工作使用规则将 tock-CSP 转换为小型 TA 网络，这解决了捕获 tock-CSP 组合性的复杂性。为了验证，我们使用基于对迹集的有限近似的实验方法。