94 search results - page 8 / 19 » Reaching and Distinguishing States of Distributed Systems |
COLT
1995
Springer
13 years 11 months ago
1995
Springer
We propose and analyze a distribution learning algorithm for a subclass of Acyclic Probabilistic Finite Automata (APFA). This subclass is characterized by a certain distinguishabi...
CONCUR
2009
Springer
14 years 2 months ago
2009
Springer
One-counter automata are a fundamental and widely-studied class of infinite-state systems. In this paper we consider one-counter automata with counter updates encoded in binary—...
EICS
2011
ACM
12 years 11 months ago
2011
ACM
This paper describes a model-based approach for designing distributed user interfaces (DUIs), i.e. graphical user interfaces that are distributed along one or many of the followin...
JAIR
2008
13 years 7 months ago
2008
In this article we consider the issue of optimal control in collaborative multi-agent systems with stochastic dynamics. The agents have a joint task in which they have to reach a ...
SSS
2007
Springer
14 years 1 months ago
2007
Springer
We introduce a new abstract system, called the truth system. In the truth system, a process deduces a true value, with high probability, from an incoming stream of both true and fa...