3229 search results - page 213 / 646 » The Theory of Timed Automata |
302
Voted
CORR
2012
Springer
14 years 2 months ago
2012
Springer
One-clock priced timed games is a class of two-player, zero-sum, continuous-time games that was defined and thoroughly studied in previous works. We show that One-clock priced ti...
170
Voted
MST
2006
15 years 6 months ago
2006
We consider packet networks and make use of the adversarial queuing theory" model 10 . We are interested in the question of guaranteeing that all packets are actually deliver...
162
click to vote
FOCS
2008
IEEE
16 years 1 months ago
2008
IEEE
The deletion–contraction algorithm is perhaps the most popular method for computing a host of fundamental graph invariants such as the chromatic, flow, and reliability polynomi...
201
click to vote
HICSS
2005
IEEE
16 years 6 days ago
2005
IEEE
This study extends the theory of Recognition Primed Decision-Making by applying it to groups. Furthermore, we explore the application of Template Theory to collaboration. An exper...
156
click to vote
ICFEM
2005
Springer
16 years 3 days ago
2005
Springer
Abstract. In formal testing, the assumption of input enabling is typically made. This assumption requires all inputs to be enabled anytime. In addition, the useful concept of quies...