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

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 (166k points)

Related questions

0 votes
1 answer
CTL* model checking
asked Aug 25, 2023 in * TF "Emb. Sys. and Rob." by zain (440 points)
0 votes
1 answer
Doubt in Local Model Checking
asked Jan 15 in * TF "Emb. Sys. and Rob." by A (360 points)
 | Snow Theme by Q2A Market
Powered by Question2Answer
Imprint | Privacy Policy
...