首页> 外国专利> SOFTWARE DEVELOPMENT PRE-PROCESSING METHOD, SOFTWARE CONTROL METHOD, SOFTWARE DEVELOPMENT METHOD, AND SOFTWARE DEVELOPING DEVICE

SOFTWARE DEVELOPMENT PRE-PROCESSING METHOD, SOFTWARE CONTROL METHOD, SOFTWARE DEVELOPMENT METHOD, AND SOFTWARE DEVELOPING DEVICE

机译:软件开发预处理方法,软件控制方法,软件开发方法和软件开发设备

摘要

PROBLEM TO BE SOLVED: To eliminate wasteful iteration for finishing processing on a word unit program for creating output data by a minimum number of execution, in a system consisting of word-unit programs.;SOLUTION: A requirement is defined as a word unit program defining relation between words by taking a path action element as one of the words. When this path action element definition equation execution condition is assumed as a definition equation execution condition of a word belonging to a basic structure designated by the path action element in establishment of the condition, the path action element is eliminated, and configurations of the whole system are assembled together. On word unit program groups of the obtained unified whole system, topological sorting is carried out for rearranging the word unit program groups in an optimum order. In this way, wasteful iterations, for example, can be prevented.;COPYRIGHT: (C)2005,JPO&NCIPI
机译:解决的问题:在由字单元程序组成的系统中,消除用于完成字单元程序的处理过程的浪费的迭代,以便以最小的执行次数来创建输出数据。;解决方案:将需求定义为字单元程序通过将路径动作元素作为单词之一来定义单词之间的关系。在该条件成立时,如果将该路径动作要素定义式的执行条件假定为属于由路径动作要素所指定的基本结构的单词的定义式执行条件,则消除路径动作要素,构成系统整体。组装在一起。在获得的统一整体系统的字单元程序组上,进行拓扑排序,以最佳顺序重新排列字单元程序组。这样,可以防止例如浪费的迭代。;版权所有:(C)2005,JPO&NCIPI

著录项

  • 公开/公告号JP2005115498A

    专利类型

  • 公开/公告日2005-04-28

    原文格式PDF

  • 申请/专利权人 CATENA CORP;

    申请/专利号JP20030346442

  • 发明设计人 ARAI OSAMU;

    申请日2003-10-06

  • 分类号G06F9/44;G06F9/45;

  • 国家 JP

  • 入库时间 2022-08-21 22:29:13

相似文献

  • 专利
  • 外文文献
  • 中文文献
获取专利

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号