93 search results - page 14 / 19 » Weak Alternating Timed Automata |
WIA
2004
Springer
14 years 26 days ago
2004
Springer
Finite automata determinization is a critical operation for numerous practical applications such as regular expression search. Algorithms have to deal with the possible blow up of ...
FM
2003
Springer
14 years 23 days ago
2003
Springer
We present a novel application on model checking through SPIN as a means for verifying purely descriptive specifications written in TRIO, a first order, linear-time temporal logic ...
SIGMOD
2007
ACM
14 years 7 months ago
2007
ACM
There has recently been considerable research on physical design tuning algorithms. At the same time, there is only one published methodology to evaluate the quality of different,...
JHSN
1998
13 years 7 months ago
1998
In this paper we discuss the need for resource reservation in the Internet and examine some of the strengths and weaknesses of RSVP, which is currently the most popular of Interne...
DAGSTUHL
2007
13 years 9 months ago
2007
: This is a position paper introducing blob computing: A Blob is a generic primitive used to structure a uniform computing substrate into an easier-to-program parallel virtual mach...