共查询到20条相似文献,搜索用时 140 毫秒
1.
本文在文1-3的基础上,提出了受控离散事件过程的一种代数分析方法,弥补了Ramade和Wonham的理论对具体系统的应用缺乏可操作性的缺陷,使得对CDEP动态过程的分析变得更为直观,同时也使控制器的设计过程更具可操作性。 相似文献
2.
3.
本文阐述的银河-Ⅱ并行程序设计环境KD-PASTE以相关分析理论为基础[1],充分挖掘应用程序的向量成分,并同时对程序的微任务化[1]进行了探索。该系统功能齐全,使用方便,可移植性强。 相似文献
4.
一种通用的全局寻优演化算法-自适应进化规划 总被引:3,自引:0,他引:3
1.引 言 Darwin的进化论所描述的“物竞天演,优胜劣汰”的自然进化过程,实际上是描述了一种强壮的搜索、竞争与优化机理.科学家们用数学方式将此过程进行简化模拟,形成了一类具有鲜明特色的优化方法,即演化算法[1].进化规划(Evolutionary Programming-EP)[1,2]便是其中的一个分支.一般EP算法常被描述为求解实值函数极小化(极大化)问题 (P)min(max)F(x):Rn→R,(1) xRn且在人工智能、神经网络、自适应控制以及众多的工程应用领域显示了解决复杂问题的特别能… 相似文献
5.
无内部冲突满足P3的无α环的数据库模式分解(Ⅰ):分解的基本理论 总被引:9,自引:2,他引:9
郝忠孝 《计算机研究与发展》1998,35(4):301-304
文中在文献[1]、[2]、[3]讨论的基础上,讨论了数据库模式无内部冲突,但在最小归并依赖集D中存在弱右部或弱左部冲突时分解的性质和理论.为无内部冲突的满足P3的无α环的数据库模式分解算法设计提供了基础. 相似文献
6.
1.引 言 众所周知,TVD格式是能够高质量地捕捉激波的方法,但在计算粘性绕流时许多TVD格式数值耗散太大,不能正确模拟粘性流动,因而无法正确计算热流值.文献[3]指出,采用高精度格式可适当放松对网格雷诺数的要求,因此发展三阶或三阶以上的格式是需要的.文献[4]研究了迎风紧致群速度控制格式(UCGVC格式)在 Euler方程中的应用,提高了对激波的分辨率,优于通常二阶精度TVD格式.本文在文献[4]的基础上给出了利用迎风紧致格式求解NS方程.它是UCGVC格式在粘性流计算中的推广.对于方程中的无粘… 相似文献
7.
8.
MP3是 MPEG-1标准的音频 Larer Ⅲ(第 3层)。 MPEG(Moving Picture Experts Group)标准是由国际标准化组织(ISO)和国际电工委员会(IEC)共同制订的,用于数字存储媒体的运动图像和伴音的编码。MPEG-1的音频标准分为3层, Laser Ⅲ编码最为复杂,压缩率也最高,压缩比为 1:10~1:12时,接近CD音质,而其存储空间大大减少,便于在网络上传输,因而在网络中迅速崛起。 MP3的编码非常复杂,在VC+十下如果通过自己编写解码程序来实现MP3文件的播放,不… 相似文献
9.
单滞后区间动力系统的稳定性 总被引:14,自引:1,他引:13
本文研究如下单滞后时变区间动力系统x(t)=N[P,Q]x(t)+N[C(t),D(t)]x(t-τ),τ≥0的渐近稳定性的a稳定性,给出了其渐近稳定和a稳定的充分条件,推广和改进了文[1,2]的工作。 相似文献
10.
无内部冲突满足P3的无α环的数据库模式分解(Ⅱ):分解的算法及分析 总被引:4,自引:0,他引:4
郝忠孝 《计算机研究与发展》1998,35(4):305-309
文中在文献[1]、[2]、[3]、[4]讨论的基础上给出了数据库模式无内部冲突时,满足P3且为无α环的分解算法、正确性证明和分析. 相似文献
11.
By use of the technique of Chen [5] sufficient conditions are established for the strong consistency of the stochastic gradient (SG) algorithm for MIMO ARMAX stochastic systems without monitoring. This result is then used in conjunction with the method of disturbed adaptive controls introduced in [1], [2]. Hence it is shown that the SG algorithm generates strongly consistent parameter estimates while it is operating as a part of the SG algorithm of adaptive control of Goodwin, Ramadge, and Caines [6]. 相似文献
12.
分别使用形式化分析工具Casper+FDR和OFM C模型检测器对文[1]提出的一个军网身份鉴别协议进行了分析,找到了一个相同的攻击实例。同时指出了文[1]和文[2]中存在的几个谬误。然后对协议进行了修正。形式化验证结果表明修正后的协议是安全的。 相似文献
13.
I. Chattopadhyay 《International journal of control》2013,86(8):1271-1290
Supervisory control theory for discrete event systems, introduced by Ramadge and Wonham, is based on a non-probabilistic formal language framework. However, models for physical processes inherently involve modelling errors and noise-corrupted observations, implying that any practical finite-state approximation would require consideration of event occurrence probabilities. Building on the concept of signed real measure of regular languages, this paper formulates a comprehensive theory for optimal control of finite-state probabilistic processes. It is shown that the resulting discrete-event supervisor is optimal in the sense of elementwise maximizing the renormalized langauge measure vector for the controlled plant behaviour and is efficiently computable. The theoretical results are validated through several examples including the simulation of an engineering problem. 相似文献
14.
PETR KOZÁK 《International journal of systems science》2013,44(9):1403-1422
A new formal approach to the qualitative modelling of general time systems is introduced. The formalism is suitable for general non-deterministic systems with non-numerically valued inputs and outputs, e.g. for discrete event systems. The following basic concepts of systems theory, observability, causality, determinism and interconnections of systems, are defined using an input-output approach to the modelling. The concept of the state is introduced as a secondary one. A general definition of the discrete event systems is given. Some fundamental properties of systems are proved. A real-time extension of the supervisory control problem given by Ramadge and Wonham is formulated. Seven examples are provided. 相似文献
15.
Control of vector discrete-event systems. I. The base model 总被引:1,自引:0,他引:1
A vector discrete-event system (VDES) is a discrete-event system model in which the system state is represented by a vector with integer components, and state transitions by integer vector addition. The authors investigate such structures from the viewpoint of control theory. The objective is to specialize to VDES the general automation-based control theory of P.J. Ramadge and W.M. Wonham (1987) and W.M. Wonham and P.J. Ramadge (1988). It is shown that within the VDES framework a useful class of control systems can be compactly modeled, and some of the associated control problems of Ramadge and Wonham can be more efficiently solved 相似文献
16.
Silvano Balemi 《Discrete Event Dynamic Systems》1994,4(1):41-85
This paper proposes an input/output interpretation for the control of discrete event systems. In supervisory control theory, the plant is usually considered to be a process which spontaneously generates outputs. Its behavior is controlled by disabling some of its output events. In this paper the plant accepts inputs (commands) and generates outputs (responses). For many real-life problems, e.g., manufacturing problems, this model semantics seems more applicable than the original generator perspective proposed by Ramadge and Wonham. In real-life systems the message exchange between the plant and the controller is affected by communication delays. The class of supervisors that must be used in a closed-loop system subject to communciation delays is a subset of the set of solutions to the original problem introduced by Ramadge and Wonham. After having characterized this class of supervisors, the present paper states conditions on the plant language that allow the supervisors solving the (delay-free) supervisory control problem of Ramadge and Wonham to be used also for the case of closedloop systems affected by delays. 相似文献
17.
《Robotics and Autonomous Systems》1994,12(3-4):187-198
Discrete Event Systems (DES) are a special type of dynamic system. The ‘state’ of these systems changes at discrete instants in time and the term ‘event’ represents the occurrence of discontinuous change (at possibly unknown intervals). Different Discrete Event Systems models are currently used for specification, verification, synthesis as well as for analysis and evaluation of different qualitative and quantitative properties of existing physical systems. The focus of this paper is the presentation of the automata and formal language model for DES introduced by Ramadge and Wonham and its application to the domain of mobile manipulator/observer agents. We demonstrate the feasibility of the DES framework for modeling, analysis and synthesis of some visually guided behaviors of agents engaged in navigational tasks and address synchronization issues between different components of the system. The use of DES formalism allows us to synthesize complex behaviors in a systematic fashion and guarantee their controllability. 相似文献
18.
O. Kaneko T. Misaki T. Fujii 《Journal of Computer and Systems Sciences International》2006,45(4):513-517
The purpose of this paper is to investigate the controllability and the achievability of discrete event systems within a behavioral
framework. Based on the notion of Willems’ behavioral controllability [1, 2], we introduce a new concept related to the controllability
of discrete event systems. By using the controllability proposed here and the notion related to achievable behaviors [3, 4],
we show that the behavioral controllability for a given specification with respect to language is equivalent to the existence
of a controller, so that an interconnected system satisfies the specification exactly. A proposed controller here is represented
by the intersection of the behavior of a given plant and that of a given (controllable) specification. We also clarify that
our controllers for a given specification fit the properties of well-known supervisory controllers proposed and developed
by Ramadge and Wonham [5].
The text was submitted by the authors in English. 相似文献
19.
对基于一级泛与运算的一阶谓词演算形式系统(A)UL-h∈[0.75,1]进行公理化.通过引入全称量词和存在量词,建立与命题形式系统(A)UL-h∈[0.75,1]相对应的一阶谓词形式系统V(A)UL-h∈[0.75,1]并证明该系统的可靠性定理及演绎定理. 相似文献
20.
Formal power series are an extension of formal languages. Recognizable formal power series can be captured by the so-called weighted finite automata, generalizing finite state machines. In this paper, motivated by codings of formal languages, we introduce and investigate two types of transformations for formal power series. We characterize when these transformations preserve recognizability, generalizing the recent results of Zhang [16] to the formal power series setting. We show, for example, that the “square-root” operation, while preserving regularity for formal languages, preserves recognizability for formal power series when the underlying semiring is commutative or locally finite, but not in general. 相似文献