Figure 4-1 A simple finite state machine .In this example ,the authorized states

Question

Figure 4-1 A simple finite state machine .In this example ,the authorized states are s1 and s2.

Figure 4-1 A simple finite state machine .In this example ,the authorized states are s1 and s2.

In Figure 4-1 .suppose that edge t3 went from s1 to s4. Would the resulting system be secure

3- Security Policies Consider the finite-state machine in the figure. It consists of four states and five transitions. The security policy partitions the states into a set of authorized states AA (SI, S2) and a set of unauthorized states UA tS3, Sl. The system is considered insecure if it can enter an unauthorized state. As a security consultant, by looking at the security state of this system, can you tell whether it is in a secure or an insecure state? Why?

Explanation / Answer

We cannot conclude that the system is in secure state or not but at transitions t1,t2,t4 it is secured.

And t3 and t5 it is insecure.

I Mean t3 directly is insecure.

And if edge t3 moves from s1 to s4the system is definitely in an insecure state.

Related Questions

Navigate

• Browse (All)
• Browse F
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.