![]() On the left bank there is one missionary and one cannibal.Note that the missionaries/cannibals on the boat count towards the number of missionaries/cannibals on the bank the boat is at. The goal is to bring all of the missionaries and cannibals to the other side of the river, while ensuring that no missionary is eaten. If at any time, on either side of the river, the cannibals outnumber the missionaries, the cannibals will eat the missionaries. Each of the missionaries and the cannibals are able to operate the boat. The boat can carry up to two people at time. Initially they are all on the same side of the river. 2 The Missionaries and Cannibals Problem In this puzzle, three missionaries and three cannibals want to cross a river, on which there is a boat. The ability to verify the correctness of LTL specifications and generate a counterexample when a specification doesn’t hold.The ability to write simple LTL specifications, and.The ability to write simple NuSMV models,.A good understanding of the fundamentals of the various language constructs of the NuSMV specification language,.A good understanding of the fundamentals of modelling software systems using program graphs and transition systems,.An appreciation of importance of consistent specifications,.Objectives addressed by this assignment include: You will use the NuSMV model checker to express the model and the LTL specifi- cations, as well as to verify these specifications. Use LTL to express desirable specifications, and 3. Develop a state-transition model for the problem, and express it in NuSMV, 2. Model Checking-the Missionaries and Cannibals Problem FIT3013 Assignment 2 Due Date: 23:59, Sunday 1 Assignment Objectives In this assignment we will model a classic puzzle of “Missionaries and Cannibals”, and verify some LTL specifications (properties) using the NuSMV model checker. ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |