488 search results - page 5 / 98 » Weighted Logics for Traces |
DLT
2009
13 years 5 months ago
2009
While a mature theory around logics such as MSO, LTL, and CTL has been developed in the pure boolean setting of finite automata, weighted automata lack such a natural connection wi...
VEE
2009
ACM
14 years 2 months ago
2009
ACM
Today’s web applications are pushing the limits of modern web browsers. The emergence of the browser as the platform of choice for rich client-side applications has shifted the ...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
Finite trace semantics is known and well understood for classical automata and non-deterministic labelled transition systems. Jacobs et al introduced a more general definition fo...
DLT
2006
13 years 8 months ago
2006
Abstract. We show that some language theoretic and logical characterizations of recognizable word languages whose syntactic monoid is in the variety DA also hold over traces. To th...
ICCAD
2010
IEEE
13 years 5 months ago
2010
IEEE
Trace buffer technology allows tracking the values of a few number of state elements inside a chip within a desired time window, which is used to analyze logic errors during post-s...