318 search results - page 46 / 64 » On the Computational Power of 1-Deterministic and Sequential... |
CONCUR
2009
Springer
15 years 4 months ago
2009
Springer
Bisimulation equivalence is decidable in polynomial time for both sequential and commutative normed context-free processes, known as BPA and BPP, respectively. Despite apparent sim...
ICALP
2009
Springer
15 years 10 months ago
2009
Springer
We present an AC1 (logDCFL) algorithm for checking LTL formulas over finite paths, thus establishing that the problem can be efficiently parallelized. Our construction provides a f...
103
click to vote
IEEEPACT
2006
IEEE
15 years 3 months ago
2006
IEEE
Thread escape analysis conservatively determines which objects may be accessed in more than one thread. Thread escape analysis is useful for a variety of purposes – finding rac...
ALMOB
2006
14 years 9 months ago
2006
Background: Bifurcation analysis has proven to be a powerful method for understanding the qualitative behavior of gene regulatory networks. In addition to the more traditional for...
ERSHOV
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. Two formal models for description of timing attacks are presented, studied and compared with other security concepts. The models are based on a timed process algebra and ...