Synthesizing Glue Operators from Glue Constraints for the Construction of Component-Based Systems
We study glue operators used in component-based frameworks to obtain systems as the composition of atomic components described as labeled transition systems (LTS). Glue operators map tuples of LTS into LTS. They restrict the behavior of their arguments by performing memoryless coordination. In a previous paper, we have proposed a simple format for SOS rules that captures, in particular, glue operators from known frameworks such as CCS, SCCS, CSP, and BIP.
This paper studies a new way for characterizing glue operators: as boolean glue constraints between interactions (sets of ports) and the state of the coordinated components. We provide an SOS format for glue, which allows a natural correspondence between glue operators and glue constraints. This correspondence is used for automated synthesis of glue operators implementing given glue constraints. By focusing on the properties that do not bear computation, we reduce a very hard (and, in general, undecidable) problem of synthesizing controllers to a tractable one. The examples in the paper show that such properties are natural and can be expressed as glue constraints in a straightforward manner. Finally, we compare expressiveness of the proposed formalisms with the glue used in the BIP framework and discuss possible applications.
KeywordsInference Rule Composition Operator Label Transition System Atomic Component Rescue Robot
Unable to display preview. Download preview PDF.
- 1.Basu, A., Bozga, M., Sifakis, J.: Modeling heterogeneous real-time components in BIP. In: 4th IEEE Int. Conf. on Software Engineering and Formal Methods (SEFM 2006), pp. 3–12 (2006) Invited talkGoogle Scholar
- 3.Bloom, B.: Ready Simulation, Bisimulation, and the Semantics of CCS-Like Languages. PhD thesis, Massachusetts Institute of Technology (1989)Google Scholar
- 4.Plotkin, G.D.: A structural approach to operational semantics. Technical Report DAIMI FN-19, University of Aarhus (1981)Google Scholar
- 6.Cheng, C.P., Fristoe, T., Lee, E.A.: Applied verification: The Ptolemy approach. Technical Report UCB/EECS-2008-41, University of California at Berkeley (2008)Google Scholar
- 7.Bliudze, S., Sifakis, J.: The algebra of connectors — Structuring interaction in BIP. In: Proc. of the EMSOFT 2007, pp. 11–20. ACM SigBED, New York (2007)Google Scholar
- 9.Pnueli, A., Rosner, R.: Distributed reactive systems are hard to synthesize. In: Annual IEEE Symposium on Foundations of Computer Science vol. 2, pp. 746–757 (1990)Google Scholar
- 16.Fribourg, L., Peixoto, M.V.: Concurrent constraint automata. In: ILPS 1993: Proc. of the 1993 International Symposium on Logic Programming, vol. 656. MIT Press, Cambridge (1993)Google Scholar
- 20.Clarke, D., et al.: Deconstructing Reo. In: FOCLASA 2008. ENTCS (2008)Google Scholar
- 24.Inverardi, P., Scriboni, S.: Connectors synthesis for deadlock-free component-based architectures. In: ASE 2001, pp. 174–181. IEEE Computer Society, Los Alamitos (2001)Google Scholar
- 27.Basu, A., et al.: Incremental component-based construction and verification of a robotic system. In: ECAI, pp. 631–635 (2008)Google Scholar