Running Example: Abstract RS Differences #
We use the following processes from the trace running example:
PA = a.PA + a.b.0
PB = a.(PB + b.0)
b0 = b.0 (only enables b)
PBb0 = PB + b.0 (enables both a and b)
Key RS results:
abstractRSDiffExact_PA_PB_at_F: F-capability witnessesPA ≰_F PBvia the concrete observation⟨a⟩¬b: after onea-step, choose the loopingPAbranch, which refusesb, whilePBmoves toPBb0, which enablesb.abstractRSDiffExact_PB_PA_at_S: S-capability witnessesPB ≰_S PAvia the simulation observation⟨a⟩(⟨a⟩⊤ ∧ ⟨b⟩⊤): after onea-step,PBreachesPBb0, which can do bothaandb, while the two right-hand successors ofPAsplit the failure:b0cannot doa, andPAcannot dob.
PBb0 can do action a, looping back to itself.
PA can do action a, looping back to itself.
PA can do action a, reaching b0.
PB can do action a, reaching PBb0.
PBb0 can do action b, reaching zero.
b0 = b.0 cannot do action a.
The RS observation ¬a (refuse a, no positives). Capability: F.
Equations
Instances For
The RS observation ¬b (refuse b, no positives). Capability: F.
Equations
Instances For
The failure witness ⟨a⟩¬b. Capability: F.
Equations
- One or more equations did not get rendered due to their size.
Instances For
The simulation branching witness ⟨a⟩⊤ ∧ ⟨b⟩⊤. Capability: S.
Equations
- One or more equations did not get rendered due to their size.
Instances For
The simulation witness ⟨a⟩(⟨a⟩⊤ ∧ ⟨b⟩⊤). Capability: S.
Equations
- One or more equations did not get rendered due to their size.
Instances For
The executable table enumerates precisely the derivatives of its listed CCS states.
Compute the minimal capabilities derived by the finite Ready fixed point.
Equations
- One or more equations did not get rendered due to their size.
Instances For
Query whether the finite Ready fixed point refutes a capability preorder.
Equations
- One or more equations did not get rendered due to their size.
Instances For
#eval runReadyCapabilities PA {PB} #eval runReadyCapabilities PB {PA} #eval runReadyFailsAt .F PA {PB} #eval runReadyFailsAt .S PB {PA}
Equations
- One or more equations did not get rendered due to their size.
Instances For
Equations
- One or more equations did not get rendered due to their size.
Instances For
Equations
- One or more equations did not get rendered due to their size.
Instances For
Equations
- One or more equations did not get rendered due to their size.
Instances For
b0 refuses a, while PBb0 enables it.
⟨a⟩¬b distinguishes PA from PB.
The exact-pruned canonical abstraction still witnesses PA ≰_F PB.
The branching node ⟨a⟩⊤ ∧ ⟨b⟩⊤ distinguishes PBb0 from the a-successors of PA.
⟨a⟩(⟨a⟩⊤ ∧ ⟨b⟩⊤) distinguishes PB from PA.
The exact-pruned canonical abstraction still witnesses PB ≰_S PA.
The computed PA result exactly matches the semantic minimal capability set.
The computed PB result exactly matches the semantic minimal capability set.
The computed F witness result agrees with the semantic Ready abstraction.
The computed S witness result agrees with the semantic Ready abstraction.
PA is not below PB in the failure-ready witness preorder.
PB is not below PA in the simulation-ready witness preorder.
The executable F witness refutes PA ≤_F PB.
PA ≤_S PB: the exact result has only the incomparable F capability.
PB ≤_F PA: the exact result has only the incomparable S capability.
The executable S witness refutes PB ≤_S PA.