Process algebra with combinators
Publication date
1994
Authors
Bergstra, J.A.
Bethke, I.
Ponse, A.
Editors
Advisors
Supervisors
DOI
Document Type
Article in proceedings
Metadata
Show full item recordCollections
License
Abstract
We introduce typed combinatory process algebra, a system
combining process Mgebra with types and combinators. We describe its
syntax and semantics, and by way of example, verify within this framework
the Simple Alternating Bit Protocol.
Keywords
protocol verification, process algebra, typed combinatory logic