A compositional protocol verification using relativized bisimulation

DOI10.1016/0890-5401(92)90025-BzbMath0753.68067OpenAlexW2051332130MaRDI QIDQ1193593

Kim Guldstrand Larsen, Arthur J. Milner

Publication date: 27 September 1992

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0890-5401(92)90025-b

zbMATH Keywords

communicating systemsalternating bit protocolrelative bisimulation

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (3)

Focus points and convergent process operators: A proof strategy for protocol verification ⋮ Extending modal transition systems with structured labels ⋮ Unnamed Item

Uses Software

• UNITY

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bisimulation and divergence
• Calculi for synchrony and asynchrony
• Algebra of communicating processes with abstraction
• A context dependent equivalence between processes
• A calculus of communicating systems
• An axiomatic proof technique for parallel programs
• Tentative steps toward a development method for interfering programs
• Compositionality Through an Operational Semantics of Contexts
• Communicating sequential processes
• An axiomatic basis for computer programming

This page was built for publication: A compositional protocol verification using relativized bisimulation