relation: http://eprints.imtlucca.it/366/
title: A Process Algebraic View of Input/Output Automata
creator: De Nicola, Rocco
creator: Segala, Roberto
subject: QA75 Electronic computers. Computer science
description: 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.
publisher: Elsevier
date: 1995
type: Article
type: PeerReviewed
identifier:   De Nicola, Rocco and Segala, Roberto  A Process Algebraic View of Input/Output Automata.  Theoretical Computer Science, 138 (2).  pp. 391-423.  ISSN 0304-3975      (1995)  
relation: http://www.sciencedirect.com/science/article/pii/030439759592307J
relation: 10.1016/0304-3975(95)92307-J