161 search results - page 7 / 33 » fuin 2006 |
123
click to vote
FUIN
2007
15 years 4 months ago
2007
Concurrent runs reveal more insight into distributed systems than interleaved runs. This is shown by help of Dijkstra’s paradigm of five philosophers.
137
click to vote
FUIN
2002
15 years 4 months ago
2002
We consider the notion of algorithmic randomness relative to an oracle. We prove that the probability
142
click to vote
FUIN
2002
15 years 4 months ago
2002
Abstract. We exhibit one-dimensional cellular automata whose reachability and confluence problems have arbitrary r.e. degree of unsolvability.
111
click to vote
FUIN
2006
15 years 4 months ago
2006
The paper introduces the formal description of a computing multi-agent system (MAS), its architecture and dynamics (sections 2
139
Voted
FUIN
2007
15 years 4 months ago
2007
Reachability analysis for timed automata using SAT-based methods was considered in many papers, occurring to be a very efficient model checking technique. In this paper we show ho...