确定性自动机

At the same time , we discuss the determinism and nondeterminism of formula-clock automata and the closure propertied under Boolean operation of the language which is accepted by formula-clock automata. We also prove the expressive equivalence between the deterministic formula-clock automata and the nondeterministic formula-clock automata. This means that every nondeterministic formula-clock automata can be transformed to a deterministic formula-clock automata which exactly accept the timed language identified by the fomer.We also extend timed words to infiniteness and define the formula-clock Buchi automata and the formula-clock Muller automata. At last, we show its application in formal verification and modeling of real-time system.

然后讨论了公式时钟自动机的确定性和非确定性，公式时钟自动机识别的语言类在并、交、补运算下的封闭性；并证明了确定的公式时钟自动机和非确定的公式时钟自动机表达能力的等价性，这意味这每一个非确定的公式时钟自动机都能转换为一个与之识别相同时间语言的确定的公式时钟自动机；我们将时间字扩展为无穷的，从而定义了公式时钟Buchi自动机与公式时钟Muller自动机；最后给出了用它进行实时系统的形式化验证方面及对实时系统建模的应用。

Also called a deterministic finite automaton, or simply a finite state machine.

也称为确定性有限自动机，或者只是一个有限状态机。

Similarly called a nondeterministic finite automaton, it is another simple model of computation, although its processing sequence is not uniquely determined.

同样所谓的非确定性有限自动机，它是另一种简单的模型计算，但其处理顺序不是唯一确定。

Turing machine, random access machine, primitive recursive, cellular automaton, finite state machine, cell probe model, pointer machine, alternation, alternating Turing machine, nondeterministic Turing machine, oracle Turing machine, probabilistic Turing machine, universal Turing machine, quantum computation, parallel models: multiprocessor model, work-depth model, parallel random-access machine, shared memory.

图灵机，随机存取机，原始递归，元胞自动机，有限状态机，细胞探针模型，指针机，交替轮流进行，图灵机，非确定性图灵机，甲骨文图灵机，概率图灵机，通用图灵机，量子计算，并行型号：多模式，工作深入模型，并行随机存取机，共享内存。

And a new mechanism is provided to store the data of OWL in relational database, the hierarchy structures of classes and properties defined in the OWL are also kept through views of the database system. 2、 Proposed a new method of using Finite State Machine and execution tag tree to describe the excution logic of existing grid service and the goal service specified by users, using Deterministic Propositional Dynamic Logic and FSM to determine the composable of goal service and make the composition plan. The computation complex is also discussed 3、 Designed some algorithms to compose existing grid services according to user requirement.

同时提出了一种新的机制，使用关系型数据库来存储OWL定义的实体，使用视图表示OWL中定义的类之间和属性之间的层次关系； 2、提出了使用有限状态自动机和执行标记树，表示网格系统中存在的网格服务和代表用户需求的目标服务的执行概要和逻辑，结合确定性动态命题逻辑，研究了目标服务的可组合性和自动组合模型，并讨论了组合模型的计算复杂度； 3、设计了一种根据用户需求来组合已存在的网格服务的算法。

The split between the two groups can hardly be papered over.

这两个团体间的分歧难以掩饰。

This approach not only encourages a greater number of responses, but minimizes the likelihood of stale groupthink.

这种做法不仅鼓励了更多的反应，而且减少跟风的可能性。