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)
Full text not available from this repository.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.
| Item Type: | Article |
|---|---|
| Identification Number: | https://doi.org/10.1016/0304-3975(95)92307-J |
| 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. |
| Subjects: | Q Science > QA Mathematics > QA75 Electronic computers. Computer science |
| Research Area: | Computer Science and Applications |
| Depositing User: | Rocco De Nicola |
| Date Deposited: | 13 Jun 2011 10:40 |
| Last Modified: | 11 Jul 2011 14:36 |
| URI: | http://eprints.imtlucca.it/id/eprint/366 |
Actions (login required)
 |
Edit Item |
