Probabilistic Models for Reo Connector Circuits
Aus International Center for Computational Logic
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: Verifikation und formale quantitative Analyse„Verifikation und formale quantitative Analyse“ befindet sich nicht in der Liste (Computational Logic, Automatentheorie, Wissensverarbeitung, Knowledge-Based Systems, Knowledge Systems, Wissensbasierte Systeme, Logische Programmierung und Argumentation, Algebra und Diskrete Strukturen, Knowledge-aware Artificial Intelligence, Algebraische und logische Grundlagen der Informatik) zulässiger Werte für das Attribut „Forschungsgruppe“.Algebraic 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}
}