Datenvertragswerk
acyclic automata probabilistic refinement witness
For two finite action-labelled nondeterministic probabilistic automata return the WHOLE greatest DIRECTED STRONG SIMULATION relation, canonical single-transition matching couplings and exhaustive local negative Hall obstructions. Each of 1..3 original states has observation0/1; at most4 distinct indexed transitions per model, action0/1, stochastic probabilities0,1/2,1; positive-support graph must be a DAG. Equal observations and every left transition must match ONE right transition of the.
POST https://datenvertrag.halowerk.com/v1/acyclic-automata-probabilistic-refinement-witnessInputs
| Field | Type | Required | Description |
|---|---|---|---|
| left | See schema | Yes | |
| right | See schema | Yes | |
| claim_relation | See schema | Yes |
Show full input schema
{
"type": "object",
"additionalProperties": false,
"required": [
"left",
"right",
"claim_relation"
],
"properties": {
"left": {
"anyOf": [
{
"type": "object",
"additionalProperties": false,
"required": [
"observations",
"transitions"
],
"properties": {
"observations": {
"type": "array",
"minItems": 1,
"maxItems": 3,
"items": {
"enum": [
0,
1
]
}
},
"transitions": {
"type": "array",
"minItems": 0,
"maxItems": 4,
"items": {
"type": "object",
"additionalProperties": false,
"required": [
"source",
"action",
"probability"
],
"properties": {
"source": {
"type": "integer",
"minimum": 0,
"maximum": 2
},
"action": {
"enum": [
0,
1
]
},
"probability": {
"type": "array",
"minItems": 1,
"maxItems": 3,
"items": {
"enum": [
"0",
"1/2",
"1"
]
}
}
}
}
}
}
},
{
"type": "null"
}
]
},
"right": {
"anyOf": [
{
"type": "object",
"additionalProperties": false,
"required": [
"observations",
"transitions"
],
"properties": {
"observations": {
"type": "array",
"minItems": 1,
"maxItems": 3,
"items": {
"enum": [
0,
1
]
}
},
"transitions": {
"type": "array",
"minItems": 0,
"maxItems": 4,
"items": {
"type": "object",
"additionalProperties": false,
"required": [
"source",
"action",
"probability"
],
"properties": {
"source": {
"type": "integer",
"minimum": 0,
"maximum": 2
},
"action": {
"enum": [
0,
1
]
},
"probability": {
"type": "array",
"minItems": 1,
"maxItems": 3,
"items": {
"enum": [
"0",
"1/2",
"1"
]
}
}
}
}
}
}
},
{
"type": "null"
}
]
},
"claim_relation": {
"anyOf": [
{
"type": "array",
"minItems": 1,
"maxItems": 3,
"items": {
"type": "array",
"minItems": 1,
"maxItems": 3,
"items": {
"type": "boolean"
}
}
},
{
"type": "null"
}
]
}
}
}Published input example
{
"left": {
"observations": [
0,
0
],
"transitions": [
{
"source": 0,
"action": 0,
"probability": [
"0",
"1"
]
}
]
},
"right": {
"observations": [
0,
0
],
"transitions": [
{
"source": 0,
"action": 0,
"probability": [
"0",
"1"
]
},
{
"source": 0,
"action": 1,
"probability": [
"0",
"1"
]
}
]
},
"claim_relation": [
[
true,
false
],
[
true,
true
]
]
}Result & documentation
Machine-readable documentation of this hub
Source of this page: the published HALOWERK catalog. Updated: 2026-11-17 UTC.
More endpoints in this hub
- Datenvertragswerk0.003 USDC
adjacency cospectral graph family
POSThttps://datenvertrag.halowerk.com/v1/adjacency-cospectral-graph-familyGiven n in 1..5 and a monic degree-n integer polynomial det(xI-A), returns every labelled simple undirected graph on vertices 0..n-1 with exactly that adjacency characteristic polynomial. Coefficients are in descending degree order, n+1 ent
- Datenvertragswerk0.003 USDC
adjacent swap permutation tour
POSThttps://datenvertrag.halowerk.com/v1/adjacent-swap-permutation-tourFor 0 to 5 labels starting at zero, construct the whole Steinhaus-Johnson-Trotter permutation tour from identity. Each transition swaps the largest mobile value with its adjacent smaller neighbor, then reverses directions of greater values.
- Datenvertragswerk0.003 USDC
affine floor sum lattice ledger
POSThttps://datenvertrag.halowerk.com/v1/affine-floor-sum-lattice-ledgerReconstruct the complete AFFINE FLOOR-SUM lattice ledger for original integers n0..8,m1..8,a0..8,b0..8. For each original column i=0..n-1, quotients[i]=floor((a*i+b)/m) and remainders[i]=a*i+b-m*quotients[i], with0<=remainder<m. prefix_sums