Model checking is a formal verification by exhaustive search to finitestateautomata.
模型检测是基于对有穷状态自动机进行穷尽搜索的一种形式化验证方法。
2
We extend finitestateautomata with logic rules, trust matrix and actions of principals to analyze E-commerce protocols.
定义了一个信任矩阵和一个动作集合,并将它们和逻辑规则一起引入有限状态自动机为协议参与者建模。
3
The new algorithm is composed of two parts: adding fuzzy strings to minimal acyclic deterministic fuzzy finitestateautomata (ADFFAs) and minimizing the resulting automata.