Stochastic Reasoning About Channel-Based Component Connectors

Constraint automata have been used as an operational model for component connectors that coordinate the cooperation and communication of the components by means of a network of channels. In this paper, we introduce a variant of constraint automata (called continuous-time constraint automata) that allows us to specify time-dependent stochastic assumptions about the channel connections or the component interfaces, such as the arrival rates of communication requests, the average delay of enabled I/O-operations at the channel ends or the stochastic duration of internal computations. This yields the basis for a performance analysis of channel-based coordination mechanisms. We focus on compositional reasoning and discuss several bisimulation relations on continuous-time constraint automata. For this, we adapt notions of strong and weak bisimulation that have been introduced for similar stochastic models and introduce a new notion of weak bisimulation which abstracts away from invisible non-stochastic computations as well as the internal stochastic evolution.

[1]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

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

[3]  Christel Baier,et al.  Trace Semantics for Stochastic Systems with Nondeterminism , 2006, QAPL.

[4]  Prakash Panangaden,et al.  Measure and probability for concurrency theorists , 2001, Theor. Comput. Sci..

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

[6]  Franco Zambonelli,et al.  Coordination of Internet Agents: Models, Technologies, and Applications , 2014, Coordination of Internet Agents: Models, Technologies, and Applications.

[7]  Christel Baier,et al.  Probabilistic Models for Reo Connector Circuits , 2005, J. Univers. Comput. Sci..

[8]  Oscar Nierstrasz,et al.  Component-oriented software development , 1992, CACM.

[9]  Frank D. Valencia,et al.  Formal Methods for Components and Objects , 2002, Lecture Notes in Computer Science.

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

[11]  Eugene A. Feinberg,et al.  Continuous Time Discounted Jump Markov Decision Processes: A Discrete-Event Approach , 2004, Math. Oper. Res..

[12]  Christel Baier,et al.  Efficient Computation of Time-Bounded Reachability Probabilities in Uniform Continuous-Time Markov Decision Processes , 2005, TACAS.

[13]  Holger Hermanns,et al.  Interactive Markov Chains , 2002, Lecture Notes in Computer Science.

[14]  Chris Hankin,et al.  Continuous-Time Probabilistic KLAIM , 2005, SecCo.

[15]  Farhad Arbab,et al.  Compositional Construction of Web Services Using Reo , 2018, WSMAI.

[16]  Mario Bravetti.  Revisiting Interactive Markov Chains , 2002, Electron. Notes Theor. Comput. Sci..

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

[18]  Joost-Pieter Katoen,et al.  The Modest Modeling Tool and Its Implementation , 2003, Computer Performance Evaluation / TOOLS.

[19]  Christel Baier,et al.  Efficient computation of time-bounded reachability probabilities in uniform continuous-time Markov decision processes , 2005, Theor. Comput. Sci..

[20]  Farhad Arbab.  Abstract Behavior Types: a foundation model for components and their composition , 2005, Sci. Comput. Program..

[21]  Christel Baier,et al.  Models and temporal logics for timed component connectors , 2004, Proceedings of the Second International Conference on Software Engineering and Formal Methods, 2004. SEFM 2004..

[22]  J. Kemeny,et al.  Denumerable Markov chains , 1969 .

[23]  Paul Gastin,et al.  A simple process algebra based on atomic actions with resources , 2004, Mathematical Structures in Computer Science.

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

[25]  Christel Baier,et al.  Comparative branching-time semantics for Markov chains , 2005, Inf. Comput..

[26]  Paolo Ciancarini,et al.  Coordination models and languages as software integrators , 1996, CSUR.

[27]  Farhad Arbab,et al.  Modelling Coordination in Biological Systems , 2004, ISoLA.

[28]  Nicholas Carriero,et al.  Coordination languages and their significance , 1992, CACM.

[29]  Corrado Priami,et al.  Stochastic pi-Calculus , 1995, Comput. J..

[30]  P. Buchholz.  Exact and ordinary lumpability in finite Markov chains , 1994, Journal of Applied Probability.

[31]  Martin L. Puterman,et al.  Markov Decision Processes: Discrete Stochastic Dynamic Programming , 1994 .