Compositional Construction of Real-Time Dataflow Networks

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.

[1]  Krzysztof R. Apt,et al.  Principles of constraint programming , 2003 .

[2]  Farhad Arbab,et al.  Connector colouring I: Synchronisation and context dependency , 2006, Sci. Comput. Program..

[3]  William B. Ackerman,et al.  Scenarios: A Model of Non-Determinate Computation , 1981, ICFPC.

[4]  Peter Wegner,et al.  Coordination as Comstrainted Interaction (Extended Abstract) , 1996, International Conference on Coordination Models and Languages.

[5]  Christel Baier,et al.  Modeling component connectors in Reo by constraint automata , 2004, Sci. Comput. Program..

[6]  Farhad Arbab,et al.  Reo: A Channel-based Coordination Model for Component Composition , 2005 .

[7]  I. Ramos,et al.  Formalization of Programming Concepts , 1981, Lecture Notes in Computer Science.

[8]  Farhad Arbab,et al.  Coordination Models and Languages , 1998, Adv. Comput..

[9]  Farhad Arbab,et al.  Deconstructing Reo , 2009, FOCLASA@ICALP.

[10]  Bengt Jonsson,et al.  A fully abstract trace model for dataflow networks , 1989, POPL '89.

[11]  André Platzer,et al.  SAT-based Abstraction Refinement for Real-time Systems , 2007, FACS.

[12]  Gul A. Agha,et al.  RTsynchronizer: language support for real-time specifications in distributed systems , 1995, Workshop on Languages, Compilers, & Tools for Real-Time Systems.

[13]  Chris Hankin,et al.  Coordinatio Languages and Models , 2002, Lecture Notes in Computer Science.

[14]  Gilles Kahn,et al.  The Semantics of a Simple Language for Parallel Programming , 1974, IFIP Congress.

[15]  S. Kemper,et al.  SAT-based verification for timed component connectors , 2009, Sci. Comput. Program..

[16]  Alexandra Silva,et al.  Automata for Context-Dependent Connectors , 2009, COORDINATION.

[17]  Armin Biere,et al.  Symbolic Model Checking without BDDs , 1999, TACAS.