Read the basic knowledge of the fifth chapter, the formal method refers to the method of discrete mathematics to solve problems in the field of software engineering, including the establishment of accurate mathematical models and the analysis of the model activities. The main purpose is to ensure the correctness of the software. The formalized methods that have been established can be divided into operation classes and descriptive classes. The Operation class method is based on the state and transfer, and the description class is based on mathematical axioms and concepts. Formal proof and verification techniques mainly include model detection (suitable for poor state systems, fully automated and fast verification) and theorem proofs (using logical formulas to represent system protocols and their properties, divided into automatic and interactive). First order linear temporal logic is an extension of the first order predicate logic. A deeper understanding of the Hanoi operational planning problem. Computational tree logic is a discrete, branch time, propositional temporal logic. The path quantifier is added as compared to FOLTL: all future paths, at least one path. The mathematical basis of Z language is set theory and-order predicate calculus, and the three main components of the model are input, output and state. The z language means that the elements of abstraction are generally divided into two categories: sets, relationships, functions, sequences and packages, and Z-unique patterns based on set theory. The z language is further understood by reading the Z language instance. Petri nets are divided into location/migration Petri nets and advanced petri nets. Petri nets have rich structure description ability, and have sequential, concurrency, conflict and confusion structure models.
Reading "Software Engineering-theory method and Practice" fifth chapter experience