Using Probabilistic Kleene Algebra for Protocol Verification

DOI10.1007/11828563_20zbMath1134.68415OpenAlexW2096169751MaRDI QIDQ5459189

No author found.

Publication date: 24 April 2008

Published in: Relations and Kleene Algebra in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11828563_20

zbMATH Keywords

probabilistic verificationKleene algebraprobabilistic systems

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Network protocols (68M12)

Related Items

Weighted synchronous automata ⋮ Reactive Probabilistic Programs and Refinement Algebra ⋮ Relations into algebras of probabilistic distributions ⋮ Towards a linear algebra of programming ⋮ Modal Semirings Revisited ⋮ VPHL: a verified partial-correctness logic for probabilistic programs ⋮ Algebraic reasoning for probabilistic action systems and while-loops ⋮ Normal forms in total correctness for while programs and action systems ⋮ Refinement algebra for probabilistic programs ⋮ Modeling Routing Protocols in Adhoc Networks