[Imprint][Data Privacy Statement][E-Mail]

Back to main index. View the specification. View theorem base summary, View theorem base listing, the used properties by spec, the dependency list, the symbol table,

Specification branchingIOforward
enrich
   C-IO-Automaton, 
   traceA
with
   

   
   
   
   predicates  ≤bF : CIOAutomaton × AIOAutomaton;
               bfwsim : CIOAutomaton × AIOAutomaton × (astate × cstate → bool);
   
   variables  r : astate × cstate → bool;
              cs : cstate;
              al : actionlist;
   
   

   

   axioms branchingforwardsim-def :  ⊦ ≤bF(cioaut, aioaut) ↔ (∃ r. bfwsim(cioaut, aioaut, r));
          proofobls-branchingforwardsim
          : ⊦   bfwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), r)
              ↔   (∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as)))
                ∧ (∀ cs, a, cs0, as. 
                       r(as, cs) ∧ cstepf(cs, a, cs0)
                     → (a = τ
                       ⊃ r(as, cs0)
                       ;∃ asl, al, as1. 
                            afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ ⌜al⌝  ^ = [] ∧ hd(asl) = as ∧ (∀ as. as ∈ asl → r(as, cs))
                          ∧ astepf(asl.last, a, as1) ∧ r(as1, cs0)
                       ));

   

   
end enrich