423 search results - page 81 / 85 » Bounded Finite State Controllers |
ATVA
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. This paper argues that flatness appears as a central notion in the verification of counter automata. A counter automaton is called flat when its control graph can be ...
ICT
2004
Springer
14 years 28 days ago
2004
Springer
Array antennas have the potential to increase the capacity of wireless networks, but a distributed beamforming algorithm for maximizing the capacity in asynchronous, decentralized ...
CONCUR
1999
Springer
13 years 12 months ago
1999
Springer
Abstract. The paper presents a partial order reduction method applicable to networks of timed automata. The advantage of the method is that it reduces both the number of explored c...
ESOP
1999
Springer
13 years 12 months ago
1999
Springer
Safety of interoperation of program fragments written in different safe languages may fail when the languages have different systems of computational effects: an exception raised b...
NN
1997
Springer
13 years 11 months ago
1997
Springer
Bayesian networks are directed acyclic graphs that represent dependencies between variables in a probabilistic model. Many time series models, including the hidden Markov models (H...