pith. sign in
Pith Number

pith:FK5TNGKZ

pith:2026:FK5TNGKZKXMT7G4N7AC5TSVRIO
not attested not anchored not stored refs resolved

Probabilistic imperative process algebra

C. A. Middelburg

An extension adds probabilistic choice operators to imperative process algebra, with probabilistic choices resolved before those in alternative and parallel composition.

arxiv:2605.18362 v1 · 2026-05-18 · cs.LO

Add to your LaTeX paper
\usepackage{pith}
\pithnumber{FK5TNGKZKXMT7G4N7AC5TSVRIO}

Prints a linked badge after your title and injects PDF metadata. Compiles on arXiv. Learn more · Embed verified badge

Record completeness

1 Bitcoin timestamp
2 Internet Archive
3 Author claim open · sign in to claim
4 Citations open
5 Replications open
Portable graph bundle live · download bundle · merged state
The bundle contains the canonical record plus signed events. A mirror can host it anywhere and recompute the same current state with the deterministic merge algorithm.

Claims

C1strongest claim

An extension of that process algebra with probabilistic choice operators is presented that rests on the principle that probabilistic choices are always resolved before choices involved in alternative composition and parallel composition are resolved.

C2weakest assumption

That the proposed resolution ordering for probabilistic choices can be defined consistently within the existing imperative process algebra and yields a useful framework for specifying and verifying probabilistic algorithms in distributed computing.

C3one line summary

Extends imperative process algebra with probabilistic choice operators resolved before alternative and parallel compositions to model distributed computing algorithms such as leader election and consensus.

References

25 extracted · 25 resolved · 0 Pith anchors

[1] In: Nielsen, M., et al 2009
[2] John Wiley and Sons, Hoboken, NJ, second edn 2004
[3] Information and Control78(3), 205–245 (1988) 1988
[4] Baeten, J.C.M., Bergstra, J.A.: Process algebra with signals and conditions. In: Broy, M. (ed.) Programming and Mathematical Methods. NATO ASI Series, vol. F88, pp. 273–323. Springer-Verlag (1992) 1992
[5] Baeten, J.C.M., Weijland, W.P.: Process Algebra, Cambridge Tracts in Theoretical Computer Science, vol. 18. Cambridge University Press, Cambridge (1990) 1990

Formal links

2 machine-checked theorem links

Receipt and verification
First computed 2026-05-20T00:05:57.203355Z
Builder pith-number-builder-2026-05-17-v1
Signature Pith Ed25519 (pith-v1-2026-05) · public key
Schema pith-number/v1.0

Canonical hash

2abb36995955d93f9b8df805d9cab143a74d42a3d37bbf917d0d864b89beeb20

Aliases

arxiv: 2605.18362 · arxiv_version: 2605.18362v1 · doi: 10.48550/arxiv.2605.18362 · pith_short_12: FK5TNGKZKXMT · pith_short_16: FK5TNGKZKXMT7G4N · pith_short_8: FK5TNGKZ
Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/FK5TNGKZKXMT7G4N7AC5TSVRIO \
  | jq -c '.canonical_record' \
  | python3 -c "import sys,json,hashlib; b=json.dumps(json.loads(sys.stdin.read()), sort_keys=True, separators=(',',':'), ensure_ascii=False).encode(); print(hashlib.sha256(b).hexdigest())"
# expect: 2abb36995955d93f9b8df805d9cab143a74d42a3d37bbf917d0d864b89beeb20
Canonical record JSON
{
  "metadata": {
    "abstract_canon_sha256": "e1fc066befeae7de3b5e18a40328921bf05f360edd1bbedf04322485dc24e445",
    "cross_cats_sorted": [],
    "license": "http://creativecommons.org/licenses/by-nc-nd/4.0/",
    "primary_cat": "cs.LO",
    "submitted_at": "2026-05-18T13:13:32Z",
    "title_canon_sha256": "06ea23539980e294376f527cd3719ce12d879dd5683ff48988c827d39b4cd03d"
  },
  "schema_version": "1.0",
  "source": {
    "id": "2605.18362",
    "kind": "arxiv",
    "version": 1
  }
}