TY  - JOUR
Y1  - 1995///
SP  - 391
A1  - De Nicola, Rocco
A1  - Segala, Roberto
SN  - 0304-3975
EP  - 423
PB  - Elsevier
VL  - 138
UR  - http://www.sciencedirect.com/science/article/pii/030439759592307J
IS  - 2
N2  - Input/output automata are a widely used formalism for the specification and verification of concurrent algorithms. Unfortunately, they lack an algebraic characterization, a formalization which has been fundamental for the success of theories like CSP, CCS and ACP. We present a many-sorted algebra for I/O automata that takes into account notions such as interface, input enabling, and local control. It is sufficiently expressive for representing all finitely branching transition systems; hence, all I/O automata with a finitely branching transition relation. Our presentation includes a complete axiomatization of the external trace preorder relation over recursion-free processes with input and output.
JF  - Theoretical Computer Science
AV  - none
ID  - eprints366
TI  - A Process Algebraic View of Input/Output Automata
ER  -