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

1.1k questions

1.3k answers

1.7k comments

557 users

Most popular tags

vrs vrs_exam vrs_exercise ltl exam ctl dira omega_automata rosy parallel_computing ltl_model_checking mbes processor_architecture zielonka sequent-calculus local-model-checking se1 lo2 automata bdd mu-calculus simplex temporal rosy_exam greatest-simulation zdd2fdd vrs_lecture kripke studiengang_reform bdd2fdd exists-algorithm tool fourier_motzkin equivalance bdd2zdd studiengangswechsel symbolic_computation ctl_model_checking fdd2bdd floating_point_arithmetic snf induction breakpoint simulation zdd curriculum_change fdd2zdd predicate_logic dynamic_scheduling cmd b_complement_multiplication constrain-algorithm compose-algorithm #parallel_computing minic i2sc format robdd 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

Convert to LTL (Exam 2019.08.27)

0 votes

In exercise 8 of exam 2019.08.27, we have to convert "A([¬aU0]∧F[aUb])" to LTL.

Why is "A([¬aU0]∧F[aUb])" not already a LTL formula?

in * TF "Emb. Sys. and Rob." by (440 points)
edited by
The formula is syntactically in CTL* and in LTL.
Students who realized that and wrote that the formula itself is already an equivalent formula in LTL got full points.
The solution is there to show a possible but not required way to simplify the formula (third step). The fourth step (conversion to CTL) is purely educative and not required in a real submission.
by (25.6k points)

1 Answer

+1 vote
 
Best answer
You are right, that does not make sense. It is already a LTL formula, and the exercise should be to convert it to CTL. It has been fixed now.
by (170k points)
selected by
The formula is syntactically in CTL* and in LTL.
Students who realized that and wrote that the formula itself is already an equivalent formula in LTL got full points.
The solution is there to show a possible but not required way to simplify the formula (third step). The fourth step (conversion to CTL) is purely educative and not required in a real submission.
by (25.6k points)

Related questions

0 votes
1 answer
Exam 2019.08.27 Problem 7
asked Feb 6, 2021 in * TF "Emb. Sys. and Rob." by dn (1.4k points)
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
LTL to ω-automata Exam 2018.08.21 7a
asked Aug 31, 2022 in * TF "Emb. Sys. and Rob." by anbilli (610 points)
0 votes
1 answer
Exam Paper 21-08-2018 : LTL- CTL
asked Jan 13, 2021 in * TF "Emb. Sys. and Rob." by MS (1.1k points)
 | Snow Theme by Q2A Market
Powered by Question2Answer
Imprint | Privacy Policy
...