2/3 alternating simulation between interface automata

Authors:
Yanjun Wen;Ji Wang;Zhichang Qi
Affiliations:
National Laboratory for Parallel and Distributed Processing, Changsha, P.R. China;National Laboratory for Parallel and Distributed Processing, Changsha, P.R. China;National Laboratory for Parallel and Distributed Processing, Changsha, P.R. China
Venue:
ICFEM'05 Proceedings of the 7th international conference on Formal Methods and Software Engineering
Year:
2005

Citing 9
Cited 0

A Theory of Communicating Sequential Processes

Journal of the ACM (JACM)
Bisimulation through probabilistic testing

Information and Computation
Formalizing architectural connection

ICSE '94 Proceedings of the 16th international conference on Software engineering
A formal basis for architectural connection

ACM Transactions on Software Engineering and Methodology (TOSEM)
Interface automata

Proceedings of the 8th European software engineering conference held jointly with 9th ACM SIGSOFT international symposium on Foundations of software engineering
Communication and Concurrency

Communication and Concurrency
Interface Theories for Component-Based Design

EMSOFT '01 Proceedings of the First International Workshop on Embedded Software
Interface Compatibility Checking for Software Modules

CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Modular analysis of dataflow process networks

FASE'03 Proceedings of the 6th international conference on Fundamental approaches to software engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

Interface automata is a light-weight formalism to be used for describing the temporal interface behaviors of software components. This paper investigates the refinement of interface automatons and shows its application to serve as a semantic foundation for software architectural description languages. Firstly, inspired by 2/3 simulation, the 2/3alternating simulation between interface automaton is presented, and the corresponding refinement relation is also derived between interface automaton. The distinguished feature is that it can preserve deadlock-freedom. Then, a concise formal semantics is provided for the architectural description language Wright, based on interface automaton, where the checking of compatibility and deadlock-freedom becomes simpler.