2632 search results - page 100 / 527 » Alternating Timed Automata |
121
click to vote
ASMTA
2008
Springer
15 years 3 months ago
2008
Springer
The solution of continuous and discrete-time Markovian models is still challenging mainly when we model large complex systems, for example, to obtain performance indexes of paralle...
122
click to vote
IPPS
2000
IEEE
15 years 6 months ago
2000
IEEE
Cellular automata can be used to design high-performance natural solvers on parallel computers. This paper describes the development of applications using CARPET, a high-level prog...
108
click to vote
HYBRID
1999
Springer
15 years 5 months ago
1999
Springer
Abstract. One of the most important analysis problems of hybrid systems is the reachability problem. State of the art computational tools perform reachability computation for timed...
104
click to vote
LPAR
2010
Springer
14 years 11 months ago
2010
Springer
A rational and selfish environment may have an incentive to cheat the system it interacts with. Cheating the system amounts to reporting a stream of inputs that is different from ...
102
click to vote
CORR
2009
Springer
14 years 11 months ago
2009
Springer
The minimal deterministic finite automaton is generally used to determine regular languages equality. Using Brzozowski's notion of derivative, Antimirov and Mosses proposed a...