Coordination languages and their significance
Communications of the ACM
Component-oriented software development
Communications of the ACM - Special issue on analysis and modeling in software development
Coordination models and languages as software integrators
ACM Computing Surveys (CSUR)
A compositional approach to performance modelling
A compositional approach to performance modelling
Measure and probability for concurrency theorists
Theoretical Computer Science - Special issues on models and paradigms for concurrency
Markov Decision Processes: Discrete Stochastic Dynamic Programming
Markov Decision Processes: Discrete Stochastic Dynamic Programming
Communication and Concurrency
Extended Markovian Process Algebra
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
Reo: a channel-based coordination model for component composition
Mathematical Structures in Computer Science
Formal Methods for Components and Objects: First International Symposium, Fmco 2002, Leiden, the Netherlands, November 2002: Revised Lectures (Lecture Notes in Computer Science, 2852)
Continuous Time Discounted Jump Markov Decision Processes: A Discrete-Event Approach
Mathematics of Operations Research
Models and Temporal Logics for Timed Component Connectors
SEFM '04 Proceedings of the Software Engineering and Formal Methods, Second International Conference
Abstract behavior types: a foundation model for components and their composition
Science of Computer Programming - Formal methods for components and objects pragmatic aspects and applications
Modeling component connectors in Reo by constraint automata
Science of Computer Programming - Special issue on second international workshop on foundations of coordination languages and software architectures (FOCLASA'03)
Continuous-Time Probabilistic KLAIM
Electronic Notes in Theoretical Computer Science (ENTCS)
Modelling coordination in biological systems
ISoLA'04 Proceedings of the First international conference on Leveraging Applications of Formal Methods
Web services choreography and orchestration in Reo and constraint automata
Proceedings of the 2007 ACM symposium on Applied computing
Q-Automata: Modelling the Resource Usage of Concurrent Components
Electronic Notes in Theoretical Computer Science (ENTCS)
Recasting Constraint Automata into Büchi Automata
Proceedings of the 5th international colloquium on Theoretical Aspects of Computing
Component connectors with QoS guarantees
COORDINATION'07 Proceedings of the 9th international conference on Coordination models and languages
On resource-sensitive timed component connectors
FMOODS'07 Proceedings of the 9th IFIP WG 6.1 international conference on Formal methods for open object-based distributed systems
Channel-based coordination via constraint satisfaction
Science of Computer Programming
Büchi automata for modeling component connectors
Software and Systems Modeling (SoSyM)
Formal modeling
A compositional model to reason about end-to-end QoS in Stochastic Reo connectors
Science of Computer Programming
Hi-index | 0.00 |
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.