| Publication Title: |
A PROCESS ALGEBRAIC VIEW OF I/O AUTOMATA |
| Publication Author: |
Segala, R. |
| Additional Authors: |
|
| LCS Document Number: |
MIT-LCS-TR-557 |
| Publication Date: |
6-1-1992 |
| LCS Group: |
No Group Specified |
| Additional URL: |
No URL Given |
| 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. |
| To obtain this publication: |
|
|
|
To purchase a printed copy of this publication please contact
MIT
Document Services.
|