441 search results - page 49 / 89 » Refinement of Time |
CORR
2010
Springer
15 years 1 months ago
2010
Springer
We introduce a generic extension of the popular branching-time logic CTL which refines the temporal until and release operators with formal languages. For instance, a language may ...
115
click to vote
COMCOM
2006
15 years 1 months ago
2006
This paper presents an analytical model of TCP Reno throughput as a function of loss event rate, average round trip time, average retransmission timeout value, and receiver window...
138
Voted
ENTCS
2006
15 years 1 months ago
2006
Bounded Model Checking (BMC) searches for counterexamples to a property with a bounded length k. If no such counterexample is found, k is increased. This process terminates when ...
JC
2008
15 years 1 months ago
2008
We describe an algorithm to count the number of distinct real zeros of a polynomial (square) system f. The algorithm performs O(log(nD(f))) iterations (grid refinements) where n is...
AMAI
2002
Springer
15 years 1 months ago
2002
Springer
This paper introduces a framework for modeling the movement of objects or individuals over multiple granularities. Granularity refers to selecting the appropriate level of detail ...