A process algebraic view of I/O automata

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, 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 quiescent preorder relation over recursion free processes with input and output. Finally, we give some example specifications and use them to show the methodology of verification based on our algebraic approach.

[1]  R. J. vanGlabbeek.  The linear time - branching time spectrum , 1990 .

[2]  Robert de Simone,et al.  Higher-Level Synchronising Devices in Meije-SCCS , 1985, Theor. Comput. Sci..

[3]  Jan Friso Groote,et al.  Structural Operational Semantics and Bisimulation as a Congruence (Extended Abstract) , 1989, ICALP.

[4]  Nancy A. Lynch,et al.  Hierarchical correctness proofs for distributed algorithms , 1987, PODC '87.

[5]  Matthew Hennessy,et al.  Algebraic theory of processes , 1988, MIT Press series in the foundations of computing.

[6]  Frits W. Vaandrager,et al.  Turning SOS Rules into Equations , 1994, Inf. Comput..

[7]  Rocco De Nicola,et al.  Testing Equivalences for Processes , 1984, Theor. Comput. Sci..

[8]  Anne Kaldewaij.  The Translation of Processes into Circuits , 1987, PARLE.

[9]  David Park,et al.  Concurrency and Automata on Infinite Sequences , 1981, Theoretical Computer Science.

[10]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[11]  Albert R. Meyer,et al.  Bisimulation can't be traced , 1988, POPL '88.

[12]  C. A. R. Hoare,et al.  Communicating sequential processes , 1978, CACM.

[13]  Rocco De Nicola,et al.  Testing Equivalences and Fully Abstract Models for Communicating Processes , 1985 .

[14]  Frits W. Vaandrager,et al.  On the relationship between process algebra and input/output automata , 1991, [1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science.

[15]  Bengt Jonsson,et al.  A model and proof system for asynchronous networks , 1985, PODC '85.