FINITE-STATE SYSTEMS
$10-30 USD
착불
I need help with the following questions
i) Consider the CES model checker for CTL. If we are going to model the exe- cution of a program with n Boolean variables and m integer variables, each of which ranges from 0 to 10 (inclusive), what is the maximal number of states in the state graph.
ii) Consider a simple algorithm for solving the mutual exclusion problem for two processes. Construct the state transition diagram for this algorithm. Prove or disprove the following properties by first expressing them in CTL formulas and then by following as much as possible the labeling technique in the CES model checker.
(a) Only one of the two processes can be in the critical section at any one time.
(b) The two processes will not deadlock.
프로젝트 ID: #25152531
프로젝트 소개
이 일자리에 대한 프리랜서 2 명의 평균 입찰가: $28
I have good knowledge of microsoft excel and word. I'm a btech engineer. I have good typing speed. Just give me a chance to work with you. I will give my 100% effort to your project.
