535 search results - page 59 / 107 » Checking Computations in Polylogarithmic Time |
TIME
2003
IEEE
14 years 2 months ago
2003
IEEE
We investigate expressivity and complexity of hybrid logics on linear structures. Hybrid logics are an enrichment of modal logics with certain first-order features which are algo...
ENTCS
2002
13 years 8 months ago
2002
We report on the automatic verification of timed probabilistic properties of the IEEE 1394 root contention protocol combining two existing tools: the real-time modelchecker Kronos...
SCL
2010
13 years 3 months ago
2010
The stabilization of uncertain LTI/LPV time delay systems with time varying delays by statefeedback controllers is addressed. At the difference of other works in the literature, t...
ICALP
1994
Springer
14 years 1 months ago
1994
Springer
We introduce a formal framework to study the time and space complexity of computing with faulty memory. For the fault-free case, time and space complexities were studied using the...
TGC
2007
Springer
14 years 3 months ago
2007
Springer
Many techniques exist for statically computing properties of the evolution of processes expressed in process algebras. Static analysis has shown how to obtain useful results that c...