Using Probabilistic Kleene Algebra for Protocol Verification
From MaRDI portal
Publication:5459189
DOI10.1007/11828563_20zbMath1134.68415MaRDI 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
68Q60: Specification and verification (program logics, model checking, etc.)
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
68M12: Network protocols
Related Items
Weighted synchronous automata, VPHL: a verified partial-correctness logic for probabilistic programs, Relations into algebras of probabilistic distributions, Normal forms in total correctness for while programs and action systems, Algebraic reasoning for probabilistic action systems and while-loops, 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