We are experiencing minor difficulties with our submission forms, which we are working to resolve. If you have any issues while submitting items, please contact us at dspace-lib@mit.edu.

A Process Algebraic View of I/O Automata

Thumbnail Image
Download
Name

MIT-LCS-TR-557.pdf

Size

8.96 MB

Format

Adobe PDF

Checksum (MD5)

919894fafa00119f590dbc4171438fe1

Author(s)
Segala, Roberto
Advisor(s)
Lynch, Nancy A.
Date Issued
June 1992
Series/Report no.
MIT-LCS-TR-557
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.
Persistent DSpace Link
PrivacyPermissionsAccessibilityContact us
Notify us about copyright concerns.