• We propose an extension for Reo, including both new primitive channels and semantics as stochastic timed automata. • We adapt PTCTL to describe the properties of stochastic and timed connectors. • We develop a Python framework to model and verify stochastic and timed connectors. Modern distributed systems are often coupled with flexible architectures, composed of heterogeneous components, and deployed on different execution nodes. In such architectures, connectors (or middlewares) are widely used to orchestrate the separated components and make them functioning. Apparently, correctness of such systems highly depends on the behavior of connectors. Reo is a channel-based coordination language where complex connectors are compositionally constructed from simpler ones. In this paper, we propose a stochastic and real-time extension of Reo, including a set of new primitive channels and an expressive semantics as Stochastic Timed Automata for Reo ( STA r ). Furthermore, a logical formalization of STA r for property analysis has been proposed and the transformation from STA r to PRISM and JANI has been implemented. Several case studies are presented to demonstrate how STA r and its corresponding logic can be used to capture coordination scenarios in the real world.
Read full abstract