| Process algebra with combinators (1994) | |||||||||||||||||
Abstract | |||||||||||||||||
| Abstract. We introduce typed combinatory process algebra, a system combining process algebra with types and combinators. We describe its syntax and semantics, and by way of example, verify within this framework the Simple Alternating Bit Protocol. Key Words & Phrases: protocol verification, process algebra, typed combinatory logic. | |||||||||||||||||
Details der Publikation | |||||||||||||||||
| |||||||||||||||||