Reasoning about probabilistic sequential programs in a probabilistic logic

DOI10.1007/s00236-003-0113-zzbMath1060.68073OpenAlexW1995410278MaRDI QIDQ1424351

Ming Sheng Ying

Publication date: 11 March 2004

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00236-003-0113-z

zbMATH Keywords

strong monotonicity of probabilistic predicate transformers

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (7)

Similarity mass and approximate reasoning ⋮ Value-passing CCS with noisy channels ⋮ \(L\)-fuzzy strongest postcondition predicate transformers as \(L\)-idempotent linear or affine operators between semimodules of monotonic predicates ⋮ Semantics of non-deterministic possibility computation ⋮ Predicate transformers for extended probability and non-determinism ⋮ Domain semantics of possibility computations ⋮ \(\pi\)-calculus with noisy channels

This page was built for publication: Reasoning about probabilistic sequential programs in a probabilistic logic