翻訳と辞書
Words near each other
・ Promecarb
・ Promecognathinae
・ Promecoptera
・ ProMED-mail
・ Promedia Verlag
・ ProMedica
・ Promedon
・ Promega
・ Promegakaryocyte
・ Promegalonychus
・ Promegalops
・ Promegapoietin
・ Promegatherium
・ Promegestone
・ Promegistidae
Promela
・ Promelectronica
・ Promeliboeus
・ Promenade (1979 album)
・ Promenade (dance move)
・ Promenade (disambiguation)
・ Promenade (musical)
・ Promenade (Street Sweeper Social Club song)
・ Promenade (The Divine Comedy album)
・ Promenade Beach
・ Promenade Bellerive
・ Promenade Concert
・ Promenade concert
・ Promenade de la Croisette
・ Promenade deck


Dictionary Lists
翻訳と辞書 辞書検索 [ 開発暫定版 ]
スポンサード リンク

Promela : ウィキペディア英語版
Promela
PROMELA (Process or Protocol Meta Language) is a verification modeling language introduced by Gerard J. Holzmann. The language allows for the dynamic creation of concurrent processes to model, for example, distributed systems. In PROMELA models, communication via message channels can be defined to be synchronous (i.e., rendezvous), or asynchronous (i.e., buffered). PROMELA models can be analyzed with the SPIN model checker, to verify that the modeled system produces the desired behavior. An implementation verified with Isabelle/HOL is also available, as part of the Computer Aided Verification of Automata project.〔https://cava.in.tum.de/templates/publications/promela.pdf〕
==Introduction==
PROMELA is a process modeling language whose intended use is to verify the logic of parallel systems. Given a program in PROMELA, Spin can verify the model for correctness by performing random or iterative simulations of the modeled system's execution, or it can generate a C program that performs a fast exhaustive verification of the system state space. During simulations and verifications SPIN checks for the absence of deadlocks, unspecified receptions, and unexecutable code. The verifier can also be used to prove the correctness of system invariants and it can find non-progress execution cycles. Finally, it supports the verification of linear time temporal constraints; either with Promela never-claims or by directly formulating the constraints in temporal logic. Each model can be verified with Spin under different types of assumptions about the environment. Once the correctness of a model has been established with Spin, that fact can be used in the construction and verification of all subsequent models.
PROMELA programs consist of ''processes,'' ''message channels'', and ''variables''. Processes are global objects that represent the concurrent entities of the distributed system. Message channels and variables can be declared either globally or locally within a process. Processes specify behavior, channels and global variables define the environment in which the processes run.

抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)
ウィキペディアで「Promela」の詳細全文を読む



スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース

Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.