Here you can ask questions and find or give answers to organizational, academic and other questions about studying computer science.

1.1k questions

1.2k answers

1.6k comments

546 users

0 votes

what can be solution for below question:

S1 = ¬XX (G(a ⊕ b) ⊕ F(a ↔ b)) S2 = XXG((a ⊕ Xa) ∧ (b ⊕ XXb))

in * TF "Emb. Sys. and Rob." by (550 points)

1 Answer

0 votes

See the example solution: G(a ⊕ b) ⊕ F(a ↔ b) = G(a ⊕ b) ⊕ ¬¬F(a ↔ b) = G(a ⊕ b) ⊕ ¬G(a ⊕ b) = 1, thus S1 is false, and we just need to satisfy S2. We first ignore the XX and add two states later to adjust that, and consider now G((a ⊕ Xa) ∧ (b ⊕ XXb)) = G(a ⊕ Xa) ∧ G(b ⊕ XXb). 

G(a ⊕ Xa) means that a must always toggle its value when following transitions, and G(b ⊕ XXb) means that b does so with a period of 2. So, for example, we could create a model by repeating the following four states in a cycle: {a,b} -> {b} -> {a} -> {} 

by (166k points)

Related questions

0 votes
1 answer
asked Aug 24, 2020 in * TF "Emb. Sys. and Rob." by nikita (300 points)
0 votes
1 answer
asked Aug 20, 2020 in * TF "Emb. Sys. and Rob." by nikita (300 points)
0 votes
1 answer
asked Aug 20, 2020 in * TF "Emb. Sys. and Rob." by maherin (370 points)
0 votes
1 answer
0 votes
1 answer
asked Aug 9, 2021 in * TF "Intelligent Systems" by RS (770 points)
Imprint | Privacy Policy
...