On the progress of communication between two finite state machines
Information and Control
Testing for unboundedness of fifo channels
STACS '91 Selected papers of the 8th annual symposium on Theoretical aspects of computer science
On Communicating Finite-State Machines
Journal of the ACM (JACM)
Communication and Concurrency
Architecting families of software systems with process algebras
ACM Transactions on Software Engineering and Methodology (TOSEM)
Conformance Checking for Models of Asynchronous Message Passing Software
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Component-interaction automata as a verification-oriented component-based system specification
SAVCBS '05 Proceedings of the 2005 conference on Specification and verification of component-based systems
IEEE Transactions on Software Engineering
Specifying Fractal and GCM Components with UML
SCCC '07 Proceedings of the XXVI International Conference of the Chilean Society of Computer Science
The Common Component Modeling Example: Comparing Software Component Models
The Common Component Modeling Example: Comparing Software Component Models
Verification of programs with half-duplex communication
Information and Computation
Interface input/output automata
FM'06 Proceedings of the 14th international conference on Formal Methods
Channel properties of asynchronously composed petri nets
PETRI NETS'13 Proceedings of the 34th international conference on Application and Theory of Petri Nets and Concurrency
| Hi-index | 0.00 |
Components are strongly encapsulated behaviours which interact with the environment by exchanging messages. Interaction may, amongst others, follow a synchronous rendezvous mechanism for message exchange or an asynchronous paradigm where sending and handling a message happens at different points in time. We extend our previously defined component model by integrating synchronous and asynchronous communication. As the formal background we use I/O-transition systems and consider asynchronous communication with fifo-ordered message buffers. We identify compatibility properties that should be satisfied when components communicate along synchronous and asynchronous connectors. As a first result we show that synchronous compatibility is a sufficient condition to ensure buffered compatibility in asynchronous communications. We introduce the notion of connection-safe assemblies which requires compatibility of both kinds of communication. We define a refinement relation and show its compositionality with respect to synchronous and asynchronous connectors in connection-safe assemblies. Finally, we provide results showing the preservation of connection-safety under component refinement.