A Process Algebraic View of I/O Automata
| dc.contributor.advisor | Lynch, Nancy A. | en_US |
| dc.contributor.author | Segala, Roberto | en_US |
| dc.date.accessioned | 2023-03-29T15:19:30Z | |
| dc.date.available | 2023-03-29T15:19:30Z | |
| dc.date.issued | 1992-06 | |
| dc.identifier.uri | https://hdl.handle.net/1721.1/149733 | |
| dc.description.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. | en_US |
| dc.relation.ispartofseries | MIT-LCS-TR-557 | |
| dc.title | A Process Algebraic View of I/O Automata | en_US |
| dc.identifier.oclc | 27929888 |
