找回密碼
 To register

QQ登錄

只需一步,快速開始

掃一掃,訪問微社區(qū)

打印 上一主題 下一主題

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

[復(fù)制鏈接]
樓主: 揭發(fā)
11#
發(fā)表于 2025-3-23 12:21:03 | 只看該作者
12#
發(fā)表于 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.
13#
發(fā)表于 2025-3-23 19:49:48 | 只看該作者
14#
發(fā)表于 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).
15#
發(fā)表于 2025-3-24 05:55:38 | 只看該作者
16#
發(fā)表于 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.
17#
發(fā)表于 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.
18#
發(fā)表于 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.
19#
發(fā)表于 2025-3-24 21:44:59 | 只看該作者
20#
發(fā)表于 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 ..
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點(diǎn)評 投稿經(jīng)驗(yàn)總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機(jī)版|小黑屋| 派博傳思國際 ( 京公網(wǎng)安備110108008328) GMT+8, 2026-1-22 20:08
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
富蕴县| 邯郸县| 额尔古纳市| 清镇市| 旬邑县| 湘潭市| 东山县| 社旗县| 农安县| 饶阳县| 内江市| 海安县| 阿拉善盟| 邯郸县| 娄烦县| 视频| 纳雍县| 阿鲁科尔沁旗| 乳源| 浏阳市| 青海省| 江陵县| 濮阳县| 筠连县| 永宁县| 柳林县| 什邡市| 蒲城县| 建始县| 綦江县| 黎平县| 垫江县| 奉贤区| 福贡县| 周口市| 舟山市| 讷河市| 柳河县| 秦皇岛市| 融水| 东明县|