Inproceedings1887279464: Unterschied zwischen den Versionen
Aus International Center for Computational Logic
Johannes Lehmann (Diskussion | Beiträge) (Die Seite wurde neu angelegt: „{{Publikation Erster Autor |ErsterAutorVorname=Christel |ErsterAutorNachname=Baier |FurtherAuthors=Verena Wolf}} {{Inproceedings |Booktitle=Proc. of the 8th International Conference on Coordination Models and Languages (COORD) |Pages=1--15 |Publisher=Springer |Series=Lecture Notes in Computer Science |Title=Stochastic Reasoning About Channel-Based Component Connectors |Volume=4038 |Year=2006 }} {{Publikation Details |DOI Name=10.1007/1176795…“) |
Johannes Lehmann (Diskussion | Beiträge) K (Textersetzung - „Verifikation und formale quantitative Analyse“ durch „Algebraische und logische Grundlagen der Informatik“) |
||
| Zeile 15: | Zeile 15: | ||
|DOI Name=10.1007/11767954_1 | |DOI Name=10.1007/11767954_1 | ||
|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. | |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. | ||
|Forschungsgruppe= | |Forschungsgruppe=Algebraische und logische Grundlagen der Informatik | ||
}} | }} | ||
Aktuelle Version vom 5. März 2025, 15:41 Uhr
Stochastic Reasoning About Channel-Based Component Connectors
Christel BaierChristel Baier, Verena WolfVerena Wolf
Christel Baier, Verena Wolf
Stochastic Reasoning About Channel-Based Component Connectors
Proc. of the 8th International Conference on Coordination Models and Languages (COORD), volume 4038 of Lecture Notes in Computer Science, 1--15, 2006. Springer
Stochastic Reasoning About Channel-Based Component Connectors
Proc. of the 8th International Conference on Coordination Models and Languages (COORD), volume 4038 of Lecture Notes in Computer Science, 1--15, 2006. Springer
- KurzfassungAbstract
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. - Forschungsgruppe:Research Group: Algebraische und logische Grundlagen der InformatikAlgebraic and Logical Foundations of Computer Science
@inproceedings{BW2006,
author = {Christel Baier and Verena Wolf},
title = {Stochastic Reasoning About Channel-Based Component Connectors},
booktitle = {Proc. of the 8th International Conference on Coordination Models
and Languages (COORD)},
series = {Lecture Notes in Computer Science},
volume = {4038},
publisher = {Springer},
year = {2006},
pages = {1--15},
doi = {10.1007/11767954_1}
}
