Communicating sequential processes
Communicating sequential processes
A behavioral notion of subtyping
ACM Transactions on Programming Languages and Systems (TOPLAS)
Computer networks (3rd ed.)
A formal basis for architectural connection
ACM Transactions on Software Engineering and Methodology (TOSEM)
Behavior Protocols for Software Components
IEEE Transactions on Software Engineering
Computing simulations on finite and infinite graphs
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
DiPS: A Unifying Approach for Developing System Software
HOTOS '01 Proceedings of the Eighth Workshop on Hot Topics in Operating Systems
Towards Formalizing Behavioral Substitutability in Component Frameworks
SEFM '04 Proceedings of the Software Engineering and Formal Methods, Second International Conference
Models and Temporal Logics for Timed Component Connectors
SEFM '04 Proceedings of the Software Engineering and Formal Methods, Second International Conference
Developing dynamic-reconfigurable communication protocol stacks using Java: Research Articles
Software—Practice & Experience
On Compatibility and Behavioural Substitutability of Component Protocols
SEFM '05 Proceedings of the Third IEEE International Conference on Software Engineering and Formal Methods
Design and implementation of a dynamic protocol framework
Computer Communications
FSEN'07 Proceedings of the 2007 international conference on Fundamentals of software engineering
Program compatibility approaches
FMCO'05 Proceedings of the 4th international conference on Formal Methods for Components and Objects
Dynamic component substitutability analysis
FM'05 Proceedings of the 2005 international conference on Formal Methods
FSEN'07 Proceedings of the 2007 international conference on Fundamentals of software engineering
Design and implementation of a dynamic-reconfigurable architecture for protocol stack
FSEN'07 Proceedings of the 2007 international conference on Fundamentals of software engineering
| Hi-index | 0.00 |
A communication protocol consists of a sequence of messages used by peer entities to communicate. Each entity in a network is equipped by at least one protocol stack. Due to the need for on-the-fly reconfiguration of protocol stack in future communication and computation devices, formalizing substitutability and compatibility of protocol entities are important in correctness assessment of dynamic reconfiguration. In this paper, we extend Constraint Automata and propose I/O-Constraint Automata to model behavior of protocols and propose enough formalism for substitutability and compatibility relations between protocols. We introduce input-blocking property of communication protocols, and show that in the context of communication protocols simulation relation is not strong enough for notion of substitutability. We show the relation between substitutability and compatibility to reason about the correctness in substitution of a protocol with a new one.