![]() CATEGORIES: BiologyChemistryConstructionCultureEcologyEconomyElectronicsFinanceGeographyHistoryInformaticsLawMathematicsMechanicsMedicineOtherPedagogyPhilosophyPhysicsPolicyPsychologySociologySportTourism |
Give an example Model Checking for CTL formulas. Formal Semantics of CTL. Marking algorithm for CTL formulas.AX EX AF EF AG EG A ( E ( CTL * - Computational Tree Logic * - this is one of the possible branching time logics In the logic of linear time LTL except atomic statements and operations of propositional logic are introduced temporal operators {U, X} (except them convenient to use another F and G) The logic CTL * added quantifiers way, allowing different properties of different ways Formula CTL * is defined for a particular interpretation (structure Kripke) and all of its possible calculation CTL is a subset of CTL * - in the CTL formulas each temporal operator is preceded by a quantifier way Example is: 22. Define algorithm for Model Checking: a basic (EX, AF, EU).Syntactic analysis of formula. Example Model Checking EX AF EU-Exist Until For LTL example GFq - always in the future Fq - at least once in the future
GFq - infinitely many times in the future FGq - to a certain point, constantly p->Fq - on the river in the response q s0 will sometime in the future G [p->Fq] - always on the river will be the response q For CTL* example "If the message m will arrive at the entrance to the channel, then sometime in the future it will output" "Lift never pass by the floor n, from whom did not yet meet the needs of" p(t)- position lift at the moment t. "We are not friends until you apologize" Date: 2016-01-03; view: 2503 |