Abstract
Increasing sizes of present-day distributed software systems call for coordination models which are both modular and scalable. Precise modelling of real-life applications further requires the notion of real-time.
In this paper, we present a modular formal development of a compositional model for real-time coordination in dataflow networks. While real-time dataflow networks are typically asynchronous, our approach includes coordination patterns which combine, but are not limited to, synchrony and asynchrony. We define a constraint- and SAT-based encoding, which allows us to benefit from high-end constraint solving techniques when inspecting valid interactions of the system.
Chapter PDF
Similar content being viewed by others
Keywords
References
Alur, R.: Timed automata. In: Halbwachs, N., Peled, D.A. (eds.) CAV 1999. LNCS, vol. 1633, pp. 8–22. Springer, Heidelberg (1999)
Apt, K.R.: Principles of Constraint Programming. Cambridge Univ. Press, Cambridge (2003)
Arbab, F.: \(\mathcal{R}\mathsf{eo}\): a channel-based coordination model for component composition. Mathematical Structures in Comp. Sci. 14(3), 329–366 (2004)
Baier, C., Sirjani, M., Arbab, F., Rutten, J.J.M.M.: Modeling component connectors in \(\mathcal{R}\mathsf{eo}\) by constraint automata. Sci. Comp. Prog. 61(2), 75–113 (2006)
Biere, A., Cimatti, A., Clarke, E.M., Zhu, Y.: Symbolic model checking without BDDs. In: Cleaveland, W.R. (ed.) TACAS 1999. LNCS, vol. 1579, pp. 193–207. Springer, Heidelberg (1999)
Bonsangue, M., Clarke, D., Silva, A.: Automata for Context-Dependent Connectors. In: Field, J., Vasconcelos, V.T. (eds.) COORDINATION 2009. LNCS, vol. 5521, pp. 184–203. Springer, Heidelberg (2009)
Brock, J.D., Ackerman, W.B.: Scenarios: A model of non-determinate computation. In: DÃaz, J., Ramos, I. (eds.) Formalization of Programming Concepts. LNCS, vol. 107, pp. 252–259. Springer, Heidelberg (1981)
Clarke, D., Costa, D., Arbab, F.: Connector colouring I: Synchronisation and context dependency. Sci. Comp. Prog. 66(3), 205–225 (2007)
Clarke, D., Proença, J., Lazovik, A., Arbab, F.: Deconstructing \(\mathcal{R}\mathsf{eo}\). Electr. Notes Theor. Comput. Sci. 229(2), 43–58 (2009)
Eclipse Coordination Tools, http://reo.project.cwi.nl/
HySAT Bounded Model Checker, http://hysat.informatik.uni-oldenburg.de
Jonsson, B.: A fully abstract trace model for dataflow networks. In: POPL, pp. 155–165 (1989)
Kahn, G.: The semantics of a simple language for parallel programming. In: IFIP Congress, pp. 471–475 (1974)
Kemper, S., Platzer, A.: SAT-based abstraction refinement for real-time systems. Electr. Notes Theor. Comput. Sci. 182, 107–122 (2007)
Kemper, S.: SAT-based verification for timed component connectors. Electr. Notes Theor. Comput. Sci. 255, 103–118 (2009)
The \(\textsc{Math{SAT}}\) 4 SMT solver, http://mathsat4.disi.unitn.it
Ren, S., Agha, G.: RTsynchronizer: Language support for real-time specifications in distributed systems. In: LCT-RTS, pp. 50–59 (1995)
Wegner, P.: Coordination as constrainted interaction (extended abstract). In: Hankin, C., Ciancarini, P. (eds.) COORDINATION 1996. LNCS, vol. 1061, pp. 28–33. Springer, Heidelberg (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kemper, S. (2010). Compositional Construction of Real-Time Dataflow Networks. In: Clarke, D., Agha, G. (eds) Coordination Models and Languages. COORDINATION 2010. Lecture Notes in Computer Science, vol 6116. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13414-2_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-13414-2_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-13413-5
Online ISBN: 978-3-642-13414-2
eBook Packages: Computer ScienceComputer Science (R0)