In: EATCS Monographs on Theoretical Computer Science. Berlin: Springer-Verlag, 1994.
Abstract: This volume contains a detailed presentation of the analysis methods for CP-nets. The analysis methods allow the modeller to investigate dynamic properties of CP-nets, e.g., the properties defined in Chap. 4 of Vol. 1. We describe the main ideas behind the analysis methods and the mathematics on which they are based. We also describe how the methods are used in practice and how they are supported by computer tools. Some parts of this volume are rather theoretical while other parts are application oriented. The purpose of the volume is to teach the reader how to use the formal analysis methods. This does not require a deep understanding of the underlying mathematical theory (although such knowledge will, of course, be a help). Chapters 1-3 deal with occurrence graphs, Chap. 4 deals with invariants, and Chap. 5 defines the behaviour of timed CP-nets. In Chap. 5 of Vol. 1 we introduced the basic ideas behind occurrence graphs and place invariants. The descriptions there were intuitive, imprecise and without proofs. In this volume we give the precise unambiguous definitions, prove the correctness of the various techniques, and explain how to use the methods in practice. To make the description complete we repeat the informal introductions provided in Vol. 1.