A Theory of Communicating Sequential Processes
Journal of the ACM (JACM)
Hierarchical correctness proofs for distributed algorithms
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Proceedings of the 8th European software engineering conference held jointly with 9th ACM SIGSOFT international symposium on Foundations of software engineering
Interface Theories for Component-Based Design
EMSOFT '01 Proceedings of the First International Workshop on Embedded Software
Concurrent Logic and Automata Combined: A Semantics for Components
Electronic Notes in Theoretical Computer Science (ENTCS)
An algebraic definition of simulation between programs
IJCAI'71 Proceedings of the 2nd international joint conference on Artificial intelligence
Modular analysis of dataflow process networks
FASE'03 Proceedings of the 6th international conference on Fundamental approaches to software engineering
Ticc: a tool for interface compatibility and composition
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
Behaviour Protocols for Interacting Stateful Components
Electronic Notes in Theoretical Computer Science (ENTCS)
A modal interface theory with data constraints
SBMF'10 Proceedings of the 13th Brazilian conference on Formal methods: foundations and applications
Building a modal interface theory for concurrency and data
WADT'10 Proceedings of the 20th international conference on Recent Trends in Algebraic Development Techniques
Tool support for agent-based systems in ptolemy
Proceedings of the International Workshop on Security and Dependability for Resource Constrained Embedded Systemss
| Hi-index | 0.00 |
Interface automata are light-weight models that capture the temporal interface behavior of software components. They have the ability to model both the input requirements and the output behavior of a component. They support the compatibility check between interface models to ensure a correct interaction between components and they adopt an alternating simulation approach to design refinement. In this paper, we extend our previous works on checking interface automata interoperability by adapting their alternating refinement relation to the action semantics. We show the relation between pre and post-conditions of transitions in the abstract version of an interface and their corresponding ones in its concrete version. We illustrate our extensions by a case study of the CyCab car component-based system.