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

1.2k questions

1.3k answers

1.7k comments

595 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 local-model-checking mu-calculus sequent-calculus automata se1 lo2 bdd simplex greatest-simulation temporal vrs_lecture kripke rosy_exam zdd2fdd studiengang_reform bdd2fdd exists-algorithm simulation tool fourier_motzkin equivalance bdd2zdd studiengangswechsel symbolic_computation fdd2zdd ctl_model_checking fdd2bdd floating_point_arithmetic snf induction breakpoint zdd curriculum_change vrs_cheatsheet 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 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

CTL* MODEL CHECKING

0 votes

In the result of first question,  a holds infinitely often so how F!a holds and satisfies S1?  

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

1 Answer

0 votes
Well, also !a holds infinitely, often and GF phi implies F phi, so F!a is always true on the path of the structure.
by (172k points)

Related questions

0 votes
1 answer
Global Model Checking Initial states
asked Sep 1, 2024 in * TF "Emb. Sys. and Rob." by P (180 points)
0 votes
1 answer
CTL* model checking
asked Aug 25, 2023 in * TF "Emb. Sys. and Rob." by zain (440 points)
 | Snow Theme by Q2A Market
Powered by Question2Answer
Imprint | Privacy Policy
...