3991 search results - page 105 / 799 » Bounding homogeneous models |
137
Voted
LATIN
2010
Springer
16 years 2 days ago
2010
Springer
Concurrent compositions of recursive programs with finite a natural abstraction model for concurrent programs. Since reachability is undecidable for this class, a restricted form ...
133
click to vote
QEST
2006
IEEE
15 years 11 months ago
2006
IEEE
The time-bounded reachability problem for continuoustime Markov chains (CTMCs) amounts to determine the probability to reach a (set of) goal state(s) within a given time span, suc...
175
Voted
LICS
2006
IEEE
15 years 11 months ago
2006
IEEE
aic semantics, which conveniently abstracts from the details of a given model class and thus allows covering a broad range of logics in a uniform way. Categories and Subject Descri...
145
click to vote
ATAL
2004
Springer
15 years 10 months ago
2004
Springer
We propose a context-logic style formalism, Timed Reasoning Logics (TRL), to describe resource-bounded reasoners who take time to derive consequences of their knowledge. The seman...
116
click to vote
ESA
2003
Springer
15 years 10 months ago
2003
Springer
We present a new finger search tree with O(1) worst-case update time and O(log log d) expected search time with high probability in the Random Access Machine (RAM) model of comput...