找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Systems and Software Verification; Model-Checking Techn Béatrice Bérard,Michel Bidoit,Pierre McKenzie Book 2001 Springer-Verlag Berlin Heid

[复制链接]
楼主: 揭发
发表于 2025-3-23 12:21:03 | 显示全部楼层
发表于 2025-3-23 17:01:57 | 显示全部楼层
Symbolic Model CheckingGenerally speaking, . refers to any model checking method which would attempt to represent symbolically (as opposed to “explicitly”) the states and transitions of an automaton targeted for verification. We often use this term, as well, to refer to a particular symbolic method in which . (BDD) are used to represent the state variables.
发表于 2025-3-23 19:49:48 | 显示全部楼层
发表于 2025-3-24 01:22:14 | 显示全部楼层
Safety PropertiesExamples are everywhere, most often without conditions: “both processes will never be in their critical section simultaneously .” (S1), or “memory overflow will never occur” (S2), or “the situation.. is impossible” (S3). An example of safety with condition is “as long as the key is not in the ignition position, the car won’t start” (S4).
发表于 2025-3-24 05:55:38 | 显示全部楼层
发表于 2025-3-24 07:58:44 | 显示全部楼层
Deadlock-freenessDeadlock-freeness is a special property, stating that the system can never be in a situation in which no progress is possible. This is a correctness property relevant for systems that are supposed to run indefinitely. In a more general framework, a set of properly identified final states will be required to be deadlock-free.
发表于 2025-3-24 12:33:15 | 显示全部楼层
Fairness PropertiesAgain here examples abound: “the gate will be raised infinitely often” (F1), “if access to a critical section is infinitely often requested, then access will be granted infinitely often” (F2), etc. Remember that (F2) did not hold for the printer manager from section 1.3.
发表于 2025-3-24 16:05:00 | 显示全部楼层
Abstraction MethodsBy “abstraction methods” we mean a family of techniques which are used to simplify automata. The term . refers to the nature of the simplifications performed, which generally consist in ignoring some aspects of the automaton involved.
发表于 2025-3-24 21:44:59 | 显示全部楼层
发表于 2025-3-25 00:01:53 | 显示全部楼层
SPIN — Communicating Automata. is a tool mainly developed by G. J. Holzmann at Bell Labs, Murray Hill, New Jersey, USA. SPIN was designed for simulation and verification of distributed algorithms It is freely available via Internet ..
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-6-5 21:54
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表