371 search results - page 28 / 75 » Pushdown Automata Simulator |
CAV
2003
Springer
15 years 7 months ago
2003
Springer
The paper considers the problem of checking abstraction between two finite-state fair discrete systems (FDS). In automata-theoretic terms this is trace inclusion between two nond...
101
Voted
CSFW
2007
IEEE
15 years 8 months ago
2007
IEEE
We study simulation relations for Probabilistic Automata that require transitions to be matched up to negligible sets provided that computation lengths are polynomially bounded. T...
131
click to vote
MEMOCODE
2003
IEEE
15 years 7 months ago
2003
IEEE
In this paper, we present a technique for determining tight bounds on the execution time of assembler programs. Thus, our method is independent of the design flow, but takes into...
DSRT
2004
IEEE
15 years 5 months ago
2004
IEEE
130
click to vote
ACRI
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. Realistic simulation of biological evolution by necessity requires simplification and reduction in the dimensionality of the corresponding dynamic system. Even when this...