eprintid: 366
rev_number: 9
eprint_status: archive
userid: 32
dir: disk0/00/00/03/66
datestamp: 2011-06-13 10:40:49
lastmod: 2011-07-11 14:36:27
status_changed: 2011-06-13 10:40:49
type: article
metadata_visibility: show
item_issues_count: 0
creators_name: De Nicola, Rocco
creators_name: Segala, Roberto
creators_id: r.denicola@imtlucca.it
creators_id: 
title: A Process Algebraic View of Input/Output Automata
ispublished: pub
subjects: QA75
divisions: CSA
full_text_status: none
abstract: 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.
date: 1995
date_type: published
publication: Theoretical Computer Science
volume: 138
number: 2
publisher: Elsevier
pagerange: 391-423
id_number: 10.1016/0304-3975(95)92307-J
refereed: TRUE
issn: 0304-3975
official_url: http://www.sciencedirect.com/science/article/pii/030439759592307J
funders: Partially supported by “Progetto Finalizzato Sistemi Informatici e Calcolo Parallelo”, contract no.91.00894.69 and by Istituto di Elaborazione dell'Informazione of CNR at Pisa.
citation:   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)