# Kripke automaton and observations [closed]

This is a question concerning Kripke automaton. My answers seem a little short and I was wondering if I was missing something? Transition table of a Kripke automaton:

A -> red light is on

B and D -> blue light is on

C -> both light are on

1) Is the test 001blue satisfied by any state?

Attempt: No


2) Is the test 001red satisfied by every state?

Attempt: Yes but I dont know how to show it.


3) Which test could tell difference btw A and C?

Attempt: test = 100both; C satisfies test, A doesnt


4) Can any test distinguish B and C?

Attempt: Yes, test = 10001blue; B satisfies test, C doesnt


5)Show that no test can tell the difference btw B and D.

Attempt: Their observations are different.


## closed as off-topic by D.W.♦, Luke Mathieson, A.Schulz, Realz Slaw, fraflOct 17 '13 at 20:35

• This question does not appear to be about computer science within the scope defined in the help center.
If this question can be reworded to fit the rules in the help center, please edit the question.

• This question appears to be off-topic because it is about grading answers to your exercises. Please see this related meta discussion. If you want to ask a specific question about a specific part of your attempt, please edit the question accordingly and it may be reopened. – D.W. Oct 14 '13 at 5:13