IWIM Semantics via Fibred Automata

Banach, R., Arbab, F., Papadopoulos, G. A. and Glauert, J. R. W. (2002) IWIM Semantics via Fibred Automata. Electronic Notes in Theoretical Computer Science, 66 (4). pp. 1-15. ISSN 1571-0661

Full text not available from this repository. (Request a copy)

Abstract

Coordination programming helps to separate concerns in the programming of the coordination activities in complex applications software. It separates the development, verification, maintenance, and reuse of the coordination and communication protocols, from the development of the rest of the application; coincidentally making these entities into standalone products. The IWIM coordination model is briefly reviewed, and a formal automata theoretic version of the model is developed, capturing the essentials of the framework in a fibration based approach. Specifically, families of worker automata have their communication governed by a state of a manager automaton, whose transitions correspond to reconfigurations.

Item Type: Article
Faculty \ School: Faculty of Science > School of Computing Sciences
Depositing User: Vishal Gautam
Date Deposited: 13 Jun 2011 12:47
Last Modified: 21 Apr 2020 20:40
URI: https://ueaeprints.uea.ac.uk/id/eprint/22729
DOI: 10.1016/S1571-0661(04)80446-8

Actions (login required)

View Item View Item