[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 IObackward-INV
enrich
   traceA, 
   traceC
with
   

   
   
   
   predicates  ≤BI : CIOAutomaton × AIOAutomaton;
               bwsim : CIOAutomaton × AIOAutomaton × (cstate × astate → bool) × (cstate → bool) × (astate → bool);
               ≤B : CIOAutomaton × AIOAutomaton;
               bwsim : CIOAutomaton × AIOAutomaton × (cstate × astate → bool);
               ≤wB : CIOAutomaton × AIOAutomaton;
               weakbwsim : CIOAutomaton × AIOAutomaton × (cstate × astate → bool) × (astate → bool);
   
   variables  t : cstate × astate → bool;
              aINV : astate → bool;
              cINV : cstate → bool;
              cstartf : cstate → bool;
              astartf : astate → bool;
              astepf : astate × action × astate → bool;
              cstepf : cstate × action × cstate → bool;
              cs : cstate;
              as : astate;
              csf : nat → cstate;
              asf : nat → astate;
              al : actionlist;
              α : actionstream;
              asl : astatelist;
              csl : cstatelist;
              a : action;
              cσ : cstatestream;
              aσ : astatestream;
   
   

   

   axioms backwardsim-def :  ⊦ ≤B(cioaut, aioaut) ↔ (∃ t. bwsim(cioaut, aioaut, t));
          proofobls-backwardsim
          : ⊦   bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t)
              ↔   (∀ cs. ∃ as. t(cs, as)) ∧ (∀ cs, as. cstartf(cs) ∧ t(cs, as) → astartf(as))
                ∧ (∀ cs, a, cs0, as0. cstepf(cs, a, cs0) ∧ t(cs0, as0) → (∃ as. amove(AIOAut(astartf, astepf))(as, ⌜a '⌝  ^, as0) ∧ t(cs, as)));
          backwardsiminv-def :  ⊦ ≤BI(cioaut, aioaut) ↔ (∃ t, aINV, cINV. bwsim(cioaut, aioaut, t, cINV, aINV));
          proofobls-backwardsiminv
          : ⊦   bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cINV, aINV)
              ↔   (∀ cs. cstartf(cs) → cINV(cs)) ∧ (∀ as. astartf(as) → aINV(as)) ∧ (∀ cs, a, cs0. cINV(cs) ∧ cstepf(cs, a, cs0) → cINV(cs0))
                ∧ (∀ as, a, as0. aINV(as) ∧ astepf(as, a, as0) → aINV(as0)) ∧ (∀ cs. cINV(cs) → (∃ as. t(cs, as) ∧ aINV(as)))
                ∧ (∀ cs, as. cstartf(cs) ∧ t(cs, as) ∧ aINV(as) → astartf(as))
                ∧ (∀ cs, a, cs0, as0. 
                       cINV(cs) ∧ cstepf(cs, a, cs0) ∧ t(cs0, as0) ∧ aINV(as0)
                     → (∃ as. aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜a '⌝  ^, as0) ∧ t(cs, as)));
          weakbackwardsim-def :  ⊦ ≤wB(cioaut, aioaut) ↔ (∃ t, aINV. weakbwsim(cioaut, aioaut, t, aINV));
          proofobls-weakbackwardsim
          : ⊦   weakbwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, aINV)
              ↔   (∀ csl, al. cexec(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al⌝ ) → (∃ as. t(csl.last, as) ∧ aINV(as)))
                ∧ (∀ cs, as. cstartf(cs) ∧ t(cs, as) ∧ aINV(as) → astartf(as))
                ∧ (∀ asl, al. aexec(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) → aINV(asl.last))
                ∧ (∀ csl, al, a, cs0, as0. 
                       cexec(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al⌝ ) ∧ cstepf(csl.last, a, cs0) ∧ t(cs0, as0) ∧ aINV(as0)
                     → (∃ as. aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜a '⌝  ^, as0) ∧ t(csl.last, as)));

   

   
end enrich