A Process Algebraic View of I/O Automata

Author(s)
Segala, Roberto
Thumbnail
DownloadMIT-LCS-TR-557.pdf (8.964Mb)
Advisor
Lynch, Nancy A.
Metadata
Show full item record
Abstract
The Input/Output Automata formalism of Lynch and Tuttle is a widely used framework for the specification and verification of concurrent algorithms. Unfortunately, it has never been provided with an algebraic characterization, a formalization which has been fundamental for the success of theories like CSP, CCP and ACP.
Date issued
1992-06
URI
https://hdl.handle.net/1721.1/149733
Series/Report no.
MIT-LCS-TR-557
Collections