Communicating sequential processes
Communicating sequential processes
Modeling concurrency with partial orders
International Journal of Parallel Programming
Hierarchical correctness proofs for distributed algorithms
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Theoretical Computer Science - Special issue on the Thirteenth Colleque sur les Arbres en Alge`bre et en Programmation Nancy, March 1988
An interleaving model for real time
JCIT Proceedings of the fifth Jerusalem conference on Information technology
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
Complexity results for POMSET languages
SIAM Journal on Discrete Mathematics
IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
Refinement of actions and equivalence notions for concurrent systems
Acta Informatica
Proceedings of the 8th European software engineering conference held jointly with 9th ACM SIGSOFT international symposium on Foundations of software engineering
Communication and Concurrency
Interface Theories for Component-Based Design
EMSOFT '01 Proceedings of the First International Workshop on Embedded Software
Alternating Refinement Relations
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
Interface Automata with Complex Actions
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
Many formalisms use interleaving to model concurrency. To describe some system behaviours appropriately, we need to limit interleaving. For example, in a component-based system, we might wish to limit interleaving to force the inputs to a method to arrive together in order. InWeb services, the arrival of XML messages consisting of multiple simple parts should not be interleaved with the behaviour of another component. We introduce interface automata with complex actions (IACA), which adds 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 operation and refinement relation 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. We provide proofs of various properties of IACA and discuss the use of IACA for modellingWeb services.