为了在计算机中实现模型的自动机表示，选用了PROLOG语言。
PROLOG language is selected in order to realize the automaton representation of model in computer.
简要介绍了有限精度时间自动机(FPTA)的基本概念，重点讨论FPTA状态中时钟的表示。
Introduces the notion of Finite Precision Timed Automata (FPTA) and focuses on the representation of clocks in a state.
本文中我们用自动机的方法表示了边界跟踪算法。
We formulate, in this paper, algorithms for boundary tracing based on automata.
这类系统通常用时间自动机来表示，而它们的性质则用时序逻辑公式表示。
The systems are usually described by the timed automata and the properties are specified by the temporal logic.
本文提出对称三值系统中的元胞自动机(CA -3)的特征化表示方法。
This paper characterizes symmetric ternary cellular automata (CA -3) with the help of matrix algebra.
本文提出对称三值系统中的元胞自动机(CA -3)的特征化表示方法。
This paper characterizes symmetric ternary cellular automata (CA -3) with the help of matrix algebra.
应用推荐