Using Probabilistic Kleene Algebra for Protocol Verification

DOI10.1007/11828563_20MaRDI QIDQ5459189zbMATH OpenOpenAlexFDO

Authors

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

Kleene algebraprobabilistic systemsprobabilistic verification

Mathematics Subject Classification ID

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

Recommendations

• Using probabilistic Kleene algebra pKA for protocol verification
• Probabilistic concurrent Kleene algebra
• Verification of multiprocess probabilistic protocols
• Concurrent Kleene Algebra
• Probabilistic communicating processes

Cited in

(14)

• Towards a linear algebra of programming
• Refinement algebra for probabilistic programs
• Reactive Probabilistic Programs and Refinement Algebra
• Modal Semirings Revisited
• Modeling Routing Protocols in Adhoc Networks
• Relations into algebras of probabilistic distributions
• Generalising KAT to Verify Weighted Computations
• Normal forms in total correctness for while programs and action systems
• Weighted synchronous automata
• VPHL: a verified partial-correctness logic for probabilistic programs
• Kleene algebra with commutativity conditions is undecidable
• Ping-pong protocols as prefix grammars: modelling and verification via program transformation
• Using probabilistic Kleene algebra pKA for protocol verification
• Algebraic reasoning for probabilistic action systems and while-loops

This page was built for publication: Using Probabilistic Kleene Algebra for Protocol Verification

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5459189)