{
  "literature_regression_translation": {
    "A_expression": "((a+c)||b) + (a||b) + (a||(b+c))",
    "B_expression": "((a+c)||b) + (a||(b+c))",
    "key_extra_A_branch": "a3 || b3 with no c alternative",
    "model_type": "finite event structure with conflict/concurrency and no nontrivial causality"
  },
  "configuration_counts": {
    "A": 14,
    "B": 11
  },
  "hp_result": {
    "initial_configs_related": true,
    "relation_size": 17,
    "fixed_point_rounds": 2,
    "middle_branch_matchings": [
      {
        "right_config": [
          "a1p",
          "b1p"
        ],
        "mapping": [
          [
            "a3",
            "a1p"
          ],
          [
            "b3",
            "b1p"
          ]
        ]
      },
      {
        "right_config": [
          "a2p",
          "b2p"
        ],
        "mapping": [
          [
            "a3",
            "a2p"
          ],
          [
            "b3",
            "b2p"
          ]
        ]
      }
    ]
  },
  "hhp_explicit_backward_result": {
    "initial_configs_related": false,
    "relation_size": 0,
    "fixed_point_rounds": 7
  },
  "hhp_downward_closure_crosscheck": {
    "initial_configs_related": false,
    "relation_size": 0,
    "fixed_point_rounds": 6,
    "same_relation_as_explicit_backward": true
  },
  "regression_assertion": {
    "HP": true,
    "HHP_explicit_backward": false,
    "expected_HP_true_HHP_false": true
  },
  "interpretation": "The finite translation reproduces the classical separation mechanism: plain HP can match A's pure parallel a3/b3 branch to different B branches depending on which independent action is seen first; explicit backward matching removes that order-dependent remapping freedom.",
  "warning": "This is a finite event-structure translation of the literature's process-expression counterexample, not a Petri-net token-level reproduction of the original figure."
}