基于Petri网的数字家庭无线射频协议研究

对数字家庭无线射频通信协议进行分解,给出协议各部分的流程。构造基于Petri网的通信协议模型,并在模型的基础上运用可达图方法分析协议Petri网模型的动态性质,从而验证协议的正确性,为进一步研究和应用该协议提供一种新的思路。     

Multiple-objective scheduling and real-time dispatching for the semiconductor manufacturing system

Implementing efficient scheduling and dispatching policies is a critical means to gain competitiveness for modern semiconductor manufacturing systems. In contemporary global market, a successful semiconductor manufacturer has to excel in multiple performance indices, consequently qualified scheduling approaches should provide efficient and holistic management of wafer products, information and manufacturing resources and make adaptive decisions based on real-time processing status to reach an overall optimized system performance. To cope with this challenge, a timed extended object-oriented Petri nets (EOPNs) based multiple-objective scheduling and real-time dispatching approach is proposed in this paper. Four performance objectives pursued by semiconductor manufacturers are integrated into a priority-ranking algorithm that serves as the initial scheduling guidance, and then all wafer lots will be dynamically dispatched by the hybrid real-time dispatching control system. A set of simulation experiments validate the proposed multiple-objective scheduling and real-time dispatching algorithm may achieve satisfactory performances.     

价格着色Petri网的最小成本可达问题

针对实际业务流程建模中成本预算分析的需要,在着色网的基础上扩展价格信息,提出价格着色网。讨论价格着色网的变迁步规则,根据提出的经济标识,给出最小成本构造算法,以一个业务流程实例演示该模型的应用,证明其能够较好地解决业务流程建模中的成本预算分析问题。     

电子信息系统中信息传输控制技术

信息传输控制技术是决定信息正确传输的关键,该文针对目前电子信息系统中信息传输的现状和特点,提出构件化网络传输控制服务软件的设计方法,采用相关信息传输控制技术,建立信息传输组件架构和传输控制机制应用于工程实践。结果证明,该技术设计解决了目前困扰信息传输的相关实际问题,在提高信息传输的灵活性、实时高效性和可靠性等方面取得了明显的效果。     

基于Bit承诺的合同网模型

在分析现有合同网模型的基础上,针对合同网协商过程中的安全问题,利用Bit承诺协议和RSA算法,给出一个具有安全性的合同网协商模型,保证Agent之间信息的安全传输,防止协作Agent反悔、拒绝履行承诺。该协商模型满足不可否认性和强可验证性,投标价格保密安全,技术简单,通信量小。     

基于MDA和可执行形式化的可信软件设计

提出基于模型驱动架构的软件开发过程,利用可执行形式化规范,有效提高软件开发效率和可测试性,并通过基于可执行规范的运行时监控技术保证系统行为的可信性,降低由于软件测试阶段遗留的错误以及系统受到非法入侵所带来的风险。     

Supervisory control based on minimal cuts and Petri net sub-controllers coordination

This paper addresses the synthesis of Petri net (PN) controller for the forbidden state transition problem with a new utilisation of the theory of regions. Moreover, as any method of control synthesis based on a reachability graph, the theory of regions suffers from the combinatorial explosion problem. The proposed work minimises the number of equations in the linear system of theory of regions and therefore one can reduce the computation time. In this paper, two different approaches are proposed to select minimal cuts in the reachability graph in order to synthesise a PN controller. Thanks to a switch from one cut to another, one can activate and deactivate the corresponding?PNcontroller. An application is implemented in a flexible manufacturing system to illustrate the present method. Finally, comparison with previous works with experimental results in obtaining a maximally permissive controller is presented.     

Extension of the lower bound of monitor solutions of maximally permissive supervisors to non-α net systems

Traditional region-based liveness-enforcing supervisors focus on (1) maximal permissiveness of not losing legal states, (2) structural simplicity of minimal number of monitors, and (3) fast computation. Lately, a number of similar approaches can achieve minimal configuration using efficient linear programming. However, it is unclear as to the relationship between the minimal configuration and the net structure. It is important to explore the structures involved for the fewest monitors required. Once the lower bound is achieved, further iteration to merge (or reduce the number of) monitors is not necessary. The minimal strongly connected resource subnet (i.e., all places are resources) that contains the set of resource places in a basic siphon is an elementary circuit. Earlier, we showed that the number of monitors required for liveness-enforcing and maximal permissiveness equals that of basic siphons for a subclass of Petri nets modelling manufacturing, called α systems. This paper extends this to systems more powerful than the α one so that the number of monitors in a minimal configuration remains to be lower bounded by that of basic siphons. This paper develops the theory behind and shows examples.     

出现网的t型s切和t切

首先引入出现网的t切的转移的概念,利用t切的转移集τ,可以得到t切p[τ]。其次引入s切的伴随集E(u)和t型s切的概念。证明了出现网的t型s切和t切有对应的关系以及这种对应关系保持t型s切的转移和t切的转移。给出了在s切有向图中查找t切的算法,证明了出现网的t切都是t型s切的伴随集。     

探讨PON技术的三网融合解决方案

三网融合是在数字通信技术高度发展、人们对网络服务的要求日趋多样化的背景下,逐渐成为人们关注的网络领域技术变革的热点。本文介绍了三网融合中接入网研究热点PON技术,提出了基于GPON的三网融合行之有效的方案。