@book{
 title = {Stochastic reasoning about channel-based component connectors},
 type = {book},
 year = {2006},
 source = {Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)},
 volume = {4038 LNCS},
 id = {0876bd37-e24e-3919-9f62-e4cc0425ad57},
 created = {2017-01-02T09:34:03.000Z},
 file_attached = {false},
 profile_id = {bbb99b2d-2278-3254-820f-2de6d915ce63},
 last_modified = {2017-03-22T13:51:34.979Z},
 read = {false},
 starred = {false},
 authored = {true},
 confirmed = {false},
 hidden = {false},
 private_publication = {false},
 abstract = {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. © Springer-Verlag Berlin Heidelberg 2006.},
 bibtype = {book},
 author = {Baier, C. and Wolf, V.}
}

{"_id":"SzeEehHANZSb4kGbv","bibbaseid":"baier-wolf-stochasticreasoningaboutchannelbasedcomponentconnectors-2006","author_short":["Baier, C.","Wolf, V."],"bibdata":{"title":"Stochastic reasoning about channel-based component connectors","type":"book","year":"2006","source":"Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)","volume":"4038 LNCS","id":"0876bd37-e24e-3919-9f62-e4cc0425ad57","created":"2017-01-02T09:34:03.000Z","file_attached":false,"profile_id":"bbb99b2d-2278-3254-820f-2de6d915ce63","last_modified":"2017-03-22T13:51:34.979Z","read":false,"starred":false,"authored":"true","confirmed":false,"hidden":false,"private_publication":false,"abstract":"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. © Springer-Verlag Berlin Heidelberg 2006.","bibtype":"book","author":"Baier, C. and Wolf, V.","bibtex":"@book{\n title = {Stochastic reasoning about channel-based component connectors},\n type = {book},\n year = {2006},\n source = {Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)},\n volume = {4038 LNCS},\n id = {0876bd37-e24e-3919-9f62-e4cc0425ad57},\n created = {2017-01-02T09:34:03.000Z},\n file_attached = {false},\n profile_id = {bbb99b2d-2278-3254-820f-2de6d915ce63},\n last_modified = {2017-03-22T13:51:34.979Z},\n read = {false},\n starred = {false},\n authored = {true},\n confirmed = {false},\n hidden = {false},\n private_publication = {false},\n abstract = {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. © Springer-Verlag Berlin Heidelberg 2006.},\n bibtype = {book},\n author = {Baier, C. and Wolf, V.}\n}","author_short":["Baier, C.","Wolf, V."],"biburl":"https://bibbase.org/service/mendeley/bbb99b2d-2278-3254-820f-2de6d915ce63","bibbaseid":"baier-wolf-stochasticreasoningaboutchannelbasedcomponentconnectors-2006","role":"author","urls":{},"metadata":{"authorlinks":{}}},"bibtype":"book","biburl":"https://bibbase.org/service/mendeley/bbb99b2d-2278-3254-820f-2de6d915ce63","dataSources":["5u2EFGtZ3pCiduxDD","dXRJbWa2wiNDJKxYE","qA8W3BSHDuk7cCNvk","2252seNhipfTmjEBQ"],"keywords":[],"search_terms":["stochastic","reasoning","channel","based","component","connectors","baier","wolf"],"title":"Stochastic reasoning about channel-based component connectors","year":2006}