Article2292294252: 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 }} {{Article |Journal=Journal of Universal Computer Science |Number=10 |Pages=1718--1748 |Title=Probabilistic Models for Reo Connector Circuits |Volume=11 |Year=2005 }} {{Publikation Details |DOI Name=10.3217/JUCS-011-10-1718 |Abstract=Constraint automata have been used as an operational model for Reo which offers a channel-based framework to compose complex c…“) |
Johannes Lehmann (Diskussion | Beiträge) K (Textersetzung - „Verifikation und formale quantitative Analyse“ durch „Algebraische und logische Grundlagen der Informatik“) |
||
| Zeile 14: | Zeile 14: | ||
|DOI Name=10.3217/JUCS-011-10-1718 | |DOI Name=10.3217/JUCS-011-10-1718 | ||
|Abstract=Constraint automata have been used as an operational model for Reo which offers a channel-based framework to compose complex component connectors. In this paper, we introduce a variant of constraint automata with discrete probabilities and nondeterminism, called probabilistic constraint automata. These can serve for compositional reasoning about connector components, modelled by Reo circuits with unreliable channels, eg, that might lose or corrupt messages, or channels with random output values that, eg, can be helpful to model randomized coordination principles. | |Abstract=Constraint automata have been used as an operational model for Reo which offers a channel-based framework to compose complex component connectors. In this paper, we introduce a variant of constraint automata with discrete probabilities and nondeterminism, called probabilistic constraint automata. These can serve for compositional reasoning about connector components, modelled by Reo circuits with unreliable channels, eg, that might lose or corrupt messages, or channels with random output values that, eg, can be helpful to model randomized coordination principles. | ||
|Forschungsgruppe= | |Forschungsgruppe=Algebraische und logische Grundlagen der Informatik | ||
}} | }} | ||
Aktuelle Version vom 5. März 2025, 15:42 Uhr
Probabilistic Models for Reo Connector Circuits
Christel BaierChristel Baier
Christel Baier
Probabilistic Models for Reo Connector Circuits
Journal of Universal Computer Science, 11(10):1718--1748, 2005
Probabilistic Models for Reo Connector Circuits
Journal of Universal Computer Science, 11(10):1718--1748, 2005
- KurzfassungAbstract
Constraint automata have been used as an operational model for Reo which offers a channel-based framework to compose complex component connectors. In this paper, we introduce a variant of constraint automata with discrete probabilities and nondeterminism, called probabilistic constraint automata. These can serve for compositional reasoning about connector components, modelled by Reo circuits with unreliable channels, eg, that might lose or corrupt messages, or channels with random output values that, eg, can be helpful to model randomized coordination principles. - Forschungsgruppe:Research Group: Algebraische und logische Grundlagen der InformatikAlgebraic and Logical Foundations of Computer Science
@article{B2005,
author = {Christel Baier},
title = {Probabilistic Models for Reo Connector Circuits},
journal = {Journal of Universal Computer Science},
volume = {11},
number = {10},
year = {2005},
pages = {1718--1748},
doi = {10.3217/JUCS-011-10-1718}
}
