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

532 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

could you please explain this? with an example?

0 votes
related to an answer for: [VRS] Sheet 4 Q1 from Semantics of Predecessors and Successors
in * TF "Emb. Sys. and Rob." by (380 points)

1 Answer

0 votes
Well, simply look at the definitions on slide 54 of chapter 4 and apply them to the complete set S or the empty set {} respectively. The results are then shown on slide 56 (which effectively contains multiple examples).
by (3.4k points)
Thank you. I will check.
by (380 points)

Related questions

 | Snow Theme by Q2A Market
Powered by Question2Answer
Imprint | Privacy Policy
...