From Coordination to Stochastic Models of QoS

Reo is a channel-based coordination model whose operational semantics is given by Constraint Automata (CA). Quantitative Constraint Automata extend CA (and hence, Reo) with quantitative models to capture such non-functional aspects of a system's behaviour as delays, costs, resource needs and consumption, that depend on the internal details of the system. However, the performance of a system can crucially depend not only on its internal details, but also on how it is used in an environment, as determined for instance by the frequencies and distributions of the arrivals of I/O requests. In this paper we propose Quantitative Intentional Automata (QIA), an extension of CA that allow incorporating the influence of a system's environment on its performance. Moreover, we show the translation of QIA into Continuous-Time Markov Chains (CTMCs), which allows us to apply existing CTMC tools and techniques for performance analysis of QIA and Reo circuits.

[1]  Marta Z. Kwiatkowska,et al.  PRISM: Probabilistic Symbolic Model Checker , 2002, Computer Performance Evaluation / TOOLS.

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

[3]  Kishor S. Trivedi,et al.  Performance and Reliability Analysis of Computer Systems , 1996, Springer US.

[4]  Farhad Arbab,et al.  QoS-driven service selection and composition , 2008, 2008 8th International Conference on Application of Concurrency to System Design.

[5]  C. O'Cinneide Characterization of phase-type distributions , 1990 .

[6]  Kishor S. Trivedi,et al.  Performance And Reliability Analysis Of Computer Systems (an Example-based Approach Using The Sharpe Software , 1997, IEEE Transactions on Reliability.

[7]  Brigitte Plateau,et al.  Stochastic Automata Networks: Product Forms and Iterative Solutions , 1996 .

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

[9]  Paulo Fernandes,et al.  Efficient descriptor-vector multiplications in stochastic automata networks , 1998, JACM.

[10]  Farhad Arbab,et al.  Component Connectors with QoS Guarantees , 2007, COORDINATION.

[11]  Raymond A. Marie,et al.  Performability Modelling : Techniques and Tools , 2001 .

[12]  Tak Kuen Siu,et al.  Markov Chains: Models, Algorithms and Applications , 2006 .

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

[14]  Håkan L. S. Younes,et al.  Solving Generalized Semi-Markov Decision Processes Using Continuous Phase-Type Distributions , 2004, AAAI.

[15]  W. Stewart,et al.  The numerical solution of stochastic automata networks , 1995 .

[16]  Francesca Rossi,et al.  Semiring-based constraint satisfaction and optimization , 1997, JACM.

[17]  Jane Hillston,et al.  A compositional approach to performance modelling , 1996 .

[18]  Roberto Gorrieri,et al.  Extended Markovian Process Algebra , 1996, CONCUR.

[19]  Boudewijn R. Haverkort,et al.  Performance and reliability analysis of computer systems: An example-based approach using the sharpe software package , 1998 .

[20]  Tom Chothia,et al.  Q-Automata: Modelling the Resource Usage of Concurrent Components , 2007, FOCLASA.

[21]  Roberto Gorrieri,et al.  A Tutorial on EMPA: A Theory of Concurrent Processes with Nondeterminism, Priorities, Probabilities and Time , 1998, Theor. Comput. Sci..

[22]  Emilio Tuosto,et al.  A Process Calculus for QoS-Aware Applications , 2005, COORDINATION.

[23]  Farhad Arbab,et al.  A Coinductive Calculus of Component Connectors , 2002, WADT.