Description
Book SynopsisIn a component-based approach for system design, one of the challenging problems is the way to prove the correctness of the created components. Usually, the constituent components are supposed to be correct — possessing the desirable properties and 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, involving 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). PPPA includes five classes of operators, and the authors show that every operator of PPPA can preserve a large number of basic system properties. Therefore, if the initial set of primitive components satisfies some of these properties, the created components will also “automatically” satisfy them without the need for further verification — thus greatly saving verification efforts.
Table of ContentsFundamental Theory of Property-Preserving Petri Net Algebra: Introduction; Fundamentals on PPPA and Related Work; Petri Net Processes and Extension Operators; Composition Operators of PPPA; Property-Preserving Refinements; Property-Preserving Reductions; Place-Merging Operators for Resource Sharing; Applications to Software Engineering: Application of PPPA to Component-Based Design of Manufacturing Systems; Application of PPPA to Multi-Agent System Design; Application of PPPA to Job-Shop Scheduling Systems; Application of PPPA to Security Policy Design; Conclusion and Future Work.
