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

529 users

Most popular tags

vrs vrs_exam vrs_exercise ltl ctl exam dira omega_automata rosy parallel_computing ltl_model_checking mbes processor_architecture zielonka se1 lo2 automata bdd mu-calculus sequent-calculus simplex temporal local-model-checking kripke studiengang_reform rosy_exam zdd2fdd vrs_lecture greatest-simulation bdd2fdd exists-algorithm fourier_motzkin equivalance bdd2zdd tool studiengangswechsel fdd2bdd floating_point_arithmetic snf induction simulation zdd curriculum_change symbolic_computation fdd2zdd ctl_model_checking predicate_logic dynamic_scheduling cmd b_complement_multiplication constrain-algorithm compose-algorithm #parallel_computing minic i2sc format robdd breakpoint acceptance curriculum_update basic_block_scheduling unit-tests finroc sche ddd2zdd zdd2bdd vrs_cheatsheet hrs infinite_path branch-bound pre-requisite thesis functional state-machine uml-diagram embedded-system ml1 registration pipeline_conflicts vector_computers actiontable modulo_scheduling static_scheduling organisation lo1 conditional #pram restrict ite programming compiler abacus scheduling parallel forall notation shannon important predecessors fdd

Categories

Exam 2019.08.27 Problem 7

0 votes

Hi,

In the figure given below, Can you explain why does NOT c & [(Fb) SU (¬a ∧ Xa)] hold in s0 ? We are getting (!a & X a) in s1 so the strong until would hold in s1.

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

1 Answer

+1 vote
 
Best answer

Look at the following trace:

                        s0 s1 s2 ...
                    a : 0  0  1  ...
                    b : 0  0  0  ...
                    c : 1  0  0  ...
             !a & X a : 0  1  0  ...
                  F b : 0  0  0  ...
    [F b SU !a & X a] : 0  1  0  ...
      [b SU !a & X a] : 0  1  0  ...
     F[b SU !a & X a] : 1  1  0  ...

    

by (166k points)
selected by
Interesting, does this imply F b SU a is equivelant to  b SU a?
by (1.4k points)
No, that is not true, we do not even have [(F b) SU a] -> [b SU a] as can be seen as follows:

                  a : 0 0 1 0 0 1...
                  b : 1 0 0 1 0 0 ...
       [b SU a] : 0 0 1 0 0 1...
               F b : 1 1 1 1 ...
  [(F b) SU a] : 1 1 1
by (166k points)
Oh ok thanks alot
by (1.4k points)

Related questions

0 votes
1 answer
Problem 8.Conversion 2019.08.27
asked Jan 27, 2021 in * TF "Emb. Sys. and Rob." by dn (1.4k points)
0 votes
1 answer
Convert to LTL (Exam 2019.08.27)
asked Aug 23, 2020 in * TF "Emb. Sys. and Rob." by mlill (440 points)
0 votes
1 answer
Exam August 2020 problem 7
asked Feb 8, 2021 in * TF "Emb. Sys. and Rob." by dn (1.4k points)
0 votes
1 answer
Exam 2020.02.19 problem 7
asked Jan 26, 2021 in * TF "Emb. Sys. and Rob." by dn (1.4k points)
0 votes
1 answer
Exam Problem 8 2019.02.13
asked Feb 5, 2021 in * TF "Emb. Sys. and Rob." by dn (1.4k points)
 | Snow Theme by Q2A Market
Powered by Question2Answer
Imprint | Privacy Policy
...