1) rewrite relation
重写关系
1.
Dolev-Yao intruder model are assumed, and based on state transition system, message and event are semantically encoded, protocol rule are defined by rewrite relation, and security properties are descripted by event set.
提出一种基于状态转移系统的安全协议模型,以Dolev-Yao攻击者模型为前提假设,以状态转移系统为框架,用语义编码的方式定义消息和事件,用重写关系定义协议规则,用事件的集合来描述协议的安全属性,并给出安全属性的检验策略。
2) reading-writing relationship
读写关系
3) program rewriting
重写系统
1.
By combining the idea of object oriented designing and application of rewriting technique, this paper proposes the basic idea and schema structure of program rewriting, which constructs an object oriented program rewriting theory and defines a model of rewriting system by drawing lessons from abstract rewriting system and rewriting logic.
结合面向对象程序设计的思想和重写技术的应用，提出了程序重写技术的基本思想及其框架结构，该模型在借鉴了抽象的重写系统和重写逻辑的基础上，构造了面向对象程序的重写理论，并定义了重写系统的模型。
4) net rewriting systems
网重写系统
1.
Based on the improved net rewriting systems(INRS),a method for self-reconfiguration of Petri net(PN) logic controllers for reconfigurable manufacturing systems(RMS) is presented.
提出一种基于改进的网重写系统的可重构制造系统的Petri网模型的自重构方法。
5) term rewriting systems
项重写系统
1.
The dynamic term rewriting calculus is a formal computation model for meta-computation of term rewriting systems, which has characteristic features as the hierarchical declaration and dynamic rewriting, and is applied to the automated formal proving for the inductive theorems and weak termination of term rewriting systems.
动态项重写计算(DTRC)是项重写系统(TRS)的元计算模型,具有层次化结构和动态重写等特征,可应用于归纳定理的形式自动证明以及项重写系统弱终止性的形式自动证明等方面。
6) string rewriting system
串重写系统
1.
A string rewriting system(Σ∶R) is a set of all words or strings over some finite alphabet Σ.
串重写系统 (Σ∶ R)是定义在字母表Σ上的所有字符串的集合 ,一般情况下集合中的元素是不可刻画的 。
补充资料：经济关系(见生产关系)
经济关系(见生产关系)
economical relation
1 ingji gU口nxj经济关系(eeonomieal relation)系。见生产关
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条