PROPERTY-PRESERVING PETRI NET PROCESS ALGEBRA IN SOFTWARE ENGINEERING

软件工程中的性质保持Petri网处理代数

计算机科学技术基础学科

原   价:
1250.00
售   价:
937.00
发货周期:预计3-5周发货
作      者
出  版 社
出版时间
2012年03月20日
装      帧
精装
ISBN
9789814324281
复制
页      码
320
语      种
英文
综合评分
暂无评分
我 要 买
- +
库存 30 本
  • 图书详情
  • 目次
  • 买家须知
  • 书评(0)
  • 权威书评(0)
图书简介
In a component-based approach for system design, one of the difficult problems is how to prove the correctness of the created components. Usually, the constituent components are supposed to be correct, i.e., possessing the desirable properties and being free from undesirable ones. However, the operators may destroy these properties or create new ones, resulting in an undesirable new component. Hence, every created component has to go through a new process of verification. This indeed involves a tremendous amount of effort! This book presents a component-based methodology for the creation and verification of design specifications. The methodology is formally presented as an algebra called Property-Preserving Petri Net Process Algebra (PPPA). Briefly, PPPA includes five classes of operators. The authors show that every operator of PPPA can preserve a large number of basic system properties. Hence, if the initial set of primitive components satisfies some of these properties, the created components will also “automatically” satisfy them without the need of further verification. This greatly saves the efforts spent in verification. Key Features • The algebra caters to the needs of real-life component-based system design • Verification is based on real-life system properties • A property-preservation approach for verification is built into the algebra
馆藏图书馆
Harvard Library
本书暂无推荐
本书暂无推荐
看了又看
  • 上一个
  • 下一个