在偏序集上引入并考察了滤子极大理想的概念,证明了相应的存在性定理。引入并考察了伪极大元和伪既约元的概念,利用图表的形式对连续格中各种类型的既约元和素元之间的关系进行了归纳总结,完善了文献《Continuous Lattices and Domains》(作者:G.Gierz,et al)中的一个图表的相关内容,填补了在分配的连续格情形该图表的一个未知内容,部分地回答了该文献中的一个问题。
The standard Kripke semantics of epistemic logics has been applied successfully to reasoning communication protocols under the assumption that the network is not hostile. This paper introduces a natural semantics of Kripke semantics called knowledge structure and, by this kind of Kripke semantics, analyzes communication protocols over hostile networks, especially on authentication protocols. Compared with BAN-like logics, the method is automatically implementable because it operates on the actual definitions of the protocols, not on some difficult-to-establish justifications of them. What is more, the corresponding tool called SPV (Security Protocol Verifier) has been developed. Another salient point of this approach is that it is justification-oriented instead of falsification-oriented, i.e. finding bugs in protocols.
