Interface Input/Output Automata

Building on the theory of interface automata by de Alfaro and Henzinger we design an interface language for Lynch's I/O automata, a popular formalism used in the development of distributed asynchronous systems, not addressed by previous interface research. We introduce an explicit separation of assumptions from guarantees not yet seen in other behavioral interface theories. Moreover we derive the composition operator systematically and formally, guaranteeing that the resulting compositions are always the weakest in the sense of assumptions, and the strongest in the sense of guarantees. We also present a method for solving systems of relativized behavioral inequalities as used in our setup and draw a formal correspondence between our work and interface automata.

[1]  Patrick Maier.  Compositional Circular Assume-Guarantee Rules Cannot Be Sound and Complete , 2003, FoSSaCS.

[2]  Jakob Rehof,et al.  Conformance Checking for Models of Asynchronous Message Passing Software , 2002, CAV.

[3]  Kim G. Larsen,et al.  A modal process logic , 1988, [1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science.

[4]  Thomas A. Henzinger,et al.  INTERFACE-BASED DESIGN , 2005 .

[5]  Nancy A. Lynch,et al.  I/o automata: a model for discrete event systems , 1988 .

[6]  Thomas A. Henzinger,et al.  Timed Interfaces , 2002, EMSOFT.

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

[8]  Jeffrey D. Ullman,et al.  Introduction to automata theory, languages, and computation, 2nd edition , 2001, SIGA.

[9]  Atsushi Igarashi,et al.  A generic type system for the Pi-calculus , 2001, POPL '01.

[10]  K. Larsen,et al.  Online Testing of Real-time Systems Using Uppaal , 2004, FATES.

[11]  Kim G. Larsen,et al.  Color-Blind Specifications for Transformations of Reactive Synchronous Programs , 2005, FASE.

[12]  Thomas A. Henzinger,et al.  Alternating Refinement Relations , 1998, CONCUR.

[13]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[14]  Thomas A. Henzinger,et al.  Resource Interfaces , 2003, EMSOFT.

[15]  Thomas A. Henzinger,et al.  Interface automata , 2001, ESEC/FSE-9.

[16]  Edward A. Lee,et al.  A behavioral type system and its application in Ptolemy II , 2004, Formal Aspects of Computing.

[17]  Robin Milner,et al.  A Compositional Protocol Verification Using Relativized Bisimulation , 1992, Inf. Comput..

[18]  Kim G. Larsen,et al.  Equation solving using modal transition systems , 1990, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science.

[19]  Kim G. Larsen.  A Context Dependent Equivalence Between Processes , 1987, Theor. Comput. Sci..

[20]  Edward A. Lee,et al.  Causality Interfaces and Compositional Causality Analysis 1 , 2005 .

[21]  K. Larsen.  Context-dependent bisimulation between processes , 1986 .

[22]  Andrzej Wasowski,et al.  Interface Input/Output Automata: Splitting Assumptions from Guarantees , 2006 .