Interface Automata with Complex Actions

Authors:
Shahram Esmaeilsabzali;Farhad Mavaddat;Nancy A. Day
Affiliations:
School of Computer Science, University of Waterloo, Waterloo, Ontario, Canada N2L 3G1;School of Computer Science, University of Waterloo, Waterloo, Ontario, Canada N2L 3G1;School of Computer Science, University of Waterloo, Waterloo, Ontario, Canada N2L 3G1
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2006

Citing 8
Cited 3

Hierarchical correctness proofs for distributed algorithms

PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Communication and concurrency

Communication and concurrency
A2CCS: atomic actions for CCS

Theoretical Computer Science - Special issue on the Thirteenth Colleque sur les Arbres en Alge`bre et en Programmation Nancy, March 1988
The temporal logic of reactive and concurrent systems

The temporal logic of reactive and concurrent systems
Action refinement in process algebras

Action refinement in process algebras
The Model Checker SPIN

IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
Refinement of actions and equivalence notions for concurrent systems

Acta Informatica
Interface Theories for Component-Based Design

EMSOFT '01 Proceedings of the First International Workshop on Embedded Software

Interface Automata with Complex Actions: Limiting Interleaving in Interface Automata

Fundamenta Informaticae - Behavior of Composed Concurrent Systems: Logic and Reasoning
A review on specifying software architectures using extended automata-based models

FSEN'07 Proceedings of the 2007 international conference on Fundamentals of software engineering
Interface Automata with Complex Actions: Limiting Interleaving in Interface Automata

Fundamenta Informaticae - Behavior of Composed Concurrent Systems: Logic and Reasoning

Quantified Score

Hi-index	0.01

Visualization

Abstract

Many formalisms use interleaving to model concurrency. To describe some system behaviours appropriately, we need to limit interleaving. For example, in component-based systems, we wish to limit interleaving to force the inputs to a method to arrive together in order. We introduce interface automata with complex actions (IACA), which add complex actions to de Alfaro and Henzinger's interface automata (IA). A complex action is a sequence of actions that may not be interleaved with actions from other components. The composition and refinement operations are more involved in IACA compared to IA, and we must sacrifice associativity of composition. However, we argue that the advantages of having complex actions make it a useful formalism.